fermat's little theorem and …

This document summarizes Fermat's little theorem and discusses primitive roots modulo n. It states that if p is a prime number, then for any integer a, ap-1 ≡ 1 (mod p). It then defines a primitive root modulo n as a number g such that g generates all numbers from 1 to n-1 when raised to successive powers modulo n. The document provides an example of a primitive root modulo 11 and discusses how primitive roots relate to permutations.