Skip to content

Erdős problem 849

Is it true that, for every integer t≥1t\geq1, there is some integer aa such that (nk)=a{n \choose k} = a with 1≤k≤n21\leq k \le \frac{n}{2} has exactly tt solutions?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/849.lean

Formal Conjectures

FormalConjectures/ErdosProblems/849.leanErdos849.erdos_8491 lineExact file
True ↔ ∀ t ≥ 1, ∃ a, {n | ∃ k ≥ 1, 2 * k ≤ n ∧ n.choose k = a}.ncard = t
OpenStatement only, no proof

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page