Eulers Theorem
- Tags
- math
States that given \( n \) being a positive integer and \( a \) being an integer that is relatively prime to \( n \) then: \[ a^{\Phi(n)} \equiv 1 \mod n \] where \( \Phi(n) \) is the eulers totient function.
States that given \( n \) being a positive integer and \( a \) being an integer that is relatively prime to \( n \) then: \[ a^{\Phi(n)} \equiv 1 \mod n \] where \( \Phi(n) \) is the eulers totient function.