Preprint Article Version 1 This version is not peer-reviewed

Simplified Proof of the Collatz Conjecture Using Regularity General solution‐Calculation Method by Multiples of 6 and Remainder

Version 1 : Received: 31 July 2024 / Approved: 1 August 2024 / Online: 1 August 2024 (12:33:24 CEST)

How to cite: Shiraishi, H.; Shiraishi, H. Simplified Proof of the Collatz Conjecture Using Regularity General solution‐Calculation Method by Multiples of 6 and Remainder. Preprints 2024, 2024080021. https://doi.org/10.20944/preprints202408.0021.v1 Shiraishi, H.; Shiraishi, H. Simplified Proof of the Collatz Conjecture Using Regularity General solution‐Calculation Method by Multiples of 6 and Remainder. Preprints 2024, 2024080021. https://doi.org/10.20944/preprints202408.0021.v1

Abstract

In solving the Collatz conjecture, it turns out that if we let all integers k be 6n, 6n+1, 6n+2, 6n+3, 6n+4, 6n+5, then we can solve the Collatz conjecture periodically. The Collatz conjecture states that for any positive integer P (initial value), if n is even, divide n by 2; if n is odd, repeat the rule of multiplying n by 3 and adding 1, which always converges to 1. One open problem has been proved by this paper. The authors hope to contribute to the mathematical community by presenting simple proofs of conjectures in the history of mathematics such as the Collatz conjecture.

Keywords

Collatz conjecture; 6n; regularity

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.