Skip to content

Erdős Problem #1149

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (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

Erdős Problem #1149 asks whether, for every fixed real exponent \(\alpha>0\) that is not an integer, the proportion of integers \(n\le N\) satisfying \(\gcd(n,\lfloor n^\alpha\rfloor)=1\) approaches \(6/\pi^2\).

Let \(C_\alpha(N)\) count those integers. The precise assertion is

\[ \lim_{N\to\infty}\frac{C_\alpha(N)}{N}=\frac6{\pi^2}. \]

The restriction on \(\alpha\) matters: for \(\alpha=1\), \(\gcd(n,n)=n\) and the desired density is zero. Distinguish natural density from logarithmic density and finite numerical proportions.

A small example

For alpha=1/2, floor(n^alpha)=floor sqrt(n), exact gcd computation n<=10000 gives 6009 coprime values, ratio 6009/10000=0.6009, near 6/pi²≈0.6079. This is finite evidence not an asymptotic theorem. For alpha=1 the gcd(n,n)=n counterexample justifies the exclusion of positive integers alpha from domain.

What is known

https://www.erdosproblems.com/1149 PROVED; Bergelson–Richter [BeRi17] proved for all noninteger alpha>0. Maintained record [Va99,1.34], original theorem statement and proof not independently replayed. Formalization metadata requires a dated caveat: the maintained catalogue source at teorth/erdosproblems@b850d1ac (October 16, 2026) flags formalized: yes (updated October 12), while its distinct formal_status remains unformalized. This discrepancy does not establish a kernel-checked proof; the linked artifact and dependencies require independent inspection.

GCL's current state

Authenticated original-issue source return established the bounded source and finite-evidence interface. The case \(\alpha=1\) violates the domain restriction and is a useful diagnostic of why the theorem excludes integer exponents.

All general results cited here remain external until primary-source review.

What remains

ERDOS-1149-BERGELSON-RICHTER-001: obtain 2017 original density theorem and proof, verify fractional power integer-part dependence and all alpha noninteger, and source-check whether proof uses quantitative equidistribution or multiplicative dynamics; compare alpha in (0,1) vs >1.

Primary theorem proof and rate of convergence not source-locked. Externally proved, no Lean proof claimed.

Sources and claim boundaries

https://www.erdosproblems.com/1149 ; Vardi 1999; Bergelson–Richter 2017; exact finite sqrt-gcd fixture.

This is a source-bound, unaccepted editorial draft. Neither protected cohort admission nor proof or Lean certification is implied.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2420 — 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