by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)
For all prime p=2 , there exists some n∈N for which p∣2n−1 . This is true. Since gcd(2,p)=1 , we have that 2φ(p)=1(modp) . Then let n=p−1 so 2p−1=1(modp) , thus p∣2p−1−1 .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_2164 (p : ℕ) (hp : p.Prime) (hp2 : p ≠ 2) : ∃ n : ℕ, p ∣ 2 ^ n - 1 := by sorry