Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.09991

The Proof of the Collatz Conjecture

Chin-Long Wey
View original source ↗Read source document ↗Export metadata ↓

Abstract

The 3n+1, or Collatz problem, is one of the hardest math problems, yet still unsolved. The Collatz conjecture is to prove or disprove that the Collatz sequences COL(n) always eventually reach the number of 1, for all n belongs to N+ (all positive integers). The Syracuse conjecture is a (2N+1)-version of Collatz conjecture, where (2N+1) is all odd integers. The Syracuse and Collatz problem can be conceptually described by a tree trunk and branches. The trunk is made of the junctions that produce the main branches, where J0=1 is the root junction. Each branch consists of active and dead junctions, where only the active junctions are capable of producing new sub-branches. Conceptually assuming the trunk and branches can grow indefinitely and can also absorb nutrients from the root. As the tree grows indefinitely, all N+ (2N+1) are included for the Collatz (Syracuse) sequence. This paper develops both inverse Collatz (Syracuse) functions to construct the tree trunk and branches starting from the root junction J0=1 and assign the also positive (odd) integers to all junctions. To verify the Collatz (Syracuse) sequences always eventually reach the number of 1, this paper also develops the PathFinding algorithm. Given n belongs to N+ (2N+1), the algorithm finds a path from n to the root junction J0=1 by the virtual tree structure to prove both Syracuse and Collatz conjectures.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chin-Long Wey. 2025-06-13. The Proof of the Collatz Conjecture. https://arxiv.org/abs/2309.09991

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the convergence of a perturbed one dimensional Mann's process

We study a perturbed version of Mann's iterative process (DMP), defined by \[ x_{n+1} = (1 - θ_n)x_n + θ_n f(x_n) + r_n, \] where $f: [0,1] \to [0,1]$ is a continuous function, $\{θ_n\} \subset [0,1]$ is a given sequence, and $\{r_n\} $ represents an error term. We prove that if the sequence $\{θ_n\} $ converges sufficiently slowly to zero and the error term $ r_n $ is suitably small at infinity, then any sequence $\{x_n\} \subset [0,1] $ generated by this process converges to a fixed point of $f$. In addition, we investigate the asymptotic behavior of the trajectories $ x(t) $ as $ t \to \infty$ for a continuous-time version of the process (DMP). We emphasize the parallels between the discrete and the continuous dynamics. Furthermore, through numerical experiments, we analyze the influence of the sequence $\{θ_n\} $ and the error terms on the stability and the convergence rate of the the discrete and the continuous processes. Notably, we observe that the (DMP) algorithm, when affected by stochastic and relatively large error terms, can outperform the bisection method in efficiently identifying the fixed point set of the function $f$.

math.GM↗
arXiv2026

Explicit formula for the discrete Laplace transform of the Möbius function, related special functions, and a criterion for the Riemann hypothesis

In this paper, we assume that all the zeros of the Riemann zeta function are simple. Under this assumption we give an explicit formula for the function $Φ(e^{-t})=\sum_{n=1}^{\infty}μ(n)e^{-nt}$, as a function of the values of $ζ(s)$ and $ζ'(s)$ at the odd integers and as a function of the zeros of $ζ(s)$. A structural feature distinguishes this formula from the classical explicit formula for the Mertens function: the poles of $Γ(s)$ collide with the trivial zeros of $ζ(s)$, producing double poles whose residues contain a logarithmic term. Using this formula, we give a criterion for the Riemann hypothesis: the bound $O(x^{-1/2})$ on the transform implies the Riemann hypothesis unconditionally, while the converse direction requires additional hypotheses on the zeros. We also introduce special entire functions related to $ζ(s)$ and show that they admit absolutely convergent closed forms as Möbius-weighted series of Bessel functions of rotated argument.

math.GM↗
arXiv2026

There exist blow-ups in the incompressible Navier-Stokes equation

In this paper, we solve the Navier-Stokes equation, one of the seven Millennium Prize Problems suggested by Clay Mathematics Institute(CMI). In our paper, the fluid is confined in a solid sphere. We prove that, for any initial velocity u0, there has been a force vector f , such that there exists no smooth solution (p,u) to the respective Navier-Stokes equation. This result also holds for the Euler equation. The paper was first published in 2021, soon after, Professor PG Lemarié-Rieusset contact me and tell that there is a possible flaw, because u may be non-integrable when it decreases not very fast. Hence, I withdraw the paper. Through carefull consideration of several years, we think we can choose a fluid confined in a solid sphere to fix it. So, we update the paper now.

math.GM↗