Erdős problem 730

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?

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

730.lean

Retained formal statement1 of 3

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?

FormalConjectures/ErdosProblems/730.leanErdos730.erdos_7301 lineExact file

1True ↔ Erdos730.S.Infinite

OpenStatement only, no proofformal statement reference

Source providers

Erdős Problems1
locator only
Formal Conjectures3
statement retained
VibeMathed0
not observed here
PLBY Lean proofs0
not observed here
Jayyhk Erdős Lean0
not observed here
William Blair Lean proofs64
no statement retained
Erdős AI contributions wiki1
no statement retained
GPT-Erdős0
not observed here

Referenced paths

FormalConjectures/
- ErdosProblems/
  - 730.lean3