For how many pairs with and integers satisfying and is divisible by 10?
Problem 583
Official solution
We determine when is divisible by 10 by looking at the units (ones) digits of .
To do this, we first look individually at the units digits of and .
The units digits of powers of 3 cycle .
To see this, we note that the first few powers of 3 are Since the units digit of a product of integers depends only on the units digits of the integers being multiplied and we multiply by 3 to get from one power to the next, then once a units digit recurs in the sequence of units digits, the following units digits will follow the same pattern.
This means that the units digits of powers of 3 cycle every four powers of 3.
Therefore, of the 100 powers of 3 of the form with , exactly 25 will have a units digit of 3, exactly 25 will have a units digit of 9, exactly 25 will have a units digit of 7, and exactly 25 will have a units digit of 1.
The units digits of powers of 7 cycle .
To see this, we note that the first few powers of 7 are Using the same argument as above, the units digits of powers of 7 cycle every four powers of 7.
Since is 1 more than a multiple of 4, then the power is at the beginning of one of these cycles, and so the units digit of is a 7.
Therefore, of the 105 powers of 7 of the form with , exactly 27 will have a units digit of 7, exactly 26 will have a units digit of 9, exactly 26 will have a units digit of 3, and exactly 26 will have a units digit of 1. (Here, 105 powers include 26 complete cycles of 4 plus one additional term.)
For to have a units digit of 0 (and thus be divisible by 10), one of the following must be true:
the units digit of is 3 (25 possible values of ) and the units digit of is 7 (27 possible values of ), or
the units digit of is 9 (25 possible values of ) and the units digit of is 1 (26 possible values of ), or
the units digit of is 7 (25 possible values of ) and the units digit of is 3 (26 possible values of ), or
the units digit of is 1 (25 possible values of ) and the units digit of is 9 (26 possible values of ).
The number of possible pairs is therefore