Let b and c be positive integers such that the polynomial equations x 2 + b x + c = 0 and x 2 + b x − c = 0 both have integer solutions. Determine the sum of all values of b ≤ 5 0 for which polynomials of this form exist.
Details and assumptions
There is no restriction on the size of c .
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.
Well done!
Nicely Done !
Also I should clarify as to why p is a solution to m 2 + n 2 = p 2 iff p = 4 k + 1 and p is prime.
The above equation is the same form as pythagoras' equation, and pythagorean triples are of the form a = m 2 − n 2 , b = 2 m n , c = m 2 + n 2 .
Using Fermat's "Christmas" Theorem, the only solutions c to the last equation (other than the case where c = 2 )are primes of the form 4 k + 1 and multiples thereof (this statement is biconditional). Since p must be the hypotenuse of a pythagorean triple, it must also be any multiple of a prime of the form 4 k + 1 .
Nice! I solved it by 1 0 simple diophantine equations ( 1 for each case.), bu it requires a lot of listing. This is much elegant.
I can't really get your solution. Is b = 1 0 not a valid solution ?
The second paragraph I just realized is a bit shotty. First I should state the biconditionality of the first statement: p is a solution to m 2 + n 2 = p 2 iff p ≡ 1 ( m o d 4 ) (and p is prime).
Secondly, the next assertion I make only implies that b can be a prime of the 4 k + 1 and multiples, but doesn't assert that those are the unique solutions to the equation. That said, a proof could probably be easily found online somewhere to explain why these non-Gaussian primes are the solutions to this equation.
Log in to reply
You may want to take a look at the Advanced Gaussian Integers blog . While it does not specifically address your question, it gives a pretty complete picture.
The quadratic x 2 + b x + c has integer roots if and only if its discriminant b 2 − 4 c is a perfect square. (If you are really interested in the pesky details, I have saved the justification for this somewhat obvious claim for the end of the proof.) Similarly, the quadratic x 2 + b x − c has integer roots if and only if b 2 + 4 c is a perfect square.
Let b 2 − 4 c = x 2 and b 2 + 4 c = y 2 , where x and y are nonnegative integers. Since b 2 + 4 c is positive, y is also positive. If x = 0 , then b 2 = 4 c , so y 2 = b 2 + 4 c = 2 b 2 , which is impossible (since 2 is irrational), so x is also a positive integer. Also, b 2 + 4 c > b 2 − 4 c , so y > x .
Adding the equations b 2 − 4 c = x 2 and b 2 + 4 c = y 2 , we get 2 b 2 = x 2 + y 2 , so b 2 = 2 x 2 + y 2 . Note that we can write this equation in the form b 2 = ( 2 y + x ) 2 + ( 2 y − x ) 2 .
From the equations b 2 − 4 c = x 2 and b 2 + 4 c = y 2 , we see that b , x , and y must all have the same parity. Hence, ( y + x ) / 2 and ( y − x ) / 2 are positive integers.
Let u = ( y + x ) / 2 and v = ( y − x ) / 2 , so b 2 = u 2 + v 2 . This equation tells us that b is the largest number in a Pythagorean triple.
Conversely, suppose that b is the largest number in a Pythagorean triple, so b 2 = u 2 + v 2 for some positive integers u and v . If both u and v are odd, then u 2 ≡ v 2 ≡ 1 ( m o d 4 ) , and b 2 = u 2 + v 2 ≡ 2 ( m o d 4 ) , but no square is congruent to 2 modulo 4, so at least one of u and v must be even. Let c = u v / 2 , which is a positive integer. Then b 2 − 4 c = u 2 + v 2 − 2 u v = ( u − v ) 2 , and b 2 + 4 c = u 2 + v 2 + 2 u v = ( u + v ) 2 , so both x 2 + b x + c and x 2 + b x − c have integer roots.
The problem now is to determine how many b ≤ 5 0 are the largest number in a Pythagorean triple. Recall that in a primitive Pythagorean triple, the largest number is of the form m 2 + n 2 , where m and n are relatively prime and have opposite parity. By hand, we can determine that the numbers of these form up to 50 are 5, 13, 17, 25, 29, 37, and 41. We can then take all multiples of these numbers that are at most 50. This gives us the list 5, 10, 13, 15, 17, 20, 25, 26, 29, 30, 34, 35, 37, 39, 40, 41, 45, and 50. The sum of these numbers is 511.
Claim . The quadratic x 2 + b x + c has integer roots if and only if b 2 − 4 c is a perfect square.
Proof . Assume that the quadratic x 2 + b x + c has integer roots. Then by the quadratic formula, b 2 − 4 c must be the square of a rational number. But b 2 − 4 c is an integer, so if it is the square of a rational number, then it must be a perfect square.
Conversely, assume that b 2 − 4 c is a perfect square. Then by the quadratic formula, x 2 + b x + c has rational roots. But the quadratic x 2 + b x + c is monic, so by the Rational Root theorem, its roots are integers.
Very nice!
Problem Loading...
Note Loading...
Set Loading...
Using the quadratic formula, the problem essentially asks the following: For what ( b , c ) are there such that both b 2 + 4 c and b 2 − 4 c are both perfect squares. We know that that condition is sufficient to be an integer because the numerator will always be even, thus, the whole expression will be an integer.
If the difference between two squares is even, then it is a multiple of 4 . This can be shown with the following:
The parity of b 2 + 4 c = m 2 and b 2 − 4 c = n 2 are the same, thus the parity of m and n are the same and they have an even difference. Rewriting n as ( m + 2 k ) , we get m 2 − ( m + 2 k ) 2 = 4 p → − 4 m − 4 = 4 p . So we can focus only on b , restating the problem as "what integers satisfy the equation x 2 + y 2 = 2 b 2 ?"
The only solutions for p to the equation m 2 + n 2 = p 2 are primes of the form 4 k + 1 and multiples thereof. It follows that ( m + n ) 2 + ( m − n ) 2 = 2 p 2 , thus b is a prime of the form 4 k + 1 and multiples thereof.
Thus, the solutions for b ≤ 5 0 are the multiples of 5 , 1 3 , 1 7 , 2 9 , 3 7 , 4 1 less than 5 0 , which when added together equals 5 1 1 .