lean_workbook_plus_37224
ProvedGiven a real number , prove that, for all large enough positive integers , there exists a suitable set of size at least , each element of which is at most .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_37224 (N : ℕ) (ε : ℝ) (hε : 0 < ε ∧ ε < 1) :
∃ A : Finset ℕ, (A.card ≥ ε * N ∧ ∀ x ∈ A, x ≤ N) := by sorrySource