Skip to content

Erdős Problem #826

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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.

The question in plain language

Are there infinitely many n for which a single absolute implied constant K satisfies tau(n+k)<=K k simultaneously for ALL integers k>=1? Quantifiers: there exist infinitely many n each satisfying every k with uniform constants; not merely for each fixed k separately.

A small example

For n=1, k=1..5 gives n+k=2..6 with tau values 2,2,3,2,4. The ratios tau(n+k)/k decrease in this finite sample but cannot certify the requirement for all k or infinitely many n.

The example can be checked exactly. A finite witness does not replace the universal, asymptotic, or infinitely-often quantifiers in the original question.

What is known

Maintained https://www.erdosproblems.com/latex/826 read 2026-10-14 OPEN; C. F. Lau [La26], arXiv:2604.15042 (2026), proves infinitely many n with tau(n+k)<=1 for some fixed C. Polynomial in k is not a linear bound. Related to #248. Original preprint full proof and C value not independently read.

The demanded uniform bound is

$$

\tau(n+k)\leq Ck\qquad\text{for every }k\geq1,

$$

on infinitely many selected \(n\) with the same absolute constant \(C\). Lau's 2026 partial theorem gives \(O(k^B)\) for an absolute exponent \(B\) instead. Even when a fixed \(B\) exists, \(k^B\) is not \(O(k)\) unless \(B\leq1\), which is not established by that theorem.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: open linear divisor counts vs lau2026 polynomial. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Write divisor-count checks for specific n and k<=200 with sound quantifier labeling; review Lau 2026 arXiv precise constants and whether k ranges start at 1, avoid claiming k^C -> k.

Independent critical review must compare the historical primary theorem to the written quantifiers, inspect the exact finite fixture, determine whether a claimed status refers to the whole question or a subcase, and validate the actual rendered mathematical output. No protected admission or formal theorem certification is claimed.

Sources and claim boundaries

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2097 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • 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