today I've encountered the following excercise:
Show that all the primes greater than $3$ are in form of $6n\pm1$...
My initial thought was that numbers are in form of $6n,\quad 6n\pm1,\quad 6n\pm2, \quad 6n\pm3$ in respect to $6$ and $6n\pm2=2(3n\pm1),\quad 6n\pm3=3(2n\pm1)$ so since they are multiples of $2$ and $3$ they can't represent primes. This however didn't completely satisfy me, because I've shown that other forms in respect to $6$ aren't primes, but that doesn't necessarily mean that $6n\pm1$ must be prime. I thought perhaps I can do induction but I don't know what inital property to use for a start, or perhaps I am overseeing it right now.
Thanks in advance!
that doesn't necessarily mean that 6n±1 must be prime
Of course it doesn't, but that's not what the question asked. – dxiv Feb 19 '18 at 19:29