Preprint / Version 4

Proof that Collatz conjecture is positive using the classiification in binary, the general term of progression of differences and graph theory

##article.authors##

  • Makoto Matsumoto Department of pharmacy, Kitano-hospital

DOI:

https://doi.org/10.51094/jxiv.69

Keywords:

Collatz Conjecture, 3x 1, progression of differences, expected value, digit, binary, classification, a multiple of 3

Abstract

This paper presents a new proof of Collatz conjecture using the classification in binary, a multiple of 3, the general term of progression of differences and graph theory. When Collatz process is done, we focus on numbers. Many sequences of numbers are generated. It is the progression of differences. The general term of progression of differences are computed. Then, the proof of contradiction, a multiple of 3, the general term of progression of differences and the Inverse-Collatz process are used to prove that all positive odd other than one do not enter an infinite loop (e.g. 1 → 3 → 4 → 1) by Collatz process. Using the classification in binary, we focus on the number of digits. We calculate the expected values of digit (multiply 3 and add 1) (A) and (divide by 2) (B). Comparing the expected values of A and B, we find that there are unequal (B is greater than or equal to A). Thus, Collatz process does not diverge to positive infinity and eventually reaches one digit in binary. Since one digit obtained from Collatz process in binary is equal to 1 in decimal, number of times that the Collatz process reaches 1 is limited.

We also prove that the reason why the number converged to 1 by repeating the Collatz process due to the fact that there is no multiple of 3 in the number after the Collatz process.

In graph theory, Collatz process is a directed graph and there is no closed path in a directed graph from the Collatz process. It means that all positive odd other than one do not enter an infinite loop. Therefore, we clarify that Collatz conjecture is positive.

Conflicts of Interest Disclosure

Author has no conflict of interest to declare.

Downloads *Displays the aggregated results up to the previous day.

Download data is not yet available.

References

J. C. Lagrarias, The 3x + 1 Problem and its generalizations, American Math- ematical Monthly, Volume 92, 1985.

Terence. C. Tao, Almost all orbits of the Collatz map attain almost bounded values, arXiv:1909.03562(math).

Paul. J. Andaloro, The 3x+1 problem and directed graphs, Fibonacci Quarterly 40, 2002, p43.

Heinz. Ebert, A Graph Theoretical Approach to the Collatz Problem, arXiv:1905.07575v5(math. GM) 29 Jul 2021.

http://www.kyoritsu-pub.co.jp, Midori Kobayashi, An Introduction to Graph Theory.

http://www.kurims, kyoto-u. ac. jp/ motizuki, INTER-UNIVERSAL TE- ICHMU ̈LLER THEORY I, Fig. 12.1.

Petro Kosobutskyy, arXiv:2306.14635(math).

Downloads

Posted


Submitted: 2022-05-14 04:27:14 UTC

Published: 2022-06-13 02:59:54 UTC — Updated on 2023-08-29 07:18:35 UTC

Versions

Reason(s) for revision

Add the reason why the number converged to 1 by repeating the Collatz process due to the fact that there are no multiples of 3 in the number after the Collatz process. Then the distribution bias of first 3 digits is made. The digit increase after the Collatz process is less than the digit decrease, and that the number of digits increases temporarily but decreases gradually by repeating the Collatz process
Section
Mathematics