Erdős problem 319
What is the size of the largest such that there is a function such that and for all non-empty .
Sources
FormalConjectures/ErdosProblems/
319.lean
Retained formal statement
Let c(N) be the size of the largest such that there is a function : \{-1, 1\} such that and for all non-empty . Find the simplest g(N) such that c(N) = O(g(N)).
∀ (N : ℕ) (c : ℕ → ℝ), (∀ (N : ℕ), IsGreatest {x | ∃ A, ∃ (_ : A ⊆ Finset.Icc 1 N) (_ : ∃ δ, ∑ n ∈ A, ↑↑(δ n) / ↑n = 0 ∧ ∀ A' ⊂ A, A'.Nonempty → ∑ n ∈ A', ↑↑(δ n) / ↑n ≠ 0), ↑A.card = x} (c N)) → c =O[Filter.atTop] sorryOpenStatement only, no proof