Euler's Theorem proof and applications

preview_player
Показать описание
If a and n are coprime then a^(φ(n)) ≡ 1 (mod n)
where φ(n) is Euler's totient function ( which counts the number of positive integers less than n that are relatively prime to n)
Рекомендации по теме