← problem archive problem 11 hard number theory This exercise constructs another proof of the infinitude of primes. Show that the integer $Q_{n}=n !+1$, where $n$ is a positive integer, has a prime divisor greater than $n$. Conclude that there are infinitely many primes.