← All problems

Erdős Problem #1094 — Least prime factors of binomial coefficients

38 years old · traced to

For an integer m>1m>1, let P−(m)P^{-}(m) denote its least prime divisor. Is the set of integer pairs (n,k)(n,k) satisfying k≥1k\geq 1 and n≥2kn\geq 2k for which

P− ⁣((nk))>max⁡ ⁣(nk,k)P^{-}\!\left(\binom{n}{k}\right)>\max\!\left(\frac{n}{k},k\right)

finite? Equivalently, does

P− ⁣((nk))≤max⁡ ⁣(nk,k)P^{-}\!\left(\binom{n}{k}\right)\leq\max\!\left(\frac{n}{k},k\right)

hold for all but finitely many such pairs? Bloom, Erdős Problem #1094

Background

Erdős, Lacampagne, and Selfridge presented this as a stronger form of an earlier problem and conjectured that the inequality holds for every n≥2kn\geq 2k, apart from fourteen listed binomial coefficients: (73),(134),(235),(144),(448),(4610),(4710),(4711),(626),(7410),(9410),(9510),(24116),(28428)\binom{7}{3},\binom{13}{4},\binom{23}{5},\binom{14}{4},\binom{44}{8},\binom{46}{10},\binom{47}{10},\binom{47}{11},\binom{62}{6},\binom{74}{10},\binom{94}{10},\binom{95}{10},\binom{241}{16},\binom{284}{28}. Bloom, Erdős Problem #1094 Erdős, Lacampagne, and Selfridge (1988)

An earlier conjecture attributed to Selfridge asserts the stronger bound P−((nk))≤n/kP^{-}(\binom{n}{k})\leq n/k when n≥k2−1n\geq k^{2}-1, with (626)\binom{62}{6} as the exception. Erdős also observed that this bound holds when nn is sufficiently large as a function of kk. These statements concern restricted ranges or a different bound; neither alone gives the finite-exception assertion posed here. Bloom, Erdős Problem #1094 Selfridge (1977)

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.