Needs a steward / erdos-849
Steward erdos-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?
Its steward: WilliamVerreault self-admitted. A problem may have several, who hold the role jointly.
This problem has a steward, so a new steward joins by invitation: a member of its panel invites you by your GitHub login and you accept in the problem’s Panel section, or a curator adds you directly (D-32). Co-stewards are welcome: to ask, write to a steward or open an issue. The panel’s rules →
What the role asks
- Understand what the network proves on this problem.
- Write it up, and sign the explainer of the proof that closes it.
- Best efforts, no deadline: step down at any time.