Erdős problem 316
Is it true that if is a finite set with then there is a partition such that for ?
Sources
FormalConjectures/ErdosProblems/
316.lean
Retained formal statement
This is not true in general, as shown by Sándor [Sa97], who observed that the proper divisors of form a counterexample. More generally, Sándor shows that for any there exists a finite set with and no partition into parts each of which has .
∀ (n : ℕ), 2 ≤ n → ∃ A, A.Nonempty ∧ 0 ∉ A ∧ 1 ∉ A ∧ ∑ k ∈ A, 1 / ↑k < ↑n ∧ ∀ (P : Finpartition A), P.parts.card = n → ∃ p ∈ P.parts, 1 ≤ ∑ n ∈ p, 1 / ↑nSolvedStatement only, no proof