Number theoryDifficulty 7.6National Olympiad, round 2Prove itHong Kong
a. Let a, n, k be positive integers. Prove that a4n+k and ak have identical first (rightmost) digits in their decimal representations.
b. Find the first digit of the decimal representation of the number 21999+71999+91999.
Solution
a. By the Euler-Fermat theorem, since φ(10)=4 and 4n+k≡k(mod4), we have a4n+k≡ak(mod10) for any positive integers a, n, k. This means a4n+k and ak have the same rightmost digit.
b. The rightmost digit is 0. By part (a), since 1999≡3(mod4), we have 21999+71999+91999≡23+73+93≡8+3+9≡0(mod10). This shows the rightmost digit of the given number is 0.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.