(12C) 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.

Example: Start with integer 17

17 R/S --> 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1

Program: Collatz conjecture

Code:


01 ENTER
02 ENTER
03 STO 0
04 RCL 0
05   2
06   ÷
07 FRAC
08   2
09   x
10 X=0?
11 GTO 13
12 GTO 23
13 RCL 0
14   2
15   ÷
16 PSE
17 STO 0
18   1
19 X<>Y
20 X≤Y?
21 GTO 31
22 GTO 01
23 RCL 0
24   3
25   x
26   1
27   +
28 PSE
29 STO 0
30 GTO 01
31 RCL 0

Gamo