Find the largest positive integer n such that n + 3 2 divides n 2 + 3 2 2 .
Enter 666 if you come to the conclusion that no such n exists.
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.
Yes! (+1) As I said... too easy for you! ;)
same way exactly
same way !
same way...
Same way. Fine solution
n 2 + 3 2 2 = ( n + 3 2 ) 2 − 6 4 n
thus, 6 4 n should be divisible by n + 3 2
6 4 n = ( n + 3 2 ) k where k is a positive integer.
∴ n = 6 4 − k 3 2 k
Now n is max. when 6 4 − k is min. i.e. 1
∴ k = 6 3 , n = 3 2 ∗ 6 3 = 2 0 1 6 .
Divide n^2+32 by n+32, we'll get a remainder 2(32)^2, then we'll have the equation 2(32^2)/(n+32)=1 [we let the expression be equal to 1 so that we can get the maximum integer value of n].. We have then n=2016..
Hint: Use algebraic substitution and let u=n+32
Problem Loading...
Note Loading...
Set Loading...
n + 3 2 n 2 + 3 2 2 = n + 3 2 n 2 − 3 2 2 + n + 3 2 2 0 4 8 = n − 3 2 + n + 3 2 2 0 4 8 n + 3 2 ∣ 2 0 4 8 ( n + 3 2 ) max = 2 0 4 8 n max = 2 0 1 6