Number Theory

    

3n+1 Conjecture: A Proof or Almost

Authors: A. Makarenko

The Collatz algorithm is rewritten to remove divisions by two and to transform it from a hailstone to a steadily growing value. In contrast with the original problem this new sequence becomes reversible and it is reverted in combinatorial way to find all integers leading to the sequence end. Computer programs are available for demonstrations and experimenting.

Comments: 4 Pages.

Download: PDF

Submission history

[v1] 2023-11-12 21:44:27

Unique-IP document downloads: 140 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