lean_workbook_plus_77624
ProvedLet be a positive integer, and let such that . Show that some power of is either an element of or the sum of two distinct elements of .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_77624 (n : ℕ) (hn : 1 ≤ n) (S : Finset ℕ) (hS : (n : ℕ) / 2 + 1 ≤ S.card) : ∃ k : ℕ, (2 ^ k ∈ S) ∨ (∃ x y : ℕ, x ≠ y ∧ 2 ^ k = x + y) := by sorry
Source