Homework 1, 05/21
Section 2.1: #2, 3, 5, 6, 7, 8
Section 2.2: #5, 10

Homework 2, 05/19
Section 2.3: #3,4,5,6,8,10
Section 2.4: Factor 227981 and 243936
Section 2.5: #3,5,7

Homework 3, 05/28
Section 2.5:

• #1(a,b) Do the following:

               (i)  Find GCD and LCM using prime decompositions:
                      781=(11)(71),   994=(2)(7)(11)
                      5950=(2)(5)(5)(7)(17), 13300=(2)(2)(5)(5)(7)(19)
               (ii) Find GCD using the Euclidean algorithm
               (iii) Find x, y such that ax+by=(a,b)
• #8
• #12, do the following:

                Prove that (6n-1,6n+1)=1, (6n-1,6n+3)=1
• Prove Proposition 2.5.15 on page 42
• Show that if a prime p does not divide a, then (p,a)=1
• Prove that    (3a,3b) = 3(a,b)

Homework 4, 06/02
Section 3.1:  1, 2, 3, 5, 7, 8, 12

Homework 5, 06/04
Section 3.2: #1, 2, 3, 4, 5, 6, 8
Section 3.3: #1

Homework 6, 06/11
Section 3.3: #2, For 4, 5, process the congruences so that the moduli are pairwise relatively prime.
Section 3.4: #2(a), Exercise on Page 83, #5

Homework 7, 06/16
Section 4.1: #1-6
Section 4.2: #1

Homework 8, 06/18
Section 4.3: #1,3,5,8