Determine the number of ordered pairs of positive integers satisfying .
Bonus: Generalize the problem for the equation for positive integers .
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.
a 2 − b 2 = 5 1 0 1 0 1
( a + b ) ( a − b ) = 5 1 0 1 0 1
Now, we have to consider which pairs of factors of 5 1 0 1 0 1 are able to equal ( a + b ) ( a − b ) . For example, we can have:
5 1 0 1 0 1 × 5 0 ,
5 1 0 1 0 0 × 5 1 ,
5 1 0 0 9 9 × 5 2 ,
. . .
5 5 0 5 2 × 5 5 0 4 9 ,
5 5 0 5 1 × 5 5 0 5 0 .
In total, there are 5 0 5 1 possible pairs of factors. Since a and b are positive, ( a + b ) must be the larger factor. In all of these cases, due to the parity of a and b , ( a + b ) ( a − b ) can be made, meaning that there are 5 0 5 1 distinct pairs of ( a , b ) .
If we generalise for 5 n , since 5 is prime, there will be a determinable number of pairs of factors. When n is odd, there are 2 n + 1 possible pairs. However, if n is even, e.g. 5 2 k , we get a pair of factors of 5 k × 5 k . This would make b = 0 which is impossible, therefore this pair must be discounted. Therefore, an even n has the same result as the odd number n − 1 . In general, we can write this out in a couple of ways:
2 n + ( n m o d 2 )
or
⌈ 2 n ⌉