Erdős problem 168
Sanity check: if S is a maximal non ternary subset of {1,..., N} then F N is given by the cardinality of S
Sources
FormalConjectures/ErdosProblems/
168.lean
Retained formal statement
Sanity check: if S is a maximal non ternary subset of {1,..., N} then F N is given by the cardinality of S
∀ (N : ℕ), ∀ S ⊆ Finset.Icc 1 N, Erdos168.NonTernary S → (∀ T ⊆ Finset.Icc 1 N, Erdos168.NonTernary T → S.card ≤ T.card → T.card = S.card) → Erdos168.F N = S.cardAPIStatement only, no proof