A number theory problem by Dipto Biswas
Number Theory
Level
2
If is a prime number greater than 2, then find the remainder when is divided by 2.
1
0
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
First, you have to understand that you must ignore all evens,even if p is one, since even^b = even, no matter what as long as b is an integer. As we know, all primes are intergers. Also, if c is an odd interger, odd^c = odd. You must also understand that no matter what odd you choose, it will always get cancelled out by 1 since odd + odd(including 1) = even. I am also lazy,but I will show an example, so I used 3. 2mod(side note, I forgot how to use mods, all I know is they give remainders)(1^3 + 3^3) = 0.