Find the sum of all values of n such that 2 2 0 0 − 3 1 ⋅ 2 1 9 2 + 2 n is a perfect square.
Click here to try the similar version of this problem.
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.
Same solution
Am I right in asking that you have assumed that n > 1 9 2 ?
Log in to reply
Yes.... I must also show that there is no solution for n < 1 9 2 .
Same Solution.
Suppose 2 2 0 0 − 3 1 ⋅ 2 1 9 2 + 2 n = m 2 , m ∈ Z . 2 2 0 0 − 3 1 ⋅ 2 1 9 2 + 2 n 2 2 0 0 − ( 2 5 − 1 ) 2 1 9 2 + 2 n 2 2 0 0 − 2 1 9 7 + 2 1 9 2 + 2 n ( 2 1 0 0 ) 2 − 2 ⋅ 2 1 0 0 ⋅ 2 9 6 + ( 2 9 6 ) 2 + 2 n ( 2 1 0 0 − 2 9 6 ) 2 + 2 n ( ( 2 4 − 1 ) 2 9 6 ) 2 + 2 n ( 1 5 ⋅ 2 9 6 ) 2 + 2 n m 2 − ( 1 5 ⋅ 2 9 6 ) 2 ( m − 1 5 ⋅ 2 9 6 ) ( m + 1 5 ⋅ 2 9 6 ) = m 2 = m 2 = m 2 = m 2 = m 2 = m 2 = m 2 = 2 n = 2 x ⋅ 2 y Let ( m − 1 5 ⋅ 2 9 6 ) = 2 x and ( m + 1 5 ⋅ 2 9 6 ) = 2 y and x + y = n . Now, WLOG x ⩽ y . 2 y − 2 x 2 x ( 2 y − x − 1 ) = 3 0 ⋅ 2 9 6 = 1 5 ⋅ 2 9 7 Comparing, we get 2 x 2 y − x − 1 = 2 9 7 = 2 4 − 1 ⇒ x = 9 7 , y = x + 4 = 1 0 1 , n = x + y = 1 9 8
Problem Loading...
Note Loading...
Set Loading...
2 2 0 0 − 3 1 ⋅ 2 1 9 2 + 2 n = 2 1 9 2 ( 2 8 − 3 1 + 2 n − 1 9 2 ) = 2 1 9 2 ( 2 2 5 + 2 n − 1 9 2 ) .
Since 2 1 9 2 is a perfect square, 2 2 5 + 2 n − 1 9 2 must also be a perfect square.
This is equivalent to determining a Pythagorean triple where one term is 1 5 and where the other term is a power of 2 .
We find that the only Pythagorean triplet satisfying this condition is ( 1 5 , 8 , 1 7 ) .
Therefore, 2 n − 1 9 2 = 6 4 = 2 6 ⟹ n = 1 9 8 is the only solution.