An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress)

Brianna Sorenson, Jonathan P Sorenson, Jonathan Webster

Let $p(n)$ denote the smallest prime divisor of the integer $n$. Define the function $g(k)$ to be the smallest integer $>k+1$ such that $p((\genfrac{}{}{0ex}{}{g(k)}{k}))>k$. So we have $g(2)=6$…