Skip to content

Erdős problem 684

For the least kk at which the small-prime part of (nk)\binom{n}{k} exceeds n2n^2, how large can f(n)f(n) be?

Nothing has been recorded here yet.

How far the record reaches2 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. FormalNone associated
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingFormal declaration

No formal declaration is associated with this question.

A formal statement is the first thing a check can run against.

Where the source files it579 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.