Prove that if is prime then cannot all be prime.
Follow Math Help Forum on Facebook and Google+
Anyone? I can certainly see why by just picking any prime, but can't prove it.
If p is prime you know p mod 3 = 1 or 2, if p mod 3 = 1 you have (p + 2) mod 3 = 0, so p+2 is divisible by 3 and if p mod 3 = 2 you have (p + 4) mod 3 = 0, so that p+4 is divisible by three.
View Tag Cloud