Brainteaser 1315: The nineteenth hole
From The Sunday Times, 15th November 1987 [link]
A famous English mathematician, J.E. Littlewood, once posed the following puzzle:
Find a number N (sensibly the smallest) such that, if you shift the first digit to the end, the result is exactly one-and-a-half times N.
The solution to this being:
N = 1,176,470,588,235,294.
Professor Egghead has discovered a similar intriguing fact (not in his bath, nor sitting under a fruit-tree; but while relaxing in the club-house, after a round of golf). It is:
A smallest positive integer, M, such that, if one again shifts the leading digit to the end, the result is, this time, exactly just one half of M.
How many digits has M?
[teaser1315]
Jim Randell 8:11 am on 19 May 2024 Permalink |
See: Puzzle #180, Enigma 653, Enigma 924, Teaser 2565, Enigma 1036, Enigma 455, Enigma 1161 (but note these may reveal the answer to this puzzle).
Normally a parasitic number [ @wikipedia ] involves multiplying the number by a(n integer) value by moving the final digit to the front.
This puzzle moves the front digit to the end, so we are looking at the inverse of the process involved in parasitic numbers. So if we find a 2-parasitic number, we can start with it, move the front digit (back) to the end, and it is divided by 2.
For this Python program I adapted my [[
parasitic()
]] function from Enigma 924 to deal with fractional multipliers, and this allows us to solve both problems mentioned in the puzzle text.This program runs in 59ms. (Internal runtime is 167µs).
Run: [ @replit ]
Solution: M has 18 digits.
The smallest number is 210526315789473684.
Note that this is the repetend of 4/19 = 0.(210526315789473684)…
If you don’t mind leading zeros we can apply the same procedure to the result (which also has 18 digits), to get:
See also: OEIS A337922, OEIS A146088.
LikeLike
Frits 3:24 pm on 19 May 2024 Permalink |
LikeLike