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.
Note first that ( n 2 + n + 4 1 ) ≡ ( n 2 + n + 5 ) ( m o d 1 2 ) .
Next, for any integer n , we have that n = 1 2 m + r for some integer m and where 0 ≤ r ≤ 1 1 . As such, we see that
( n 2 + n + 5 ) ≡ ( r 2 + r + 5 ) ( m o d 1 2 ) .
So it suffices to just look at the remainders for n such that 0 ≤ n ≤ 1 1 . (Don't worry, we'll get to the squared part later.) Doing this, we find that all remainders are one of 1 , 5 , 7 or 1 1 .
But for each of these values, its square is 1 ( m o d 1 2 ) . Thus for any integer n , the remainder when ( n 2 + n + 4 1 ) 2 is divided by 1 2 will be 1 .