Erdős problem 849

Is it true that, for every integer $t\geq1$ , there is some integer $a$ such that ${n \choose k} = a$ with $1\leq k \le \frac{n}{2}$ has exactly $t$ solutions?

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

849.lean

Retained formal statement1 of 1

Is it true that, for every integer $t\geq1$ , there is some integer $a$ such that ${n \choose k} = a$ with $1\leq k \le \frac{n}{2}$ has exactly $t$ solutions?

FormalConjectures/ErdosProblems/849.leanErdos849.erdos_8491 lineExact file

1True ↔ ∀ t ≥ 1, ∃ a, {n | ∃ k ≥ 1, 2 * k ≤ n ∧ n.choose k = a}.ncard = t

OpenStatement only, no proof