Skip to content

Erdős problem 730

Start work

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?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:497118a3c5cb114fb00c33a14793462bdf0dc0170c5a4252bb23d3f2dd431fb9
Metadata
sha256:edc9765da622c9323497f7136108a8099feaf3d44a79c520cb1f9d1f76ebeeae
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:141143d4a990c091fd4c02cc5e6fad00768589dc70fe38f568d3cdaf52cf3f5b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON