← All problems

Erdős Problem #730 — Common prime divisors of central binomial coefficients

51 years old · traced to

Are there infinitely many pairs of integers n≠mn\neq m such that (2nn)\binom{2n}{n} and (2mm)\binom{2m}{m} have the same set of prime divisors?

References

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.