Erdős problem 730 · problems.science

Are there infinitely many pairs of integers $n < m$ such that $\binom{2n}{n}$ and $\binom{2m}{m}$ have the same set of prime divisors?

Sources

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

3 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

730.lean

Retained formal statement1 of 3

Are there infinitely many pairs of integers $n < m$ such that $\binom{2n}{n}$ and $\binom{2m}{m}$ have the same set of prime divisors?

FormalConjectures/ErdosProblems/730.leanErdos730.erdos_7301 lineExact file

1True ↔ Erdos730.S.Infinite

OpenStatement only, no proofformal statement reference