Find the integer n such that 2 2 0 0 − 3 1 ⋅ 2 1 9 2 + 2 n is a perfect square.
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.
Thanks for help. :)
Log in to reply
Note that in the problem, you needed for n to be an integer, otherwise we could have numerous real valued solutions.
@Akshat Sharda ,I think the question asks for 2 1 0 0 ( 2 2 0 0 in your solution) ,or if I am missing something:)
Log in to reply
Yes !! The question is wrong but answer is correct according to 2 2 0 0 .
I'm editing the question !!
Problem Loading...
Note Loading...
Set Loading...
This solution was written by @Chan Lye Lee . I'm posting it just for the sake of my fellow Brilliantians who were unable to do it.
Let m 2 = 2 2 0 0 − 2 1 9 2 × 3 1 + 2 n = 2 1 9 2 ( 2 2 5 + 2 n − 1 9 2 )
Then 2 2 5 + 2 n − 1 9 2 = a 2 for some positive integer a .
Let k 1 + k 2 = k = n − 1 9 2 .
Now 2 k = a 2 − 2 2 5 = ( a + 1 5 ) ( a − 1 5 ) .
We can express it in { 2 k 1 = a + 1 5 2 k 2 = a − 1 5 , where k 1 > k 2 .
The difference of the two equations yields 3 0 = 2 k 1 − 2 k 2 , which implies that 2 × 1 5 = 2 k 2 ( 2 k 1 − k 2 − 1 ) .
Clearly, { k 2 = 1 2 k 1 − k 2 − 1 = 1 5 and hence { k 2 = 1 k 1 = 5 .
Finally, k = 6 = n − 1 9 2 and thus n = 1 9 8 .