Find the sum of all positive integers n such that n 2 + 1 2 n + 6 5 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.
What about n=-20?
Log in to reply
The question asks for positive integer n and hence negative number is not in our consideration.
Log in to reply
That was edited later when you attempted the question, earlier the question said sum of all integers n and not only positive.
Log in to reply
@Kushagra Sahni – I edited my solution (not the question) so that it is clearer. Hope that it is now no ambiguity.
Log in to reply
@Chan Lye Lee – I am talking about the question not the answer and of course you can't edit the question. I said when I attempted the question it asked sum of all possible integers n.
Log in to reply
@Kushagra Sahni – In future, if you spot any errors with a problem, you can “report” it by selecting "report problem" in the “More” menu in the top right corner. This will notify the problem creator/staff who can fix the issues.
Those who answered -12 have been marked correct. The correct answer is now 8.
By completing the square, we get
n 2 + 1 2 n + 6 5 = ( n + 6 ) 2 + 2 9
Through analysis, it can be found that difference of square number is always a unique odd number (in a particular order) -
= n 2 − ( n − 1 ) 2 = ( n + n − 1 ) ( n − n + 1 ) = 2 n − 1
Now we want to find two squares numbers whose difference is 29. In other words, we need to find a positive integer m such that n 2 + 2 9 = m 2 .
We can find this number using the previously discovered formula.
2 n − 1 = 2 9 n = 1 5
Hence our numbers are 14 and 15. So 1 5 2 − 1 4 2 = 2 9 . In our previous formula ( n + 6 ) 2 + 2 9 , we find out that n + 6 = 1 4 ⟹ n = 8 .
Also a negative solution, n = − 2 0 exists but we can ignore it since the questions only asks for positive numbers.
Uniqueness of the solution can be proved from the fact that n 2 − ( n − 1 ) 2 is unique for every distinct n . Additionally, ( n + 6 ) 2 + 2 9 cannot be factored further over reals.
This solution is wrong. Your analysis worked only for difference of two consecutive square numbers. You have not demonstrated uniqueness of the solution, since you only considered consecutive square numbers. The irreducibility of ( n + 6 ) 2 + 2 9 over the reals has little/no relation to the result that the answer is unique. What is important here is that 29 is prime.
If we had to solve for n 2 + 3 5 = m 2 , then there are more solutions than just 2 n − 1 = 3 5 .
Problem Loading...
Note Loading...
Set Loading...
If n 2 + 1 2 n + 6 5 = ( n + 6 ) 2 + 2 9 = k 2 for some integer k , then ( k + n + 6 ) ( k − n − 6 ) = 2 9 . Since 29 is a prime number, hence { k + n + 6 = a k − n − 6 = b where ( a , b ) = ( 2 9 , 1 ) , ( 1 , 2 9 ) , ( − 2 9 , − 1 ) , ( − 1 , − 2 9 ) . The difference of the two equations gives n = 8 , − 2 0 , − 2 0 and 8 respectively. As the question requires for positive integer n , we conclude that n = 8 is the only answer.