My proof so far:Prove that if are the primes up to , and if each does not divide n, then n is prime.

where .

From here it's easy to see that my working can be rearranged to get showing that n is divisible by .

This is annoying since I want to show that n is prime!