Skip to content

Erdős problem 730

Are there infinitely many pairs of integers n<mn < m such that (2nn)\binom{2n}{n} and (2mm)\binom{2m}{m} have the same set of prime divisors?
Retained from Formal Conjectures · not edited here
Formal statements
1 open · 1 solved · 1 textbook
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 3 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page