and are positive integers between 1 and 100 (both inclusive).
If 5 divides , then find the number of ordered pairs .
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.
Observe the following
We know that the divisibility rule for 5 requires the number to have a 0 or a 5 in its unit's place. Therefore, such combinations of powers of 7 that we can have is
Now
So the number of possible pairs for m and n in each case is 2 5 ⋅ 2 5 = 6 2 5 . And thus the total of both the cases is 6 2 5 ⋅ 2 = 1 2 5 0 .
Also, since the pairs are ordered, therefore each pair ( i , j ) in this case has another alike pair ( j , i ) (note that all ordered pairs will have distinct members since we can never have i = j ). Thus the total number of pairs comes out to be 1 2 5 0 ⋅ 2 = 2 5 0 0 .