Number Theory

    

A Proof of the Collatz Conjecture

Authors: Zhang Tianshu

If every positive integer is able to be operated into 1 by set operational rule of the Collatz conjecture, then begin with 1, we can get all positive integers after pass infinite many operations by another operational rule on the contrary to the set operational rule. Thereby, substitute some unknown proof of the former proposition by a poof of the latter proposition, in addition apply mathematical induction, then this is exactly an effective way for proving Collatz conjecture, thus we use it in this article justly.

Comments: 14 Pages.

Download: PDF

Submission history

[v1] 2014-01-17 20:11:18

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