Reaminder Problem 3

Find the remainder when ( n 2 + n + 41 ) 2 (n^2 + n+ 41)^2 is divided by 12 12 .


The answer is 1.

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.

2 solutions

Note first that ( n 2 + n + 41 ) ( n 2 + n + 5 ) ( m o d 12 ) (n^{2} + n + 41) \equiv (n^{2} + n + 5) \pmod{12} .

Next, for any integer n n , we have that n = 12 m + r n = 12m + r for some integer m and where 0 r 11 0 \le r \le 11 . As such, we see that

( n 2 + n + 5 ) ( r 2 + r + 5 ) ( m o d 12 ) (n^{2} + n + 5) \equiv (r^{2} + r + 5) \pmod{12} .

So it suffices to just look at the remainders for n n such that 0 n 11 0 \le n \le 11 . (Don't worry, we'll get to the squared part later.) Doing this, we find that all remainders are one of 1 , 5 , 7 1, 5, 7 or 11 11 .

But for each of these values, its square is 1 ( m o d 12 ) 1\pmod{12} . Thus for any integer n n , the remainder when ( n 2 + n + 41 ) 2 (n^{2} + n + 41)^{2} is divided by 12 12 will be 1 \boxed{1} .

No formal solution in my mind as n is variable, the best way is put 1 in place of n and trust the problem.

That's false! You should be able to show that ( n 2 + n + 41 ) 2 (n^2+n+41)^2 always leaves a remainder of 1 1 when divided by 12. 12.

Michael Tang - 6 years, 11 months ago

Log in to reply

its not so

Harshi Singh - 6 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...