Number Theory

    

Prove Collatz Conjecture via Operations for Integer Expressions plus Few Integers

Authors: Zhang Tianshu

First, let us set forth certain of basic concepts related to proving Collatz conjecture. After that, list the mathematical induction that proves the conjecture, and prepare two theorems plus one lemma, which are used to judge relevant operational results. Next, classify integers successively and prove a class by the theorem 1, after each classification. Until the last two classes are proved bidirectionally, which are to start with several proven kinds to expand successively the scope of proven kinds up to all kinds are proven and star with each unproven kind to a proven kind via operations.

Comments: 15 Pages.

Download: PDF

Submission history

[v1] 2020-05-13 19:22:11
[v2] 2023-02-13 10:23:47

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