. Naturally, decryption also relies on numerous results about modular arithmetic. [6 pts] Prove in prose by induction fo

[answerhappygod]

. Naturally, decryption also relies on numerous results aboutmodular arithmetic.
[6 pts] Prove in prose by induction for all positive integers 𝑚:if 𝑎, 𝑏, and 𝑛 are integers with 𝑛 > 1
and𝑎≡𝑏(mod𝑛),then𝑎𝑚 ≡𝑏𝑚 (mod𝑛).
[9 pts] Compute the private key for the public key (55,17), anddecrypt the cyphertext 𝐶 = 41.