Find the sum of all integers n such that both n − 2 0 0 2 and n + 2 0 0 2 are perfect squares.
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.
Fantastic Solution!
{ a 2 = n + 2 0 0 2 b 2 = n − 2 0 0 2 ⇔ { a 2 − b 2 = 4 0 0 4 n = 2 a 2 + b 2 ⇔ ( a + b ) ⋅ ( a − b ) = 4 0 0 4
Now, intending a clearer approach, let´s make
{ x = a + b y = a − b ⇔ { a = 2 x + y b = 2 x − y
Then,
x ⋅ y = 1 3 × 1 1 × 7 × 2 × 2 × 1 = 4 0 0 4
We can just think in the values for x and y that give us positives integers values for a and b, because for n, a and b must be integers and they are squared.
By the factorization we just have integers values for a and b if x and y are both even, which give us,
1) x = 2 0 0 2 ; y = 2 → a = 1 0 0 2 ; b = 1 0 0 0 → n = 1 0 0 2 0 0 2
→ n + 2 0 0 2 = 1 0 0 4 0 0 4 = 1 0 0 2 → n − 2 0 0 2 = 1 0 0 0 0 0 0 = 1 0 0 0
2) x = 2 8 6 ; y = 1 4 → a = 1 5 0 ; b = 3 6 → n = 2 0 4 9 8
→ n + 2 0 0 2 = 2 2 5 0 0 = 1 5 0 → n − 2 0 0 2 = 1 8 4 9 6 = 1 3 6
3) x = 1 8 2 ; y = 2 2 → a = 1 0 2 ; b = 8 0 → n = 8 4 0 2
→ n + 2 0 0 2 = 1 0 4 0 4 = 1 0 2 → n − 2 0 0 2 = 6 4 0 0 = 8 0
4) x = 1 5 4 ; y = 2 6 → a = 9 0 ; b = 6 4 → n = 6 0 9 8
→ n + 2 0 0 2 = 8 1 0 0 = 9 0 → n − 2 0 0 2 = 4 0 9 6 = 6 4
So,
∑ n = 1 0 0 2 0 0 2 + 2 0 4 9 8 + 8 4 0 2 + 6 0 9 8 = 1 0 3 7 0 0 0
It is an utter pleasure add a solution, even that just to a Level 4 problem. From a Totally Level 5 Member. Satyajit Mohanty. The Mathematical Nerd.
Let n - 2002 = k^2, n + 2002 = l^2; subtracting, 4004 = l^2 - k^2 = (l - k)(l + k). 4004 = 2^2 7 11 13. We seek factors l - k and l + k which are both even. Clearly, both cannot be odd, and they cannot be of opposite parity, for their sum = 2l would be odd, a contradiction. Alittle reflection shows that the only products available are (1): 2 2002, (2) 14 286, (3) 22 182, and (4) 26*154.In each case, setting l - k = smaller factor, l + k = larger factor, and subtracting, dividing by 2, we have l = 1002, 150, 102, and 90. For each value of l, we compute l^2 - 2002 = n, and sum the four answers getting 1037000. Ed Gray
Problem Loading...
Note Loading...
Set Loading...
Let the two perfect squares be a − b and a + b . Then
( a + b ) 2 − ( a − b ) 2 = 4 a b = 4 0 0 4 ⇒ a b = 1 0 0 1 .
n = 2 ( a + b ) 2 + ( a − b ) 2 = a 2 + b 2 .
We must therefore consider all possible factorizations a ⋅ b = 1 0 0 1 ; each of them contributes a 2 + b 2 to the final sum. In other words, the answer is simply the sum of squares of all divisors of 1001:
N = d ∥ 1 0 0 1 ∑ d 2 ,
Since 1 0 0 1 = 7 × 1 1 × 1 3 , there are eight divisors, which can be factored as:
d = ( 1 or 7 ) ⋅ ( 1 or 1 1 ) ⋅ ( 1 or 1 3 ) .
Thus the sum of the squares of these divisors is
∑ ( 1 + 7 2 ) ⋅ ( 1 + 1 1 2 ) ⋅ ( 1 + 1 3 2 ) = 5 0 × 1 2 2 × 1 7 0 = 1 0 3 7 0 0 0 .