Erdős problem 1063 · problems.science

Estimate $n_k$ by finding a better upper bound.

Sources

Browse retained paths and inspect the exact material available for this Problem.

6 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

1063.lean

Retained formal statement3 of 6

Erdős and Selfridge noted that, for $n \ge 2k$ with $k \ge 2$ , at least one of the numbers $n - i$ for $0 \le i < k$ fails to divide $\binom{n}{k}$ ([ErSe83]).

FormalConjectures/ErdosProblems/1063.leanErdos1063.erdos_1063.variants.exists_exception1 lineExact file

1∀ {n k : ℕ}, 2 ≤ k → 2 * k ≤ n → ∃ i < k, ¬n - i ∣ n.choose k

SolvedStatement only, no proof

Sources

Search problems.science