Definition 2.1.5 (Complete Sct of RESiMWES). We call a subset it CZ of size n whose reductions M6GHIO n are pairwise distinct. a COMPLETE set of FESMUS HOAUIG| n. In other words, « GOMPIEE sct of FSIGUES|is @ choice of representative for each equivalence class in Z/n For example R= {0,12....0- 1} js 0 GOMPIC set of FSIS MOUHG n. When n = js a BOMIpIEEE set of Hesidhies, Lemma 2.1.6. Jf Ris « BONG set of FESS WOU ond a € Z with ged(a,n) = 1, then aR = fax: 2 © R) is @IS@ a BOOMpIEWE set of FESCHES, ‘radulo 1. Proof. fax = ax" (mod n) with 2,2’ € R, then Proposition 2.1.4 implies that «=r (mod n). Because R is a SBEiDpIGG sct of EESGHES, this implies that © = 2’. Thus the elements of a? have distinct reduetions [GHG n. Tt R= {0,1,-1,2,-2} follows, since #ak =n, that aR is a SOPIGE sct of BATS) GME nC} Proposition 2.1.4 (Cancellation). If ged(c,n) = 1 and we = be (mod n), then a = b (mod n) Proof. By definition n| ac be Since ged(m,c) = 1, it follows from Theorem 1.1.5 that n |a—b, so «= (mod n), as claimed, a Theorem 1.1.5 (Fundamental Theorem of Arithmetic). Every nat- ural number can be written as a product of primes uniquely up to order. Note that primes are the products with only one factor and 1 is the empty product