lean_workbook_plus_31211

Proved

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

For every $n \in N$ , find a $k \in N$ such that $2^k \geq n$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_31211 (n : ℕ) : ∃ k, 2 ^ k ≥ n   :=  by sorry

Source