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
33k
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
 math  What is the lowest numberthat has a remainder of 1 when divided by 2 and ...
 IB HL Math  I need to that if there is better way to prove the following: I am ...
 Math  repost for Anonymous  Can someone show me the steps to these questions (...
 Math  How many integers between 200 and 500 inclusive leave a remainder 1 when ...
 Math  How many integers bewteen 200 and 500 inclusive leave a remainder 1 when ...
 math  what is the least common positive integer that meets the following ...
 math  what is the least common positive integer that meets the following ...
 math  Julie has a mystery number. When she divides the mystery number by 5, ...
 Math adv function  An unknown polynomial f(x) of degree 37 yields a remainder ...
 math  my daughter needs help finding a mystery number. 1)when the mystery ...
More Related Questions