- #1
cragar
- 2,552
- 3
Homework Statement
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.
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 won't divide it evenly.
this doesn't seems like it proves it, am I on the right track?