Verify that Euler's Theorem holds in Zm, m = 6,9, for all elements a for which gcd(a,m) = 1. Also verify that the theorem does not hold for elements a for which gcd(a,m) ≠ 1.
For the affine cipher in Chapter 1 the multiplicative inverse of an element modulo 26 can be found a
![2396_6092e25f-ec2b-471c-a351-f4b02f47a45a.png](https://secure.tutorsglobe.com/CMSImages/2396_6092e25f-ec2b-471c-a351-f4b02f47a45a.png)
Derive this relationship by using Euler's Theorem.