Abstract Algebra: Theory and Applications · Problem 6.7.3

Introduction to Cryptography — Thomas Judson

Mathematics — Abstract Algebra · group-of-units-computational

Problem

Verify that the group of units mod nn has order n−1n-1 when nn is prime, again for all primes between 100 and 1000. As before, your output should be simply True, just once, indicating that the statement about the order is true for all the primes examined. As before, build up your solution slowly, and with a smaller range of primes in the beginning. Express your answer as a single line of Sage code.

Related theory

Browse the problem library