Monday, May 15, 2006

That lovely problem is back...

So... unhappy with trying to find proper solutions of quadratic diophantic equations in hard cases, that other problem is back... determining whether, if x is an integer,

f(2x) = x,
otherwise f(x) = 3x+1

will end up with f(f(...)) = 1 for all positive integers. If someone is working on this, please drop me a line and maybe we can exchange notes.

This problem is also known as the Syracuse algorithm, Collatz's problem, the 3x+1 problem, and other names.

No comments: