
Prove that given any positive integer n we can find a larger integer m such that the decimal expansion of 5m can be obtained from that for 5n by adding additional digits on the left.
Solution
We prove first that 5N - 1 is divisible by 2n+2 for N = 2n. This is an easy induction. It is true for n = 1. Suppose it is true for n. Then 5N - 1 is divisible by 2n+2. But 5N + 1 is certainly even, so it is divisible by 2. Hence (5N + 1)(5N - 1) = 52N - 1 is divisible by 2n+3, so the result is true for all n.
So suppose 5n has k decimal digits. Clearly k ≤ n. We can find N such that 5N - 1 is divisible by 2k. Hence (5N - 1)5n is divisible by 2k5k = 10k. In other words it ends in at least k zeros. So 5N+n = (5N - 1)5n + 5n ends in the same digits as 5n. In other words we may take m = n + N.
![]()
© John Scholes
jscholes@kalva.demon.co.uk
11 Apr 2002