How many ordered pairs of positive integers ( a , b ) are there, such that
1 0 4 = a 2 − b 2 ?
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.
Nice job!
This solution is very similar to the Chin Fong W.'s, but more clearly written.
1 0 0 0 0 = 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 × 1 0 0 0 0 , 5 × 2 0 0 0 , 1 6 × 6 2 5 , 2 5 × 4 0 , a n d 8 0 × 1 2 5 have sum of the pairs is odd number
and the 1 0 0 × 1 0 0 will have a = 1 0 0 a n d b = 0 where 0 is not a positive integer.
Hence, the number of ordered pairs of positive integers ( a , b ) are 1 3 − 6 − 1 = 7
Nice solution, but there is a misprint. 1 3 − 6 − 1 is, of course, 6 , not 7 . Probably, 1 3 − 5 − 1 or 1 3 − 6 was meant.
The condition that the sum is even is necessary and sufficient for the numbers a and 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.
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.
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.
Hey, 13 − 6 − 1 = 7 (false) 13 − 6 − 1 = 6 (true) 13 − 6 = 7 (true)
1 0 4 = a 2 − b 2 = > a 2 = 1 0 0 2 + b 2
So we have to find all possible Pythagorean triplets ( a , 1 0 0 , b ) where one side is known.
Now, 1 0 0 has factors = 1 0 0 , 5 0 , 2 5 , 2 0 , 1 0 , 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,
( 2 5 0 1 , 1 0 0 , 2 4 9 9 ) , ( 6 2 9 , 1 0 0 , 6 2 1 ) , ( 1 2 5 , 1 0 0 , 7 5 )
If the known side is 5 0 , we end up with the only triple ( 6 2 6 , 5 0 , 6 2 4 ) . Multiplying throughout by 2 , we get another triple ( 1 2 5 2 , 1 0 0 , 1 2 4 8 ) .
For 'known side' = 2 5 , we have ( 3 1 3 , 2 5 , 3 1 2 ) . Multiplying through out by 4 , we have ( 1 2 5 2 , 1 0 0 , 1 2 4 8 ) , which has already been counted earlier.
Proceeding with 'known side' = 2 0 , we have ( 1 0 1 , 2 0 , 9 9 ) and ( 2 9 , 2 0 , 2 1 ) . Multiplying throughout by 5 , we have ( 5 0 5 , 1 0 0 , 4 9 5 ) and ( 1 4 5 , 1 0 0 , 1 0 5 ) .
For 'known side' = 1 0 , we get ( 2 6 , 1 0 , 2 4 ) . Multiplying throughout by 1 0 , we have ( 2 6 0 , 1 0 0 , 2 4 0 ) .
For 'known side' = 5 and 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
This works, but it is a rather complicated solution.
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.
Problem Loading...
Note Loading...
Set Loading...
We begin by listing the factor pairs of 1 0 4 = 1 0 0 0 0 . 1 0 0 0 0 = 1 ⋅ 1 0 0 0 0 = 2 ⋅ 5 0 0 0 = 4 ⋅ 2 5 0 0 = 5 ⋅ 2 0 0 0 = 8 ⋅ 1 2 5 0 = 1 0 ⋅ 1 0 0 0 = 1 6 ⋅ 6 2 5 = 2 0 ⋅ 5 0 0 = 2 5 ⋅ 4 0 0 = 4 0 ⋅ 2 5 0 = 5 0 ⋅ 2 0 0 = 8 0 ⋅ 1 2 5 = 1 0 0 ⋅ 1 0 0
Note that a 2 − b 2 = ( a + b ) ( a − b ) . These two factors must be integer factor pairs of 1 0 0 0 0 . Adding these two factors produces 2 a (and similarly subtracting the second from the first produces 2 b ), 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 ( 1 0 0 , 1 0 0 ) , as that produces b = 0 and we are only concerned with positive integers. Thus the number of desired pairs is 7 .