lean_workbook_plus_62665
ProvedProve that for and any positive integer .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_62665 (n : ℕ) (k : ℕ) (hn : 2 ≤ n) : n - 1 ∣ n^k - 1 := by sorry
Source
Prove that for and any positive integer .
import Mathlib.Analysis.Complex.Basic
theorem lean_workbook_plus_62665 (n : ℕ) (k : ℕ) (hn : 2 ≤ n) : n - 1 ∣ n^k - 1 := by sorry