Let S n = n 2 + 2 0 n + 1 2 , where n is a positive integer. Enter the sum of all possible values of n for which S 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.
Good method...But how will u apply this method when coefficient of n is odd? For example if the question is Find n for which n 2 + 1 9 n + 9 2 is a perfect square.
Log in to reply
There is a more general idea for solving these kinds of problems.
Let's say we have an equation of the form
n 2 + a n + b = k 2
with a , b , n > 0 , k ≥ 0 being integers. Rearranging the terms and examining the discriminant of the quadratic equation in terms of n we end up with the following:
n 2 + a n + b − k 2 = 0
D = a 2 − 4 ( b − k 2 ) = 4 k 2 + a 2 − 4 b
Since one of the solutions of the quadratic equation is integer, the only possibility is that the value of the discriminant must be a square of an integer. Hence for some l nonnegative integer
4 k 2 + a 2 − 4 b = l 2
a 2 − 4 b = l 2 − 4 k 2
a 2 − 4 b = ( l − 2 k ) ( l + 2 k )
The value of a 2 − 4 b is known, so upon factoring into prime components, through the investigation of several cases we should be able to calculate l and k , thus determine the possible values of n .
In the case of your example, we obtain the equation
7 = ( 2 k − l ) ( 2 k + l ) .
Since 7 is prime and l is nonnegative, we can only get in one hand 2 k − l = 1 and 2 k + l = 7 , or in the other hand 2 k − l = − 7 and 2 k + l = − 1 which yield l = 3 and k = ± 2 . Putting in the value of k 2 into the original equation we obtain the quadratic equation n 2 + 1 9 n + 8 8 = 0 with both roots being negative. If we allow the case n ≤ 0 we obtain two solutions, namely -8 and -11. However, upon rejecting this possibility it follows that your example has no solutions over the positive integers.
Log in to reply
Thanx For a general solution @Sándor Daróczi
Such a creative solution! Niiiceu!
Problem Loading...
Note Loading...
Set Loading...
Let S n = k 2 for some nonnegative integer k . Then the equation becomes:
k 2 = n 2 + 2 0 n + 1 2 = ( n + 1 0 ) 2 − 8 8
8 8 = ( n + 1 0 ) 2 − k 2 = ( n + 1 0 + k ) ( n + 1 0 − k )
Since 8 8 = 2 3 ⋅ 1 1 and the terms on the right hand side have the same parity, paying attention to the fact that n + 1 0 − k > 0 we obtain the following 2 cases:
Case 1.: n + 1 0 + k = 4 4 and n + 1 0 − k = 2
Summing up these two equations yields 2 n + 2 0 = 4 6 or n = 1 3 .
Case 2.: n + 1 0 + k = 2 2 and n + 1 0 − k = 4
Suming up again we conclude that 2 n + 2 0 = 2 6 or n = 3 .
Upon calculations we can verify that these are both good solutions to this problem, making the answer 1 3 + 3 = 1 6 .