(12C Platinum) 3n+1 Conjecture

[Gamo]

This program allows to test the 3n + 1 conjecture.

Consider an integer n.
If it's even, divide it by 2 (n÷2)
If it's odd, multiply by 3 and add 1 (3n + 1)

No matter what value of n, the sequence will always reach 1.
The question is: if we start with an arbitrary integer will we always reach 1?
Nobody knows.
--------------------------------------
Procedure:
Positive Integer Number [R/S] display 1
[X<>Y] display Total Iterations
[RCL] 1 display how many time is Odd
[RCL] 2 display how many time is Even
--------------------------------------
Example:

Desire Positive Integer Number is 7

7 [R/S] display 1
[X<>Y] display 16 // Total Iterations
[RCL] 1 display 5 // Odd
[RCL] 2 display 11 // Even
-------------------------------------
Program: FIX 0 (ALG Mode) 38 steps

Code:


STO 0
0
STO 1
STO 2
RCL 0 ÷ 2 = FRAC  
X=0
GTO 022
1
STO+1
RCL 0 x 3 + 1 = 
STO 0
GTO 005
------------------------------
1
STO+2
RCL 0 ÷ 2 = 
STO 0
1
X<>Y
X≤Y 
GTO 034
GTO 005
-----------------------------
RCL 1 + RCL 2 =
RCL 0

***Let's try this on a much faster 12C Platinum Emulator.***

[EEX] 99 [R/S] display 1
[X<>Y] display 567
RCL 1 display 92
RCL 2 display 475

That 92 odds VS 475 even numbers !!!

Gamo