Pairs of squares

How many ordered pairs of positive integers ( a , b ) (a,b) are there, such that

1 0 4 = a 2 b 2 ? 10^4 = a^2 - b^2 ?


The answer is 7.

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.

4 solutions

Tanishq Aggarwal
Sep 1, 2013

We begin by listing the factor pairs of 1 0 4 = 10000 10^4=10000 . 10000 = 1 10000 = 2 5000 = 4 2500 = 5 2000 = 8 1250 = 10 1000 = 16 625 = 20 500 = 25 400 = 40 250 = 50 200 = 80 125 = 100 100 \begin{aligned} 10000 =1 \cdot 10000 \\ =2 \cdot 5000 \\ =4 \cdot 2500 \\ =5 \cdot 2000 \\ =8 \cdot 1250 \\ =10 \cdot 1000 \\ =16 \cdot 625 \\ =20 \cdot 500 \\ =25 \cdot 400 \\ =40 \cdot 250 \\ =50 \cdot 200 \\ =80 \cdot 125 \\ =100 \cdot 100 \\ \end{aligned}

Note that a 2 b 2 = ( a + b ) ( a b ) a^2-b^2=(a+b)(a-b) . These two factors must be integer factor pairs of 10000 10000 . Adding these two factors produces 2 a 2a (and similarly subtracting the second from the first produces 2 b 2b ), so the parity of the two factors must be the same. It is easy to see that there are exactly 8 factor pairs listed above that have factors of the same parity. However, we must not consider ( 100 , 100 ) (100,100) , as that produces b = 0 b=0 and we are only concerned with positive integers. Thus the number of desired pairs is 7 \boxed{7} .

Moderator note:

Nice job!

This solution is very similar to the Chin Fong W.'s, but more clearly written.

Chin Fong Wong
Sep 2, 2013

10000 = a 2 b 2 = ( a + b ) ( a b ) 10000=a^2-b^2=(a+b)(a-b) , sum of the pairs of multiplication (a+b) and (a-b) = 2a = even

Finding all the multiplication pairs of 10000,we get 13 pairs:

However, 5 of the pairs 1 × 10000 , 5 × 2000 , 16 × 625 , 25 × 40 , a n d 80 × 125 {1\times 10000, 5\times 2000, 16\times 625, 25\times 40, and 80\times 125} have sum of the pairs is odd number

and the 100 × 100 {100\times 100} will have a = 100 a n d b = 0 a=100 and b=0 where 0 is not a positive integer.

Hence, the number of ordered pairs of positive integers ( a , b ) (a,b) are 13 6 1 = 7 13-6-1=7

Moderator note:

Nice solution, but there is a misprint. 13 6 1 13-6-1 is, of course, 6 , 6, not 7 7 . Probably, 13 5 1 13-5-1 or 13 6 13-6 was meant.

The condition that the sum is even is necessary and sufficient for the numbers a a and b b to be integers. This was not really explained in the solution, but you should be able to prove it yourself (if a general proof eludes you, just go through the list of the divisor pairs, and you will see the pattern).

Maybe I am misreading this but a+b+a-b being even does not imply that a and b are each even.

Everett Scheter - 7 years, 9 months ago

Log in to reply

Yes, this is a minor point that was overlooked. We need that the sum is even, and at least one of the number is even, to conclude that both numbers are even.

Calvin Lin Staff - 7 years, 9 months ago

I used the fact that perfect squares are the sum of consecutive odds starting at 1. Then differences of perfect squares are sums of consecutive odds. In this case finding those adding to 10000 (eg. 4999+5001; 2497+2499+2501+2503;...) gave me 7 pairs.

Everett Scheter - 7 years, 9 months ago

Hey, 13 − 6 − 1 = 7 (false) 13 − 6 − 1 = 6 (true) 13 − 6 = 7 (true)

Rakhmat Muliawan - 7 years, 9 months ago
Vicky Bro
Sep 4, 2013

1 0 4 = a 2 b 2 10^{4} = a^{2}-b^{2} = > a 2 = 10 0 2 + b 2 => a^{2} = 100^2+b^{2}

So we have to find all possible Pythagorean triplets ( a , 100 , b ) (a,100,b) where one side is known.

Now, 100 100 has factors = 100 , 50 , 25 , 20 , 10 , 5 , 2 , 1 100, 50, 25, 20, 10, 5, 2, 1 , each of which has to be used as the "known side" in Euclid's formula, which has been discussed here .

By Euclid's formula for Pythagorean triples, if one of the known sides is 100, we have the following triples,

( 2501 , 100 , 2499 ) , ( 629 , 100 , 621 ) , ( 125 , 100 , 75 ) (2501,100,2499),(629,100,621),(125,100,75)

If the known side is 50 50 , we end up with the only triple ( 626 , 50 , 624 ) (626,50,624) . Multiplying throughout by 2 2 , we get another triple ( 1252 , 100 , 1248 ) (1252,100,1248) .

For 'known side' = 25 = 25 , we have ( 313 , 25 , 312 ) (313,25,312) . Multiplying through out by 4 4 , we have ( 1252 , 100 , 1248 ) (1252,100,1248) , which has already been counted earlier.

Proceeding with 'known side' = 20 = 20 , we have ( 101 , 20 , 99 ) (101,20,99) and ( 29 , 20 , 21 ) (29,20,21) . Multiplying throughout by 5 5 , we have ( 505 , 100 , 495 ) (505,100,495) and ( 145 , 100 , 105 ) (145,100,105) .

For 'known side' = 10 = 10 , we get ( 26 , 10 , 24 ) (26,10,24) . Multiplying throughout by 10 10 , we have ( 260 , 100 , 240 ) (260,100,240) .

For 'known side' = 5 = 5 and 2 2 , we will get some triples which we already have got from other factors, so we will not count them. Finally, we arrive at the conclusion that the number unique triples is 7 7

This works, but it is a rather complicated solution.

Alexander Borisov - 7 years, 9 months ago
Gopal Bhakat
Sep 3, 2013

a^2 - b^2=(a+b)(a-b)... now we are assuming a-b as x and a+b as y... here we need to understand that both x and y have to be even nos.. we can write 10^4=2^4 * 5^4, so total no of factors of 10^4 = (4+1)(4+1)=25 so we can take 12 pair of (x, y) such that x*y=10^4, (where x and y are distinct), but here we need pairs of even nos.. so we have to reject (1,2^4 * 5^4),(5,2^4 * 5^3)....... and so on.. so the no of pairs which have an odd no is 5. So the ans is 12-5=7.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...