A New Way to Proof 3x+1 Problem
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:2QUW4KF3record.jsonopen to challenge →
classification
math.GM
keywords
numberkindproblembasecyclefourclassifiedform
read the original abstract
Under the 3x+1 problem, classified the number into four kind by mod 4. The four kind number can form a cycle base on 3x+b1 problem. Base on this cycle, if the number of kind number is zero the 3x+1 will be proofed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.