Find the sum of all positive integers for which the expression 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.
Let n 2 − 1 9 n + 9 9 = k 2 , which by the Quadratic Formula yields n = 2 1 9 ± 1 9 2 − 4 ( 1 ) ( 9 9 − k 2 ) = 2 1 9 ± 4 k 2 − 3 5 . Now in order for n to be an integer value, we require the discriminant 4 k 2 − 3 5 to equal a perfect square. Hence,
4 k 2 − 3 5 = m 2 ⇒ 4 k 2 − m 2 = 3 5 ⇒ ( 2 k + m ) ( 2 k − m ) = 5 1 7 1 .
The integer divisor pairs of 35 include ( 1 , 3 5 ) ; ( 5 , 7 ) ; ( − 1 , − 3 5 ) ; ( − 5 , − 7 ) , and we now set up the following systems of equations against these pairs:
1 ) 2 k − m = 5 ; 2 k + m = 7 ⇒ k = 3 , m = 1 .
2 ) 2 k − m = 1 ; 2 k + m = 3 5 ⇒ k = 9 , m = 1 7 .
3 ) 2 k − m = − 7 ; 2 k + m = − 5 ⇒ k = − 3 , m = 1 .
4 ) 2 k − m = − 3 5 ; 2 k + m = − 1 ⇒ k = − 9 , m = 1 7 .
Our required values for k are ± 3 and ± 9 , and substituting these values back into the original expression for n gives:
k = ± 3 ⇒ n = 2 1 9 ± 1 ⇒ n = 9 , 1 0 .
k = ± 9 ⇒ n = 2 1 9 ± 1 7 ⇒ n = 1 , 1 8 .
Finally, the required sum of such n is 1 + 9 + 1 0 + 1 8 = 3 8 .