主题
Erdős-Selfridge 函数 
定义为大于 
的最小整数，使得 最小素因子 
超过 
，其中 
是 二项式系数 (Ecklund et al. 1974, Erdős et al. 1993)。已知的最佳下界是
 |
(Granville and Ramare 1996)。Scheidler 和 Williams (1992) 制表了 
直到 
，并且 Lukes et al. (1997) 制表了 
范围 
。 
, 2, 3, ... 的值是 3, 6, 7, 7, 23, 62, 143, 44, 159, 46, 47, 174, 2239, ... (OEIS A003458)。
." Math. Comput. 28, 647-649, 1974.Erdős, P.; Lacampagne, C. B.; and Selfridge, J. L. "Estimates of the Least Prime Factor of a Binomial Coefficient." Math. Comput. 61, 215-224, 1993.Granville, A. and Ramare, O. "Explicit Bounds on Exponential Sums and the Scarcity of Squarefree Binomial Coefficients." Mathematika 43, 73-107, 1996.Lukes, R. F.; Scheidler, R.; and Williams, H. C. "Further Tabulation of the Erdős-Selfridge Function." Math. Comput. 66, 1709-1717, 1997.Scheidler, R. and Williams, H. C. "A Method of Tabulating the Number-Theoretic Function 
." Math. Comput. 59, 251-257, 1992.Sloane, N. J. A. Sequence A003458/M2515 in "The On-Line Encyclopedia of Integer Sequences."Eric W. Weisstein "Erdős-Selfridge 函数。" 来自 —— 资源。 https://mathworld.net.cn/Erdos-SelfridgeFunction.html
