I came across this somewhere,
An important consequence of the chinese remainder theorem is that when studying modular arithmetic in general, we can first study modular arithmetic a prime power and then appeal to the Chinese Remainder Theorem to generalize any results. For any integer $n$, we factorize $n$ into primes $n=p_{1}^{k_1}\dots p_{m}^{k_m},$ and then use the Chinese Remainder Theorem to get
$$ℤ_n=ℤ_{p_{1}^{k_1}}×\cdots ×ℤ_{p_{m}^{k_m}}$$
To prove statements in $ℤ_{{p}^{k}}$, one starts from $ℤ_{{p}}$, and inductively works up to $ℤ_{{p}^{k}}$. Thus the most important case to study is $ℤ_{{p}}$.
Can someone help me do the induction on this?
Suppose you want to find the last 2 digits of $2^{80}$ i.e. what is $2^{80} \pmod {100}$ The Chinese remainder theorem says to look at:
$2^{80} \pmod {2},2^{80} \pmod {5}, 2^{80} \pmod {4}, 2^{80} \pmod {25}$
$2^{80} 4^{40}\equiv 0 \pmod {4}$
$2^{4} \equiv 1\pmod {5}$ Fermat little theorem
$2^{20} \equiv 1\pmod {25}$
We need a number that equals $1$ when divided by $25$ and $0$ when divided by $4,$ and is less than $100.$
$76$