Find the largest positive integer n such that 2 2 0 1 6 + 2 6 0 1 2 + 2 n is a perfect square number.
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.
I assumed that since n was the largest positive integer, it would be greater than 2016.
2 2 0 1 6 + 2 6 0 1 2 + 2 n can be written as 2 2 0 1 6 . ( 2 n − 2 0 1 6 + 2 3 9 9 6 + 1 )
Now 2 2 0 1 6 is already a square number, so for the second bracket we can use the following expansion:
( 2 m + 1 ) 2 = 2 2 m + 2 m + 1
Therefore:
2 m = n − 2 0 1 6
m + 1 = 3 9 9 6
Since doing the other substitution, i.e:
2 m = 3 9 9 6
m + 1 = n − 2 0 1 6
yields a smaller n, i.e: n= 4015.
Therefore,On solving n comes out as 10006
Nice assumption and method. Your solution is better than other's observatory solutions.
Log in to reply
'More good' is grammatically incorrect
Log in to reply
Sorry, i have changed "more good" to "better" which is correct grammatically. Thanks for identifying mistakes.
It's possible to prove that your answer is the largest. What are your thoughts? Give it a try.
We can rewrite the equation as the following:
( 2 1 0 0 8 + 2 3 0 0 6 ) 2 = 2 2 0 1 6 + 2 3 0 0 6 + 2 n in which case n = 4 0 1 5
Or another possibility is:
( 2 1 0 0 8 + 2 2 n ) 2 = 2 2 0 1 6 + 2 6 0 1 2 + 2 n . In this case, n = 1 0 0 0 6
Clearly the second case yields a way larger value of n
I get it that n = 1 0 0 0 6 satisfy the expression to be a perfect square. What I dont get is proving that 1 0 0 0 6 is the largest solution.
Compare the given expression to ( 2 m ) 2 + ( 2 p ) 2 + 2 ( 2 m ) ( 2 p ) = ( 2 m + 2 p ) 2 , where 2 p = n . Two cases arise, one when ( 2 6 0 1 2 ) is the 2 ( 2 m ) ( 2 n ) term and second when its a squared term.
You shall notice that the former case gives a larger value for n.
I think you didn't make clear why in the first case we get the largest possible n .
Problem Loading...
Note Loading...
Set Loading...