Some squares

Let k k be a positive integer. Find the sum of all k k which are solutions of the equation n 4 + 3 n 3 + n 2 + 2 n + 13 = k 2 \ n^4+3n^3+n^2+2n+13=k^2 for some integer n n .

Source: Problem 12 of Cesenatico final


The answer is 318.

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.

1 solution

Patrick Corn
Feb 15, 2018

Write k = n 2 + 3 2 n + a 2 . k = n^2 + \frac32 n + \frac{a}{2}. Expand and simplify to get ( 4 a + 5 ) n 2 + ( 6 a 8 ) n + ( a 2 52 ) = 0. (4a+5)n^2 + (6a-8)n + (a^2-52) = 0.

Now let's establish some bounds on a . a. First of all, this polynomial attains its minimum at n = 4 3 a 4 a + 5 ; n = \frac{4-3a}{4a+5}; when we plug that in we get 4 ( a 3 a 2 46 a 69 ) 4 a + 5 . \frac{4(a^3-a^2-46a-69)}{4a+5}. This is clearly positive if a a is at least 8 8 (the numerator is increasing, and it's positive when a = 8 a=8 ). If the minimum value of the left side is positive, then there is no solution. So a 7. a \le 7.

For a negative bound on a , a, consider that n 4 + 3 n 3 + n 2 + 2 n + 13 ( n 2 + 3 2 n 1 ) 2 = 3 4 n 2 + 5 n + 12 n^4+3n^3+n^2+2n+13 - (n^2+\frac32 n -1)^2 = \frac34n^2 + 5n + 12 which is positive, so k , k, the positive square root of n 4 + 3 n 3 + n 2 + 2 n + 13 , n^4+3n^3+n^2+2n+13, is strictly greater than the positive number n 2 + 3 2 n 1 n^2+\frac32 n - 1 . This shows that a 1. a \ge -1.

All that remains is to plug in the numbers a = 1 , 0 , , 6 , 7 a=-1,0,\ldots,6,7 into the quadratic equation at the top and see if there are any integer solutions. It turns out that a = 1 a=-1 is the only case where there are solutions, namely n = 3 , 17. n=-3,17. This leads in turn to k = 4 , 314 k=4,314 respectively, so the answer is 318 . \fbox{318}.

Edit, 8/17/18: I realized that "the positive number n 2 + 3 2 n 1 n^2+\frac32 n - 1 " is not always positive. But it is for n 2 , 1 , 0 , n \ne -2, -1, 0, which we can rule out by inspection.

@Patrick Corn How have you found such k k ? I mean, I know that in this way you could erase the terms of higher degree, but we're not sure that k k is an integer. For instance try to plug in an odd n n and an even a a , in order to obtain a rational non integer value of k k . Therefore, we might forget some solutions.

Filippo Olivetti - 3 years, 3 months ago

Log in to reply

No, we'd get too many solutions, and we'd end up throwing them out. If k k is an integer, then it is of the form n 2 + 3 2 n + a 2 n^2+\frac32 n + \frac{a}2 for some integer a . a. So if we find all the solutions of that form, we have found all the integer solutions, plus maybe some more, which we can discard at the end.

(Really, though, if some value of a a leads to a solution, then it will always have the right parity anyway--since the left side of the equation is an integer, there is no way that it can be the square of a rational number unless that rational number is an integer.)

Patrick Corn - 3 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...