We are asked to find the remainder obtained when the quantity 3×722+2×1022−44 is divided by 18. In modular-arithmetic language, this means that we must evaluate the given expression modulo 18, i.e. find its value in (mod18).
First, we note that for any integers a and b, the basic property of congruences is
a≡b(modm)⟹a⋅c≡b⋅c(modm),
and
a≡b(modm),c≡d(modm)⟹a±c≡b±d(modm).
We shall therefore replace each large power by its much smaller remainder modulo 18 and then combine the results.
Step 1: Evaluate 722(mod18).
We first look for a pattern in the powers of 7 modulo 18:
71=7≡7(mod18).
72=49≡49−2×18=49−36=13(mod18).
Now multiply again by 7:
73=72×7=13×7=91≡91−5×18=91−90=1(mod18).
We have reached 73≡1(mod18). This is extremely useful because now every third power will repeat the remainder 1. In other words,
73k≡1(mod18)for every integer k.
We write 22 as a multiple of 3 plus the remainder:
22=21+1=3×7+1.
So
722=721+1=72171=(73)77.
Because 73≡1, we replace it by 1:
(73)77≡177=7(mod18).
Thus we have
722≡7(mod18).
Step 2: Evaluate 1022(mod18).
We again look for a pattern, this time in the powers of 10 modulo 18:
101=10≡10(mod18).
Now square that value:
102=100≡100−5×18=100−90=10(mod18).
Notice that the remainder has come back to 10. Therefore a second multiplication by 10 will do the same:
103=102×10≡10×10=100≡10(mod18).
Hence once we reach the power 2, every additional power leaves the remainder unchanged at 10. Concretely, for all positive integers n≥1,
10n≡10(mod18).
In particular,
1022≡10(mod18).
Step 3: Substitute the reduced remainders into the original expression.
We have obtained
722≡7(mod18),
and
1022≡10(mod18).
Thus
3×722+2×1022−44
becomes
3×7+2×10−44(mod18).
Carrying out the multiplications gives
21+20−44(mod18).
Add the first two numbers:
21+20=41,
so we now have
41−44=−3(mod18).
Step 4: Convert the negative remainder to a positive one.
A remainder of −3 can be made positive by adding 18 (because adding or subtracting any multiple of the modulus does not change a congruence):
−3+18=15.
Therefore
−3≡15(mod18).
The required non-negative remainder is thus 15.
So, the answer is 15.