Skip to content

Erdős problem 1094

Start work

For all n≥2kn\ge 2k the least prime factor of (nk)\binom{n}{k} is ≤max⁡(n/k,k)\le\max(n/k,k), with only finitely many exceptions.

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:f4c7f10ed4a2062fcc180d1046a85c285953800626614caa66c3aacf904069ad
Metadata
sha256:96e95422d8b85dc0896e53fa8edde06cbff50e7805c87f224edf7147d9dc6328
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:3772ce29309c2e340f40b4ad7b33c658cf2e338d7fa02cc2f563cc1b1f55b0ee
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON