The Erdős-Selfridge function g(k) is defined as the least integer bigger than k + 1 such that the least prime factor of (g(k) k) exceeds k, where (n k) is the binomial coefficient (Ecklund et al. 1974, Erdős et al. 1993). The best lower bound known is g(k)>=exp(csqrt((ln^3 k)/(ln ln k))) (Granville and Ramare 1996). Scheidler and Williams tabulated g(k) up to k = 140, and Lukes et al. (1997) tabulated g(k) for 135<=k<=200. The values for n = 1, 2, 3, ... are 3, 6, 7, 7, 23, 62, 143, 44, 159, 46, 47, 174, 2239, ... (OEIS A003458).
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.