/** * Collaatz Conjecture *, also known as 3n + 1 conjecture, hail conjecture, Kok Valley conjecture, Hascey conjecture, Ulam guesses or Syraguru conjecture, * refers to each positive integer, if it is a strange number, it is a strange number, if it is a strange number Then, multiply 3 plus 1, * If it is even, divide it with 2, so the cycle can eventually get 1. */ Package Al; Public Class CollatzConjecture {Private Int I = 1; Public Static Void Main (String [] ARGS) {Long L = 9999999; SYSTEM.OUT.PRINTLN ("L I s "+ l); colorzconjecture CC = New CollatzConjecture (); CC.Collatz (L);} /*** No one has been able to understand its positive. Interestingly, any counter -examples have not yet been found. * I guess the Rong is: there is a whole, if it is even, divide it with 2; * If it is strange, take 3 and 1. * As soon as I do n’t operate, it must be 1 in the end. * The operation of the operation is a iteration. * @author * @param param 初始输入的数字*/ private void Collatz(long param) { System.out.println("After " + i + " time we get result " + param); if(param > 1) { i ++; if (Param%2 == 0) {colortz (param/2);} else {colorz (3*param+1);}}}}}}