Someone called James Davis has found a counterexample to John H. Conway’s “Climb to a Prime” conjecture, for which Conway was offering $1,000 for a solution.
The conjecture goes like this, as stated in Conway’s list of $1,000 problems:
Let
be a positive integer. Write the prime factorization in the usual way, e.g. , in which the primes are written in increasing order, and exponents of are omitted. Then bring exponents down to the line and omit all multiplication signs, obtaining a number . Now repeat. So, for example,
. Next, because , it maps, under , to , and since is prime, we stop there forever. The conjecture, in which I seem to be the only believer, is that every number eventually climbs to a prime. The number 20 has not been verified to do so. Observe that
, eventually getting to more than one hundred digits without reaching a prime!
Well, James, who says he is “not a mathematician by any stretch”, had a hunch that a counterexample would be of the form
The number James found was
A lovely bit of speculative maths spelunking!
via Hans Havermann, whom James originally contacted with his discovery.