Erdős problem 699 · problems.science

Erdős Problem 699. Is it true that for every $1 \le i < j \le n / 2$ there exists a prime $p \ge i$ with $p \mid \gcd\big(\binom{n}{i}, \binom{n}{j}\big)$ ?

Retained from Formal Conjectures · not edited here

Formal statements: 2 open · 1 solved
Erdős Problems says: falsifiable
Decision here: No current contribution
Checks: 0 checks · 3 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type: —
Evidence: 0 artifacts
Decision: None
Reviewed: No date retained

No result has been accepted here yet.

Search problems.science