Elementary Methods in Number Theory Exercise 1.4.8
Let $n\geq 2$,prove that $(n+1)!+k$ is composite for $k=2,\cdots,n+1$.This shows that there exists arbitrarily long intervals of composite numbers.
Proof:Simple.
Let $n\geq 2$,prove that $(n+1)!+k$ is composite for $k=2,\cdots,n+1$.This shows that there exists arbitrarily long intervals of composite numbers.
Proof:Simple.
