Skip to content

Erdős Problem #1135

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, iterated functions.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Erdős Problem #1135 is the famous Collatz conjecture. For any positive integer \(n\), apply

\[ f(n)= \begin{cases} n/2,&n\text{ even},\\ (3n+1)/2,&n\text{ odd}. \end{cases} \]

Does every starting integer \(m\ge1\) eventually reach \(1\) after some positive number of iterations?

No general proof is known. The conjecture remains open.

A small example

The normalized steps from seven begin

\[ 7\to11\to17\to26\to13\to20\to10\to5\to8\to4\to2\to1. \]

An exact integer-arithmetic program verifies that every seed from \(1\) through \(10,000\) reaches \(1\). The largest first-positive hitting time observed in that range is 165 steps, for seed \(6171\).

The positive-step convention matters for seed \(1\): \(1\to2\to1\), so \(k=2\) is its first positive return. A sweep of finitely many integers, however large, cannot prove convergence of every positive integer.

What is known

The problem originated with Lothar Collatz before 1952, rather than with Erdős. Erdős discussed its difficulty, which explains its inclusion in this catalogue.

Substantial mathematical work concerns typical orbits, density estimates and huge computational ranges. In particular, Tao's partial result about almost-all orbits in logarithmic density does not establish the universal assertion for every integer.

The commonly repeated claim that Erdős formally offered a $500 prize is historically imprecise: Lagarias records that Erdős valued the problem at that amount during conversation with Graham. A prize valuation is not necessarily a formally offered award.

The frozen formal-conjectures source contains an unproved theorem placeholder, not a verified proof.

GCL's current state

Authenticated original-issue audit #2406 distinguishes the normalized map, the positive-return convention and the bounded arithmetic example.

#1135 is a mandatory critical-review sample. Its historical and partial-theorem source claims are not yet independently reviewed, and no Collatz proof is claimed.

What remains

Inspect Lagarias's histories, the precise scope of Tao's partial theorem and the full original problem wording. Independently review the finite verification algorithm, stopping-time convention and mathematical claims. Any later purported proof of the universal conjecture requires extraordinary source and independent mathematical verification.

Sources and claim boundaries

Erdős #1135; historical catalogue source; Lagarias (1985, 2010, 2016); Tao's published partial result; authenticated GCL return. The bounded sweep is independently exact, not a proof of the Collatz conjecture. Unaccepted draft; mandatory critical review pending.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2406 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: DEFER_UNTIL_NEW_MECHANISM.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction