Different implementations of a simple Collatz iterator and their performance
From ScienceZero
Revision as of 22:10, 2 January 2009 by Bjoern (Talk | contribs) (New page: The Collatz conjecture was proposed by Lothar Collatz in 1937. The conjecture is also known as the 3n + 1 conjecture. The procedure is that for any value of n, if it is divisible by two t...)
The Collatz conjecture was proposed by Lothar Collatz in 1937. The conjecture is also known as the 3n + 1 conjecture.
The procedure is that for any value of n, if it is divisible by two then divide by two, else multiply by 3 and add 1, repeat until n reaches 1. The unproved conjecture is that for all values of n the procedure will always reach 1.
