MathLabs

Problem 1

Let mm and nn be positive integers with 1≤m<n1 \le m < n. In their decimal representations, the last three digits of 1978m1978^m are equal, respectively, to the last three digits of 1978n1978^n. Find mm and nn such that m+nm+n has its least value.
Step 7 of 8: Rule out the smaller divisors 4 and 20
In plain words

Since the order must divide 100 and be a multiple of 4, checking just two values settles it completely.

19784≡6, 197820≡26(mod125)  ⇒  ord125(1978)=1001978^4\equiv 6,\ 1978^{20}\equiv 26 \pmod{125} \;\Rightarrow\; \mathrm{ord}_{125}(1978)=100
Detailed analysis

Direct computation modulo 125125 gives 19784≡61978^4\equiv 6 and 197820≡261978^{20}\equiv 26, both different from 11, so neither 44 nor 2020 is the order; the only remaining candidate is 100100.