Authors: Kurmet Sultan
In this paper we give a brief proof of the Collatz conjecture. It is shown that it is more efficient to start calculating the Collatz function C (n) from odd numbers 6m ± 1. It is further proved that if we calculate by the formula ((6n ± 1)·2^q -1) / 3 on the basis of a sequence of numbers 6n ± 1, increasing the exponent of two by 1 at each iteration, then to each number of the form 6n ± 1 there will correspond a set whose elements are numbers of the form 3t, 6m-1 and 6m + 1. Moreover, all sets are disjoint. Then it is shown that if we construct micro graphs of numbers by combining the numbers 6n ± 1 with their elements of the set 3t, 6m-1 and 6m + 1, then combine the micro graphs by combining equal numbers 6n ± 1 and 6m ± 1, then a tree-like fractal graph of numbers. A tree-like fractal graph of numbers, each vertex of which corresponds to numbers of the form 6m ± 1, is a proof of the Collatz conjecture, since any of its vertices is connected with a finite vertex connected with unity.
Comments: 15 Pages. 15
Unique-IP document downloads: 209 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.