lean_workbook_plus_18891
ProvedLet . Prove that every positive odd integer and has a power of strictly smaller than .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_18891 (n k : ℕ) (h₁ : 3^k ≤ 2 * n + 1) (h₂ : 2 * n + 1 < 3^(k + 1)) (m : ℕ) (h₃ : 3 ≤ m) (h₄ : m ≤ 2 * n + 1) (h₅ : m ≠ 3^k) : ∃ x : ℕ, 3^x < m := by sorry
Source