General Mathematics

    

Using (*3+2^m-1)/2^k Odd Tree to Solve The Collatz Conjecture Problem

Authors: Baoyuan Duan

Build a special identical equation, use its calculation characters to prove and search for solution of any odd converging to 1 equation through (*3+1)/2^k operation, change the operation to (*3+2^m-1)/2^k, get a solution for this equation. Furthermore, analysis the sequences produced by iteration calculation during the procedure of searching for solution, build a weight function model, prove it monotonically decreases, build a complement weight function model, prove it has many chances to increase to its convergence state. Build a (*3+2^m-1)/2^k odd tree, prove if odd in (*3+2^m-1)/2^k long huge odd sequence can not converge, the sequence must walk out of the boundary of the tree after infinite steps of (*3+2^m-1)/2^k operation.

Comments: 13 Pages.

Download: PDF

Submission history

[v1] 2023-04-08 02:22:05
[v2] 2023-06-22 03:01:08
[v3] 2023-07-20 13:42:19
[v4] 2023-08-10 03:32:19 (removed)
[v5] 2023-09-19 10:22:02 (removed)
[v6] 2024-01-23 01:55:12

Unique-IP document downloads: 456 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus