This is the 3*x + 1 Problem => The Collatz Conjecture 3*x + 1 => if the result is odd then calculate 3*x + 1 If the result is even divide by 2 Here is the Three-X-Plus-1 Problem Enter-01 Enter the 3 here or any other number try 5 or 7 Enter-02 Enter the x here = 7 => Start with any number Enter-03 Enter the number of cycles you want here = 300 Result-01 04 = Result of the calculation Result-02 05 = Searching for the first 1 if it exists Result-03 06 = Saved results from Result-01 Result-04 07 = If the Result-01 value =1 => this is the Cycle # when the value = 1 = first 1 Result-05 08 = Choosing which calculation to perform Result-06 09 = Counting the cycles here Result-07 10 = How many times it divided by 2 Result-08 11 = How many times it did not divide by 2 Result-07 is always higher than Result-08 => ?? Find the 1 => Check for the first 1 => Check for a repeating pattern => if there are matches there is a repeating pattern or loop Click Here => 12 = How many cycles = g5 = t10 13 = How many matches = t7 => Repeating Loop 14 = Last Count = t9 15 = i and j => Shows each match If it does not repeat within 300 cycles, it probably does not repeat 4 - 4 => repeats after 23 cycles then repeats every 4th cycle 8 - 8 => repeats after 15 cycles then repeats every 5th cycle 5 - 3 => repeats after 6 cycles then repeats every 8th cycle 5 - 15 => repeats after 7 cycles then repeats every 8th cycle The bigger numbers require more cycles to look for repeating patterns