Authors: Zhang Tianshu
If every positive integer is able to be operated to 1 by the set operational rule of the Collatz conjecture, then begin with 1, we can get all positive integers after make infinitely many operations on the contrary of the set operational rule. In this article, we shall prove that the Collatz conjecture by the mathematical induction via the two-way operations is tenable. Keywords: mathematical induction; the two-way operational rules; classify positive integers; the bunch of integers’ chains; operational routes
Comments: 28 Pages.
Download: PDF
[v1] 2016-02-27 09:04:31
Unique-IP document downloads: 158 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.