Erdős Problem #730 — Are there infinitely many pairs of integers n≠ m such that binom2nn and binom2mm have the same set of prime divisors?
Statement
Are there infinitely many pairs of integers such that and have the same set of prime divisors?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.