Skip to content

Erdős Problem #1181

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

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 #1181 asks the following. The maintained status is OPEN.

Write \(q(n,k)\) for the smallest prime dividing none of the consecutive integers \(n+1,\dots,n+k\). The source asks whether some absolute \(c>0\) gives for all sufficiently large \(n\)

\[ q(n,\log n)<(1-c)(\log n)^2. \]

But the product \(\prod_{1\le i\le k}(n+i)\) requires integer \(k\), while \(\log n\) generally is not integral. It is necessary to source-normalize \(k=\lfloor\log n\rfloor\) or \(\lceil\log n\rceil\) and the logarithm base; asymptotic heuristic claims should not silently supply these. Dividing any of the \(k\) factors is distinct from dividing their product.

A small example

Exact prime trial division gives \(q(10,2)=5\), \(q(100,4)=5\), \(q(1000,7)=23\), and \(q(10000,10)=17\), where each \(k\) is explicitly an integer. For example, \((11)(12)\) is divisible by 2, 3 and 11, but not 5, so \(q(10,2)=5\). These sporadic values establish neither a uniform upper bound with constant \(c>0\) nor an asymptotic optimality statement.

What is known

https://www.erdosproblems.com/1181 currently OPEN, [Er79d,p.78]. Standard primorial reasoning yields \(q(n,\log n)\le(1+o(1))(\log n)^2\); a uniform fixed relative improvement is unknown. Tao's probabilistic heuristic, quoted in the comments for #457, suggests potentially a much smaller upper size around \((\log n)(\log\log n)/\log\log\log n\) (asymptotically, subject to precise nesting). #457 addresses lower bounds and shows why one should separate lower and upper problems. No heuristic is an unconditional theorem.

GCL's current state

Authenticated original-issue RESULT/1 research return. GCL independently replayed only the exact bounded fixture in ci/erdos_compendium_007_phase21_checks.py. The general theorem statements above are attributed to their external sources rather than independently certified. This is a locally authored and unaccepted draft.

What remains

Read Erdős 1979 original question for \(\log\) base and rounding convention, verify the primorial upper argument and the related #457 constructions, and distinguish worst-case \(n\) from a probabilistic typical‑\(n\) model. No conclusion about fixed \(c\) follows from four exact samples.

Protected V2 admission requires source fidelity, manuscript QA and any mandatory independent critic reviews; none is inferred from this finite example.

Sources and claim boundaries

https://www.erdosproblems.com/1181 ; [Er79d,p.78], related #457, OEIS references at the maintained page.

Finite evidence receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE21.json. Original GitHub source issue identities unchanged; source-fidelity adjudication, public deployment and V2 editorial acceptance PENDING.

Catalogue and evidence provenance

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