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 statement2 of 3

There are examples where $(n, m) ∈ S$ with $m ≠ n + 1$ .

(Found by AlphaProof, although it was implicit already in [A129515])

FormalConjectures/ErdosProblems/730.leanErdos730.erdos_730.variants.delta_ne_one1 lineExact file

1∃ n m, (n, m) ∈ Erdos730.S ∧ m ≠ n + 1

SolvedStatement only, no proofformal statement reference