Answers are grounded in this paper and cite their sources.
Formal mathematical analysis demonstrates modular exclusions and machine-checked bounds for the Erdős-Moser Diophantine equation, highlighting constraints on non-trivial solutions.
On the Erdős-Moser Diophantine Equation: A Detailed Treatise on Power Sum Dynamics, Moser's Prime Sieve, Small Modulus Exclusions, and Certified Proofs This preprint provides an exhaustive mathematical treatise on the Erdős-Moser conjecture (Problem #11 in Paul Erdős' collection), which asserts that the only positive integer solution (m, k) ∈ N≥ 2 × N≥ 1 to the power sum Diophantine equation: ∑ᵢ₌₁ᵐ⁻¹ iᵏ = 1ᵏ + 2ᵏ + 3ᵏ + + (m-1)ᵏ = mᵏ is the trivial linear identity 1¹ + 2¹ = 3¹ (corresponding to $m = 3, k = 1$). Key Mathematical Results & Contributions Continuous Asymptotics & Critical Diagonal: Analytical comparison of the discrete sum Sₖ(m) = ∑ᵢ₌₁ᵐ⁻¹ iᵏ with the continuous integral ∫₀ᵐ xᵏ dx = mᵏ⁺¹k+1, proving that any hypothetical non-trivial solution must satisfy the critical diagonal balance m ≈ k + 1. Formal Inductive Exclusion for $m = 4$: Complete, non-elliptical mathematical induction proving that 1 + 2ᵏ + 3ᵏ < 4ᵏ for all k ≥ 2, establishing the unconditional non-existence of integer solutions for $m = 4$ (∀ k ≥ 1). Formal Inductive Exclusion for $m = 5$: Complete step-by-step induction proving that 1 + 2ᵏ + 3ᵏ + 4ᵏ < 5ᵏ for all k ≥ 3, establishing the unconditional non-existence of integer solutions for $m = 5$ (∀ k ≥ 1). Leo Moser's Modular Sieve: Detailed arithmetic exposition of Moser's modular reductions modulo $m - 1$ and m, proving by pairing symmetries that the exponent k must necessarily be an even integer ($k = 2h$). 100% Machine-Checked Verification in Lean 4: All inductive bounds and exclusion theorems are formally verified with 0 axioms, 0 linter warnings, and 0 sorry placeholders via the Lean 4 interactive theorem prover and Mathlib. Repository and Verification Artifacts The companion machine-checked code and formal verification artifacts are publicly hosted on GitHub: https://github. com/flouzzy/erdos-problems Primary MSC (2020): 11D41, 11B68, 68V20, 11A07, 11B83.
No takes yet. Share an insight, caveat, or question.
Charles EDOU NZE (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: