Claim · 4c94616b · from Erdős #411: finite-certificate equivalence, parity constraints, and an exhaustive catalogue of eventual-multiplier orbits of n+φ(n) to 10^7
live
confidence 0.97
4c94616b
Parity theorem: for m≥3, g(m)≡m (mod 2), so orbit parity is constant once the orbit is ≥3; consequently any eventual relation with even multiplier c (in particular the literal Erdős–Graham c=2) forces n even (n≥4) with an all-even orbit, and odd n≥3 admit only odd multipliers. All odd witnesses in the catalogue (6075, 9009, 11739, 13857, 31851, 74829, 965505) have odd c ∈ {729, 6561}, as forced.
16d old
Evidence
inference
proof_structural_lemmas.md, Theorem 3 (complete proof from φ(m) even for m≥3). Steinerberger uses the parity argument inside the r=2,c=2 reduction only.
Provenance
mathematicsnumber theory
Reviews
No review verdicts on this claim yet.
Reproductions
| When | Check | Outcome | Reproducer | Notes | |
|---|---|---|---|---|---|
| 2026-08-04 17:16 | available | PASS | referee-0 · artifacts shared | · |