I am currently stuck on a practice problem.
it goes....
Show that if n is an odd integer then...
n^2=1 or 9(mod16)
n^4=1(mod 16)
Show that if n is any integer that is not divisible by 2 or 3, then n^2=1(mod12)
This stuff is so confusing to me :S
Thanks so much for the reply!
I don't understand two point of the solution...
n(n-1)....why is this even? is it just by rule?
secondly
I can not readily see how this is true overtly true
8m + 1 = 1 or 9 { mod }16.
EDIT: oh lol I can see why that is true now