[snarks_when_bored]

So can he solve the 3n+1 conundrum? That thing hit me like a curse when I first encountered it.

I suspect Tammet has difficulty with abstract reasoning, so it's most unlikely that he could do much with the 3n+1 problem.

[inquest]

Well, I had to try. It would have brought peace to my mind. ;-)

[Nataku X]

It's unproven? Eh? It's easy to see why it brings a closure. I'll work on a proof tomorrow.

[Nataku X]

Easy, in the sense it's gonna hit a 2^n number (which, of course, brings closure) sooner or later by gradual trolling of the number...

[ErnBatavia]

3n+1 Problem Statement The 3n+1 conjecture, due to Collatz, is that any positive integer, n, iteratively operated upon by two simple rules leads to 1, having visited a possibly lengthy series of integers. The rules are that n, if odd, is converted to 3n+1, and, if even, is divided by 2. Each new n is treated by the same rules, repeatedly, until 1 is reached. The conjecture remains unproven. Its mathematical proof is the challenge.

Is there some problem with this? Get this theory nailed and you'll know immediately how much gas it will take to drive from L.A. to Des Moines and back, taking the southern route up and the northern route back....Taxes and tips included.