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?

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal3 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it575 share a topic
Number Theory576Binomial Coefficients22Base Representations5
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources