Homework Help: math

Posted by Meg on Monday, February 14, 2011 at 9:46pm.

Prove that if p is a prime number and p is not equal to 3, then 3 divides p^2 + 2. (Hint: When p is divided by 3, the remainder is either 0,1, or 2. That is, for some integer k, p = 3k or p = 3k + 1 or p = 3k + 2.)

I thought you might do three cases with the three values of p in the hint, plugging them into p^2+2. In two of the cases you get a p^2+2=3a (a some integer) form but for p=3k you do not. Am I approaching this wrong?

math - MathMate, Monday, February 14, 2011 at 10:13pm
The third case is the simplest, because
3|3k
so you're done!
math - MathMate, Monday, February 14, 2011 at 10:14pm
On the other hand, since it is a prime ≠ 3, so in fact, the third case does not even arise.
math - SHAKEERA, Tuesday, February 22, 2011 at 8:11pm
NO

Answer this Question

Related Questions

IB HL Math - I need to that if there is better way to prove the following: I am ...
maths --plse help me.. - Let a,b,c be positive integers such that a divides b^2...
urgent -plsee - Let a,b,c be positive integers such that a divides b^2 , b ...
maths --plse help me.. - Let a,b,c be positive integers such that a divides b^2...
Discrete Math - Prove that if a and b are integers with a not equal to zero and ...
maths - Let a,b,c be positive integers such that a divides b^2 , b divides c^2 ...
maths - Let a,b,c be positive integers such that a divides b^2 , b divides c^2 ...
math - the sum of the digits of a two digit prime number is substracted from the...
Advanced Math - Def: An interger "m" divides an integer "n" ...
Math - Prove that if p is prime and 1 <= k < p that p divides p!/(...

For Further Reading

First Name:
School Subject:
Answer: