Application of Euler's and Fermat's little theorem

(NT-382) How can we prove that if gcd (n, 2660)=1, then 2660 | n^(36)-1
#numbertheory #euler #fermat #theorem #cipher

[@sabyasachi36]

🎉🎉🎉❤❤❤❤❤❤

[@cipherunity]

Thanks

[@qwertyman123]

good

[@cipherunity]

Thanks