lean_workbook_plus_17527

Proved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

For $n\ge 3$ , $17^{n-1}\cdot 2^{n^2}-1 > 9n^2\cdot 2^{n^2}-1$

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_17527 (n : ℕ) (hn : 3 ≤ n) : (17:ℝ)^(n-1) * 2^(n^2) - 1 > 9 * n^2 * 2^(n^2) - 1   :=  by sorry

Source