Skip to content

Erdős Problem #1134

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

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

Start with \(1\), then repeatedly apply three rules:

\[ x\mapsto2x+1,\qquad x\mapsto3x+1,\qquad x\mapsto6x+1. \]

Let \(A\) be the smallest set of positive integers containing \(1\) and closed under the rules. Erdős Problem #1134 asks whether \(A\) contains a positive lower proportion of the positive integers.

The externally proved answer is no: the density of \(A\) is zero.

A small example

Applying the maps to \(1\) gives \(3,4,7\). Later steps may reach the same integer through different expression trees, so it is important to count distinct reachable integers, not the number of sequences of operations.

An exact breadth-first closure algorithm enumerates every reachable integer at most \(100,000\) and finds

\[ |A\cap[1,100000]|=14878. \]

This finite fraction is about \(14.878\%\). It does not establish the limiting density.

What is known

Crampin and Hilton proved a much stronger asymptotic statement, reported by Klarner and expounded by Lagarias:

\[ |A\cap[1,X]|\ll X^{\tau+o(1)}, \]

where \(\tau\approx0.900626<1\) is the unique positive root of

\[ 6^{-\tau}+\sum_{k\ge0}(3\cdot2^k)^{-\tau}=1. \]

Since \(\tau<1\), the ratio \(|A\cap[1,X]|/X\) tends to zero. This disproves positive lower density.

An older, general bound of Erdős for affine closure sets does not suffice here. Its direct exponent condition \(2^{-\sigma}+3^{-\sigma}+6^{-\sigma}=1\) gives only \(\sigma=1\).

Several related affine-closure questions due to Klarner remain open, and their status should not be transferred from this solved instance.

GCL's current state

Authenticated source audit #2405 verifies the finite deduplicated closure and records the external Crampin–Hilton theorem with its strict exponent reduction.

The original asymptotic proof has not been independently replayed.

What remains

Read Klarner and Lagarias, confirm the exact theorem and numerical exponent, and replicate the bounded closure by an independent reverse-recursion implementation. Keep finite empirical counts separate from the infinite theorem.

Sources and claim boundaries

Erdős #1134; Klarner (1982); Lagarias (2016); GCL return. Externally disproved, finite count independently checked. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2405 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider 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