1. The problem statement, all variables and given/known data Except 2 and 3 , prove that their an infinite amount of primes of the form 6m+1 and 6m+5 for some integer m It says to use Euclid's method but replace the +1 with a -1. 3. The attempt at a solution Would I just multiply some of these forms together and subtract 1 [itex] (6m+1)....(6n+1)-1=x [/itex] If I divide my new number x by (6m+1) it wont divide it evenly. this doesn't seems like it proves it, am I on the right track?