erdos_conjecture_3_smooth
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Consecutive 3-smooth numbers: Conjecture that 8, 9 are the only consecutive perfect powers with prime factors among {2,3}. Proved for smooth numbers by Størmer's theorem. Extensions to consecutive near-smooth numbers are open.
Why this node was retired
The posted statement is
import Mathlib
theorem erdos_conjecture_3_smooth :
{n : ℕ | ∃ a b : ℕ, n = 2 ^ a * 3 ^ b ∧ n + 1 = 2 ^ (a + 1) ∨ n + 1 = 3 ^ (b + 1)}.Infinite := by
sorry
Disjunction precedence permits n+1=3^(b+1) without requiring n=2^a*3^b. The infinitude conclusion also conflicts with the source theme of classifying consecutive smooth numbers.
A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.
Proposed corrected statement
A concrete faithful smooth-number problem is to classify all n≥1 for which both n and n+1 are products of powers of2 and3. Require both smoothness conditions explicitly; do not retain the unsupported infinitude claim.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem erdos_conjecture_3_smooth :
{n : ℕ | ∃ a b : ℕ, n = 2 ^ a * 3 ^ b ∧ n + 1 = 2 ^ (a + 1) ∨ n + 1 = 3 ^ (b + 1)}.Infinite := by
sorry