Answers are grounded in this paper and cite their sources.
Formal mathematical study demonstrates the existence of infinite consecutive powerful pairs and the impossibility of quadruplets, indicating fundamental constraints in additive number theory.
This preprint provides an exhaustive mathematical treatise on Erdős Problem #27 regarding the additive distribution of powerful numbers. A positive integer n ∈ N≥ 1 is defined to be powerful (or $2$-full / square-full) if every prime divisor divides it to at least the second power: p n p² n Paul Erdős conjectured the existence of infinitely many pairs of consecutive powerful numbers $(n, n+1)$ and investigated the existence and bounds of longer consecutive sequences. Key Mathematical Results & Contributions Canonical Factorization Theorem: Complete, rigorous proof of the existence and uniqueness of the canonical representation n = a² b³ where b is squarefree (μ²(b) = 1), derived step-by-step via the Euclidean division of p-adic exponents (eᵢ = 2qᵢ + rᵢ). Minimal Consecutive Pair: Exact algebraic verification of the minimal pair (8, 9) = (2³, 3²). Pellian Diophantine Reduction in Z[√2]: Demonstration that every solution to the Pell equation x² - 8y² = 1 generated by the fundamental unit ε₀ = 3 + 2√2 ∈ OQ(√2)^× yields an infinite sequence of distinct consecutive powerful pairs (8yₖ², xₖ²), with explicit computations and prime factorizations for the first six terms. Modulo 4 Obstruction Principle: Arithmetic proof that any integer m ≡ 2 4 has a $2$-adic valuation of exactly v₂(m) = 1, rendering it unconditionally non-powerful. Four Consecutive Impossibility Theorem: Exhaustive partition proof over the four residue classes modulo $4$, establishing that among any four consecutive integers $(n, n+1, n+2, n+3)$, exactly one is congruent to 2 4. This rigorously proves that no four consecutive powerful numbers can ever exist in N. Three Consecutive Modulo 4 Constraint & $abc$ Conjecture: Proof that any hypothetical triplet $(n, n+1, n+2)$ must strictly satisfy n ≡ 3 4, accompanied by Granville's heuristic proving the finiteness of consecutive triplets under the $abc$ conjecture. 100% Machine-Checked Verification in Lean 4 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): 11A51, 11D09, 11B83, 11D45, 68V20.
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: