Recent content by mikeyflex

Ahh, now I get it, and that must be the reason why this proof doesn't work for prime numbers 2 and 3. Thank you for the observation. Number theory never seems light the bulb for me.

Thanks Matt, The problem stated that when p is a prime greater than 3, to evaluate p^2 mod 12. When you plug in prime values for p^2 mod 12 you get 1, which is an equivalence relation. Is there any significance to this problem as pertaining to a proof of sorts? Thanks again Matt

Hi Dick, The problem stated that p is a prime number that is greater than 3. When you work out p^2(mod 12) you get a remainder of 1 for every prime number square that is greater than 3. This is not the case with 2 or 3. I was wondering if there was some proof behind this.

Follow up Hi, I'm new to the forum and came across this thread, I'm aware that the topic is a few years old. I have an interesting question which seems to be an offspring of the topic at hand. If p is a prime number greater than 3, evaluate p^2(mod 12) I know this is closely tied to the...