Erdős Problem #48
Editorial depth: Reviewed explanatory article — evidence qualified.
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.
The question in plain language
Euler's totient function \(\phi(n)\) counts the positive integers up to \(n\) which are coprime to \(n\). The sum-of-divisors function \(\sigma(m)\) adds all positive divisors of \(m\). Erdős Problem #48 asks whether there are infinitely many pairs of positive integers with
The answer is yes, proved by Kevin Ford, Florian Luca and Carl Pomerance in 2010.
A small example
There is an exact small equality,
Thus \((n,m)=(5,3)\) works. Checking a handful of examples shows that the two arithmetic functions can agree, but does not prove infinitely many distinct solutions.
What is known
Ford, Luca and Pomerance, Common values of the arithmetic functions \(\phi\) and \(\sigma\), Bulletin of the London Mathematical Society 42 (2010), 478–488, proved infinitely many solutions. Their paper also establishes much stronger multiplicity phenomena for common values. Subsequent work by Garaev sharpened quantitative counts reported in the maintained problem registry.
These results rely on deeper information about primes, not just the multiplicative formulas for the two arithmetic functions.
GCL's current state
Source audit #1317 checked the published primary abstract, the finite witness, and the exact pinned Formal Conjectures claim. The frozen research theorem states infinitude of the set of pairs with equal totient and divisor sum, but its own proof body is unfilled. The 2010 analytic proof has not been GCL-replayed or formally certified.
What remains
The mathematical infinitude question is settled. Formalization work may implement exact finite witnesses and import or reconstruct the published analytic proof with source and axiom controls. It would not be a new solution.
Sources and claim boundaries
- Erdős Problems #48: solved status and historical bibliography.
- Ford–Luca–Pomerance (2010), primary publisher article.
- GCL source return #1317: exact finite arithmetic and statement comparison, not a new proof.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1317 — 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.