Erdős Problem #1214
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 #1214 currently has source status PROVED — CORRALES-RODRIGÁÑEZ–SCHOOF.
For integers \(x,y\ge1\), suppose for every integer \(n\ge1\) the set of distinct prime divisors of \(x^n-1\) equals that of \(y^n-1\). Must \(x=y\)? This compares prime supports, not full prime-power valuations or numerical equality. The displayed domain \(x,y\ge1\) presents a convention issue at \(x=1\), since \(1^n-1=0\) and the set of prime divisors of 0 is not ordinarily defined. Source-normalize to \(x,y>1\) unless an explicit support-of-zero convention is provided.
A small example
Compare \((x,y)=(2,3)\) for \(n=1,\dots,6\). At \(n=1\), \(2^1-1=1\) has no prime divisors while \(3^1-1=2\) has prime support \(\{2\}\), immediately distinguishing the bases. Phase25 also lists the distinct-prime supports of all six exponents for both. This rejects one particular unequal pair but does not reproduce the general Corrales-Rodrigáñez–Schoof theorem.
What is known
The maintained https://www.erdosproblems.com/1214 reports this Erdős Banff 1988 question PROVED YES by Corrales-Rodrigáñez–Schoof [CoSc97], originally on prime divisors of \(x^n-1\). The theorem is substantially stronger than a few small-exponent distinctions. A condition valid for all \(n\ge1\) may force the bases equal even though distinct bases can share prime divisors for many individual exponents. The precise statement and handling of \(x=1\) need primary proof verification, and formalization is not independently kernel-run.
GCL's current state
Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.
What remains
Source-read CoSc97 including any extension to algebraic tori, verify the exact integers-positive hypotheses and the zero case, then independently reconstruct key support-comparison implications. Do not claim a proof based solely on checking finitely many exponents.
Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.
Sources and claim boundaries
https://www.erdosproblems.com/1214 ; [CoSc97], Erdős 1988 Banff conference.
Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2485 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.