3x+1数学猜想的证明

duanbaoyuan

关键证明在VI小节

duanbaoyuan

preprints.org/manuscript/202301.0541/v5

duanbaoyuan

最新版本是v7。vixra.org，preprints.org和researchgate.net网站都有，必应搜索collatz conjecture排在前面

duanbaoyuan

最新更新: vixra.org 网站Using (*3+2^m-1)/2^k Odd Tree to Solve The Collatz Conjecture，v3; preprints.org和researchgate.net网站 A Solution Of The Collatz Conjecture Problem，v9或最新

duanbaoyuan

duanbaoyuan

欢迎大家下载阅读评论，争取得个小奖

duanbaoyuan

preprints.org/manuscript/202301.0541/v10[/url]

duanbaoyuan

更新到v11了

duanbaoyuan

感兴趣的可以验证我在预印网站留下的评论:
According to my conclusion, we can make a bold prediction and verify: In all known convergence odd Collatz sequences, if start odd a multiply 3 plus 1 divided by 2^k(k>=3) get an odd, the corresponding odd of a in (*3+2^m-1)/2^k odd sequence is b, MSB bit of b is 2^n, then the count of all downward steps(k>=3) from a to final 1 is smaller than n! For example, Collatz odd 1893, corresponding odd is 2203, highest bit is 2^11, all downward steps(k>=3) of 1893 is 5<11.

duanbaoyuan

duanbaoyuan 发表于 2023-10-21 14:22
感兴趣的可以验证我在预印网站留下的评论:
According to my conclusion, we can make a bold prediction a ...

The prediction is a bit adventurous. Best way is to use 3/4 proportional sequence of transform position increment to calculation solution of inequality, then estimate the count of downward steps.