The Collatz Conjecture

preprint OA: closed CC-BY-4.0
🔓 Open OA copy View at publisher

Abstract

The Collatz conjecture states any positive integer will eventually reach 1 if you repeatedly apply a simple set of rules: if the number is even, divide it by two; if it is odd, multiply it by three and add one. The conjecture is till unproven due to its difficult binary nature between even and odd sequence values. However, a new trigonometric method is proposed to give a general proof that a Collatz sequence always end up at 1. The general path of the proof is similar to Euclid’s proof of the infinitude of primes by ascension.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0