Preprint Article Version 2 Preserved in Portico This version is not peer-reviewed

A Proof of Collatz Conjecture Using Pyramid Fractions

Version 1 : Received: 18 January 2024 / Approved: 19 January 2024 / Online: 19 January 2024 (13:14:04 CET)
Version 2 : Received: 30 January 2024 / Approved: 30 January 2024 / Online: 30 January 2024 (12:51:11 CET)

How to cite: Khoshakhlagh Varnosfaderani, M. A Proof of Collatz Conjecture Using Pyramid Fractions. Preprints 2024, 2024011488. https://doi.org/10.20944/preprints202401.1488.v2 Khoshakhlagh Varnosfaderani, M. A Proof of Collatz Conjecture Using Pyramid Fractions. Preprints 2024, 2024011488. https://doi.org/10.20944/preprints202401.1488.v2

Abstract

In this paper, I introduce a new concept of representing numbers in base ; in other words, I have found new series for any number similar to series that could be written according to the collatz sequence which is called zi(n) in this article. These series need to end with 1. Then, we use two sets of rules to make a diagram which then proves the existence of such series for any number.In this diagram, by branching numbers into different branches in accordance to the modularity of 4 and continuing branching to the point that their numbers have enough common terms in their collatz series, we could reduce zi(n) to zi(k) so that k<n in any branch by Rule Number One. This diagram shows that zi(n) exists for every number, in other words, this proves the theorem (A) or zi-existence theorem. The proof of zi-existence theorem leads to a proof of the collatz conjecture because the collatz series could be written as a linear combination of such series that all of them end with 1, so the collatz series for any number ends with 1.

Keywords

Collatz conjecture; 3x+1 problem; Syracuse problem; pyramid fraction; Ulam’s conjecture; Kakutani’s problem

Subject

Computer Science and Mathematics, Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.