Determine the sum of all positive integer n such that n 2 + 2 divides 2 + 2 0 0 1 n .
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.
You are awesome, dude!
In your first statement, if ( n 2 + 2 ) divides ( 2 + 2 0 0 1 n ) , why does ( n 2 + 2 ) divide [ ( 2 + 2 0 0 1 n ) 2 ) ] ?
Log in to reply
Suppose 2 + 2 0 0 1 n = k ( n 2 + 2 ) where k is an integer. Hence ( 2 + 2 0 0 1 n ) 2 = k 1 ( n 2 + 2 ) where k 1 = k 2 ( n 2 + 2 ) is an integer (since n and k are integers).
Log in to reply
Whoops, obvious enough, thanks for the clarification though!
Great approach!
Sir in step which you wrote (n^2+2)|{8004n-8007998-4(2+2001)} where did that {-4(2+2001)} term come?
Log in to reply
Since n 2 + 2 ∣ ( 8 0 0 4 n − 8 0 0 7 9 9 8 ) , let 8 0 0 4 n − 8 0 0 7 9 9 8 = k 1 ( n 2 + 2 ) and n 2 + 2 ∣ 2 + 2 0 0 1 n , let 2 + 2 0 0 1 n = k 2 ( n 2 + 2 ) . Now, 8 0 0 4 n − 8 0 0 7 9 9 8 − 4 ( 2 + 2 0 0 1 n ) = ( k 1 − 4 k 2 ) ( n 2 + 2 ) , hence n 2 + 2 ∣ ( 8 0 0 4 n − 8 0 0 7 9 9 8 − 4 ( 2 + 2 0 0 1 n ) ) . This can be extended to show that for integers a , b and c such that c ∣ b and c ∣ a , c ∣ ( x a + y b ) for x , y ∈ Z . Also, the term was introduced to get rid of the term containing n .
I didnt get the 8007998
Problem Loading...
Note Loading...
Set Loading...
If ( n 2 + 2 ) ∣ ( 2 + 2 0 0 1 n ) then ( n 2 + 2 ) ∣ [ ( 2 + 2 0 0 1 n ) 2 ] or ( n 2 + 2 ) ∣ ( 4 + 8 0 0 4 n + 4 0 0 4 0 0 1 n 2 ) . n 2 + 2 4 0 0 4 0 0 1 n 2 + 8 0 0 4 n + 4 = 4 0 0 4 0 0 1 + n 2 + 2 8 0 0 4 n − 8 0 0 7 9 9 8 This means that ( n 2 + 2 ) ∣ ( 8 0 0 4 n − 8 0 0 7 9 9 8 ) . We also note that ( n 2 + 2 ) ∣ [ 8 0 0 4 n − 8 0 0 7 9 9 8 − 4 ( 2 + 2 0 0 1 n ) ] from which it follows that ( n 2 + 2 ) ∣ 8 0 0 8 0 0 6 . It is easy to check all the factors of 8008006 and that the solution set for n is {6,9,2001}.