This article introduces a change rule of 3x + 1 problem (Collatz conjecture), it’s named LiKe’s Rule. It’s a map of 3x + 1 problem, and details the path of each step of the change: For any positive integer, change ...This article introduces a change rule of 3x + 1 problem (Collatz conjecture), it’s named LiKe’s Rule. It’s a map of 3x + 1 problem, and details the path of each step of the change: For any positive integer, change by the Collatz conjecture. 1) This positive integer will change to an odd number;2) The odd number must change to a number of LiKe’s second sequence {3<sup>n</sup> – 1| n ∈ Z<sup>+</sup>};3) Then this 3<sup>n</sup> - 1 will change to a smaller 3<sup>n </sup>– 1 and gradually decrease to 8 (that is 3<sup>2</sup> - 1) then back to 1 in the end. If we can determine each step, the Collatz conjecture will be true. This is certainly more valuable than 2<sup>n</sup> (it might even explain 2<sup>n</sup>). And to illustrate the importance of this rule, introduced some important funny corollaries related to it.展开更多
The aim of this paper is to study the 3x + 1 problem based on the Collatz iterative formula. It can be seen from the iterative formula that the necessary condition for the Collatz iteration convergence is that its slo...The aim of this paper is to study the 3x + 1 problem based on the Collatz iterative formula. It can be seen from the iterative formula that the necessary condition for the Collatz iteration convergence is that its slope being less than 1. An odd number N that satisfies the condition of a slope less than 1 after n<sup>th</sup> Collatz iterations is defined as an n-step odd number. Through statistical analysis, it is found that after n<sup>th</sup> Collatz iterations, the iterative value of any n-step odd number N that is greater than 1 is less than N, which proves that the slope less than 1 is a sufficient and necessary condition for Collatz iteration convergence.展开更多
文摘This article introduces a change rule of 3x + 1 problem (Collatz conjecture), it’s named LiKe’s Rule. It’s a map of 3x + 1 problem, and details the path of each step of the change: For any positive integer, change by the Collatz conjecture. 1) This positive integer will change to an odd number;2) The odd number must change to a number of LiKe’s second sequence {3<sup>n</sup> – 1| n ∈ Z<sup>+</sup>};3) Then this 3<sup>n</sup> - 1 will change to a smaller 3<sup>n </sup>– 1 and gradually decrease to 8 (that is 3<sup>2</sup> - 1) then back to 1 in the end. If we can determine each step, the Collatz conjecture will be true. This is certainly more valuable than 2<sup>n</sup> (it might even explain 2<sup>n</sup>). And to illustrate the importance of this rule, introduced some important funny corollaries related to it.
文摘The aim of this paper is to study the 3x + 1 problem based on the Collatz iterative formula. It can be seen from the iterative formula that the necessary condition for the Collatz iteration convergence is that its slope being less than 1. An odd number N that satisfies the condition of a slope less than 1 after n<sup>th</sup> Collatz iterations is defined as an n-step odd number. Through statistical analysis, it is found that after n<sup>th</sup> Collatz iterations, the iterative value of any n-step odd number N that is greater than 1 is less than N, which proves that the slope less than 1 is a sufficient and necessary condition for Collatz iteration convergence.
