Tag: Modular arithmetic

• Congruences and Fermat's Little Theorem: Computing in a World of RemaindersCongruence as an equivalence relation, the ring Z/nZ and its group of units, proofs of Fermat and Euler theorems, and the correctness of RSA via the Chinese remainder theorem.MathematicsNumber TheoryUndergraduateCongruencesModular arithmeticFermat's little theoremEuler's totientRSA~6 min