SOLUTION: Is it possible for the remainder to be 2 when a prime number that is greater than 2 is divided by 4? Explain why or why not.

Question 174618: Is it possible for the remainder to be 2 when a prime number that is greater than 2 is divided by 4? Explain why or why not.
Answer by stanbon(75887) (Show Source): You can put this solution on YOUR website!
Is it possible for the remainder to be 2 when a prime number that is greater than 2 is divided by 4? Explain why or why not.
--------------------------------------------------------------
Let x be a prime number greater than 2.
-----
Assume x/4 = k + 2/4, then
x = 4k + 2 which is divisible by 2 and x would not be prime.
-----------
Therefore the assumption is wrong.
Cheers,
Stan H.
RELATED QUESTIONS
Is it possible for the remainder to be 2 when a prime number that is greater than 2 is... (answered by stanbon,Earlsdon)

if n is an integer greater then 1, such that n divided by 4 yields a remainder of 0,... (answered by tommyt3rd)

What is the smallest possible integer that's greater than 100, and leaves a remainder of... (answered by CubeyThePenguin)

Jim and his study group want to know if 601 is a prime or composite number. He explained... (answered by Alan3354)

if x is a prime number greater than 5,then what is the remainder when X is divided by... (answered by richard1234)

(a) Let p be a prime number greater than 3. What are the possible remainders of p upon... (answered by jim_thompson5910)

Hello, Is it possible for a composite number to have more than one prime factorization?... (answered by richwmiller,rothauserc)

When a whole number N is divided by 2, the remainder is 0. When N is divided by 3, the... (answered by jim_thompson5910,Edwin McCravy)

What is that number , when that number is divided by 9 the remainder is 8 , when that... (answered by AnlytcPhil)