Skip to content

Erdős Problem #1180

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

For every \(\epsilon>0\) ask whether some constant \(C_\epsilon\) independent of prime \(p\) suffices to represent every residue \(a\bmod p\) as a sum of at most \(C_\epsilon\) elements of

\[ A_{p,\epsilon}=\{n^{-1}\bmod p:1\le n\le p^\epsilon\}. \]

Repetitions of summands are allowed unless the original source specifies otherwise; this is an additive sumset diameter question, not multiplicative inverses of arbitrary residues or a covering by distinct denominators. For very small \(p\) where the denominator range contains zero mod \(p\), restrict to invertible \(n\) as needed; the main statement concerns all primes under fixed \(\epsilon\).

A small example

For \(p=11\) and \(\epsilon=1/2\), the denominators are \(1,2,3\) and their inverses modulo 11 are \(\{1,6,4\}\). Exact breadth-first modular sumset computation shows reachable-residue counts with at most 0,1,2,3 summands are respectively 1,4,9,11. Thus every residue modulo 11 is covered by at most 3 summands, and two do not suffice. This says nothing about one \(C_{\epsilon}\) uniformly for all primes.

What is known

The maintained https://www.erdosproblems.com/1180 marks PROVED. Croot obtained \((\log p)^{3+o(1)}\) summands, insufficient for constant \(C_\epsilon\). Shparlinski [Sh02] established a uniform \(C_\epsilon\ll\epsilon^{-3}\), improved by Glibichuk [Gl06] to \(C_\epsilon\ll\epsilon^{-2}\). Counting possible ordered sums forces a lower bound of order \(\epsilon^{-1}\) in the relevant asymptotic regime. The precise integer rounding for \(p^\epsilon\) and zero-residue conventions need primary-source verification.

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 Shparlinski 2002 and Glibichuk 2006 proofs to lock \(\epsilon\) exponents, possible exclusions of \(n\) divisible by \(p\) when \(\epsilon>1\), and the repetition policy. Derive a universal counting lower bound without treating the \(p=11\) case as general.

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/1180 ; [ErGr80,p.103],[Sh02],[Gl06], related #540.

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: #2451 — 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