| t(x) | = | 2x | if 3 divides x, |
| t(x) | = | (7x+2)/3 | if 3 divides x-1, |
| t(x) | = | (x-2)/3 | if 3 divides x+1, |
It is conjectured by Keith Matthews (who offers a $100 Australian prize for a resolution of this conjecture) that every trajectory will find its way into the zero residue class (mod 3) or else enter one of three cycles: 0, 0; -1,-1; -2,-4,-2. (See online survey on generalized 3x+1 mappings.)
The algorithm is performed with starting values y= 3M+1 and y=3M-1.
Last modified 12th March 2010
Return to main page