More fun in 2016, Part 13

Find the largest positive integer n n such that n + 32 n+32 divides n 2 + 3 2 2 n^2+32^2 .


Enter 666 if you come to the conclusion that no such n n exists.


The answer is 2016.

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.

4 solutions

Aareyan Manzoor
Jan 2, 2016

n 2 + 3 2 2 n + 32 = n 2 3 2 2 n + 32 + 2048 n + 32 = n 32 + 2048 n + 32 \dfrac{n^2+32^2}{n+32}=\dfrac{n^2-32^2}{n+32}+\dfrac{2048}{n+32}=n-32+\dfrac{2048}{n+32} n + 32 2048 n+32|2048 ( n + 32 ) max = 2048 (n+32)_{\text{max}}=2048 n max = 2016 n_{\text{max}}=\boxed{2016}

Yes! (+1) As I said... too easy for you! ;)

Otto Bretscher - 5 years, 5 months ago

same way exactly

Kaustubh Miglani - 5 years, 5 months ago

Log in to reply

I also did the exact same way

Aditya Kumar - 5 years, 1 month ago

same way !

avn bha - 5 years, 5 months ago

same way...

A Former Brilliant Member - 5 years, 5 months ago

Same way. Fine solution

Shreyash Rai - 5 years, 4 months ago
Samarth Agarwal
Jan 13, 2016

n 2 + 3 2 2 = ( n + 32 ) 2 64 n n^2+32^2=(n+32)^2-64n

thus, 64 n 64n should be divisible by n + 32 n+32

64 n = ( n + 32 ) k 64n=(n+32)k where k is a positive integer.

n = 32 k 64 k \therefore n= \frac{32k}{64-k}

Now n is max. when 64 k 64-k is min. i.e. 1

k = 63 , n = 32 63 = 2016 \therefore k=63, n=32*63=2016 .

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..

Jun Arro Estrella
Jan 20, 2016

Hint: Use algebraic substitution and let u=n+32

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...