Prove that the square of any prime number p > 3 when divided by 12 gives modulo 1.
1
Expert's answer
2010-06-16T10:05:10-0400
Consider any possible modulo when dividing a prime number p > 3 by 6. It can not give modulo 2 or 4, because then it would be even. It may not give modulo 3, because then it would be divisible by 3. Thus, a prime number p > 3 when dividing by 6 gives modulo 1 or 5, ie it looks like 6n ± 1; and its square looks like 36n² ± 12n + 1.
Numbers and figures are an essential part of our world, necessary for almost everything we do every day. As important…
APPROVED BY CLIENTS
Finding a professional expert in "partial differential equations" in the advanced level is difficult.
You can find this expert in "Assignmentexpert.com" with confidence.
Exceptional experts! I appreciate your help. God bless you!
Comments
Leave a comment