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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:497118a3c5cb114fb00c33a14793462bdf0dc0170c5a4252bb23d3f2dd431fb9
Metadata: sha256:edc9765da622c9323497f7136108a8099feaf3d44a79c520cb1f9d1f76ebeeae
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:141143d4a990c091fd4c02cc5e6fad00768589dc70fe38f568d3cdaf52cf3f5b

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207