Are there infinitely many pairs of integers n≠ m such that binom2nn and binom2mm have the same set of prime divisors?

Erdős Problem #730 — Are there infinitely many pairs of integers $n\neq m$ such that $\binom{2n}{n}$ and $\binom{2m}{m}$ have the same set of prime divisors?

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

References

Posted 1 month ago · edited 3 weeks ago

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

No solutions have been posted yet.