Erdős Problem #1056
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
Suppose we arrange consecutive positive integers in a row and divide them into adjacent, nonempty blocks. Can we choose a prime number \(p\) so that the product of the integers in each block leaves remainder \(1\) on division by \(p\)?
Erdős Problem #1056 asks whether this is possible for every number \(k\ge 2\) of blocks. We may choose a different prime and different boundaries for each \(k\). Knowing how to construct two or three blocks is not enough.
A small example
For two blocks, take \(p=11\) and consecutive intervals \(\{3,4\}\) and \(\{5,6,7\}\). Their products are
For three blocks, a historical example takes \(p=17\) and intervals \([2,5]\), \([6,11]\) and \([12,15]\), inclusive of integer endpoints. Their products are \(120\), \(332640\) and \(32760\), each congruent to \(1\) modulo \(17\). All five congruences were independently recomputed using exact integer arithmetic in the bounded test program. These finite examples do not establish the universal conjecture.
What is known
Guy's Unsolved Problems in Number Theory, problem A15, records Erdős's 1979 example for two blocks. Andrzej Mąkowski published the three-block example in Elemente der Mathematik 38 (1983), pp. 101–102. The primary bibliographic record identifies the paper; its full printed text still requires a page-by-page source check.
The frozen catalogue labels the general problem open. Later discussion has reported additional finite cases; a list of isolated instances cannot settle a statement quantified over all \(k\).
GCL's current state
Source audit #2327 verifies the specific congruences and inspects the frozen formal statement. Lean represents adjacent blocks by strictly increasing boundaries and half-open intervals. It provides finite executable examples, but its universal existence theorem still contains an unproved placeholder. Formal statement metadata and these finite computations are not GCL certification.
There is a subtlety: a singleton block containing only \(1\) automatically has product \(1\). Whether such a trivial block is admissible under the original historical convention affects the counting of particular finite witnesses.
What remains
The mathematical challenge is to find valid intervals for every \(k\), or disprove existence for some \(k\). The immediate source obligation is narrower: inspect Guy and Mąkowski in full, compare interval conventions with the Lean definition, and independently replay finite examples before claiming stronger source fidelity.
Sources and claim boundaries
- Erdős Problem #1056, statement and historical references.
- Mąkowski (1983), journal record, pp. 101–102.
- Frozen formal-conjectures statement, finite instances and unproved universal result.
- Authenticated GCL audit #2327, partial source audit, not mathematical proof certification or editorial admission.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2327 — 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.