Erdős Problem 730

References:

• erdosproblems.com/730
• A129515

@[reducible, inline]

abbrev Erdos730.S : Set (ℕ × ℕ)

Equations

• Erdos730.S = {(n, m) : ℕ × ℕ | n < m ∧ n.centralBinom.primeFactors = m.centralBinom.primeFactors}

theorem Erdos730.erdos_730 : sorry ↔ S.Infinite

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?

theorem Erdos730.erdos_730.variants.explicit_pairs : {(87, 88), (607, 608)} ⊆ S

For example, $(87,88)$ and $(607,608)$ are such pairs.

theorem Erdos730.erdos_730.variants.delta_ne_one : ∃ (n : ℕ) (m : ℕ), (n, m) ∈ S ∧ m ≠ n + 1

There are examples where $(n, m) ∈ S$ with $m ≠ n + 1$.

(Found by AlphaProof, although it was implicit already in [A129515])