Skip to content

Erdős problem 684

Start work

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?

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:5373310914a65608d8b8822fcadb490c9e5b488fb0362aa154824d0b8a3c0676
Metadata
sha256:f9a6900ebc29c2007aaba1ba345aea79a29b9ccb8181b5bf046709608fec9b71
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:e6fd37a103d67d250a4ec95af43e54ea1270b970ef53651cf5d2408efdc4bc8b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON