Answer:
[tex]7^{-1} \equiv 943 \,\,\, \text{mod 1320}[/tex]
Step-by-step explanation:
According to the information you are looking for the smallest integer n greater than 1 such that
[tex]n^{-1} (\text{mod} \,\,\,\, 1320)[/tex]
is defined.
To begin with remember what a coprime means, two numbers are coprimes when their greatest common divisor is 1.
For example, 9,12 are NOT coprime because their greater common divisor is 3. But 5,6 are coprime because their greatest common divisor is 1.
Also what Euler's theorem. If "a,m" are coprimes then
[tex]{\displaystyle a^{\phi(m)} \equiv 1[/tex]
Where [tex]{\displaystyle \phi[/tex] is the Euler's totient function. Remember that the totient function computes the number of coprimes less than [tex]n[/tex]. Then
The Euler's theorem can also be applied for multiplicative inverses.
The smallest integer coprime to 1320, also
[tex]\phi(1320) = 320[/tex]
Then
[tex]7^{-1} \equiv 7 ^{\phi(1320)-1} \,\,\, \text{mod 1320} \equiv 7^{320-1} \,\,\, \text{mod 1320} \\\equiv 7^{319} \,\,\, \text{mod 1320} \equiv 943 \,\,\, \text{mod 1320}[/tex]
