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

Solve the 3x+1 Problem

Version 1 : Received: 6 January 2023 / Approved: 9 January 2023 / Online: 9 January 2023 (11:00:24 CET)
Version 2 : Received: 22 January 2023 / Approved: 23 January 2023 / Online: 23 January 2023 (09:33:04 CET)
Version 3 : Received: 27 January 2023 / Approved: 27 January 2023 / Online: 27 January 2023 (10:43:34 CET)
Version 4 : Received: 28 January 2023 / Approved: 30 January 2023 / Online: 30 January 2023 (09:23:25 CET)
Version 5 : Received: 14 February 2023 / Approved: 20 February 2023 / Online: 20 February 2023 (10:26:07 CET)

How to cite: Feng, J. Solve the 3x+1 Problem. Preprints 2023, 2023010163. https://doi.org/10.20944/preprints202301.0163.v1 Feng, J. Solve the 3x+1 Problem. Preprints 2023, 2023010163. https://doi.org/10.20944/preprints202301.0163.v1

Abstract

The 3x+1 problem asks the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Do you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n+1 problem) has been explored for about 85 years. In this article, we prove the Collatz conjecture by modifying Sharkovsky ordering of positive integers and denote the composition of the collatz function as a algebraic formula about $\frac{3^{m}}{(2^{r}}$, convert the problem to a algebraic problem, we can solve it completely.

Keywords

The Collatz conjecture

Subject

Computer Science and Mathematics, Algebra and Number Theory

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.