To obtain the product of the last two digits of (1919)1919 we must first find those two digits, i.e. evaluate (1919)1919(mod100).
Step 1 : Reduce the base modulo 100
1919≡19(mod100)
Hence (1919)1919≡191919(mod100).
Step 2 : Reduce the exponent using Euler’s theorem
Since gcd(19,100)=1, Euler’s theorem gives 19ϕ(100)≡1(mod100).
Factorising 100=22⋅52,
ϕ(100)=100(1−21)(1−51)=40.
Therefore the powers of 19 repeat every 40:
1940≡1(mod100).
Now reduce the exponent 1919 modulo 40:
1919=40×47+39⟹1919≡39(mod40).
Thus
191919≡1939(mod100)−(1)
Step 3 : Shorten the exponent further (optional but quicker)
We shall show that 1910≡1(mod100), which will cut the power down even more.
Compute successive powers of 19 (always keeping only the last two digits):
191=19
192=361≡61
193=61⋅19=1159≡59
194=59⋅19=1121≡21
195=21⋅19=399≡99
196=99⋅19=1881≡81
197=81⋅19=1539≡39
198=39⋅19=741≡41
199=41⋅19=779≡79
1910=79⋅19=1501≡01≡1
Since 1910≡1(mod100), rewrite the required power:
1939=1910⋅3⋅199≡(1910)3⋅199≡13⋅199≡199(mod100).
Step 4 : Evaluate 199(mod100) (already calculated above)
From the list, 199≡79(mod100).
Hence the last two digits of (1919)1919 are 7 and 9.
Step 5 : Required product
Product of the digits 7×9=63.
Final Answer : 63