3x+1数学猜想的证明

duanbaoyuan

For example,Collatz odd 174757,actual downward steps(k>=3) is 11.Corresponding odd in (*3+2^m-1)/2^k is 524288-174757=349531, transform position(to itself layer) is (349531+1)/2=174766,odd follow 349531 is (349531*3+524288-1)/16=98305,transform position is 196612, position increment is 196612-174766=21846, position inequality is 174766+21846*4*(1-0.75^(n-1))>262144, solution is n>34. 11<34, satisfies conclusion in paper.According to my conclusion,almost all known convergence odd Collatz sequences have the same principle(huge odd is not a strong precondition in paper).

duanbaoyuan

duanbaoyuan 发表于 2023-10-24 03:05
For example,Collatz odd 174757,actual downward steps(k>=3) is 11.Corresponding odd in (*3+2^m-1)/2^k ...

In this example,n represents transform position serial number.If we want it represent step serial number(in order to compare), should use inequality 174766+21846*4*(1-0.75^n)>262144, same as established, as long as actual convergence steps>2 and first k>=3. I have verified up to 2^23-3 using computer, no exception cases exist.

duanbaoyuan

v12有逻辑错误，更新到v13了，采用新方法重构数列

duanbaoyuan

最新版本是preprints.org和researchgate.net上的v14，改正了一些逻辑错误。我相信已完全严格地证明collatz猜想是对的，貌似外网已有小小的影响。论文语言结构不好，本人没有大量的时间精力修改，也不想正式发表，静待花开。

duanbaoyuan

preprints.org和researchgate.net上有最新版本v16，书写比较规范的版本