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?

Workspace

Continue locallyOpen sourceSign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#730
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Search problems.science

Find a Problem, Result, source, or page