Below the table is a listing of homework that will be collected.

DateSectionHomeworksClassworkChallengeAssigned Reading
9/20/059. Equivalence relations1, 3, 5, 7, 9, 10, 14, 18, 192, 4, 7b, 13, 19b, 216, 8, 15, 22Section 10
9/22/0510. Congruence1, 2, 5, 7,  11, 13-17, 19, 20, 25, 263, 4, 6, 8, 12 18, 22-24, 27, 29Section 11
9/27/05Applications of congruence
(By Dr. Shipman)
   Sections 12
9/29/05
Problem session Sept 29, 05.pdf
Correction 9.8b
natural numbers not multiples of 10
11. Integers modulo n12. The Euclidean Algorithm Section 11. # 1-10, 13-16Section 12. # 1-11, 15Section 12. 1, 5Section 11. #18Section 12. # 16-21Section 13Section 14
10/04/0514. Groups. Elementary Properties1-7, 11, 12, 14, 15, 18, 20, 21, 23-27, 34 28, 29, 33, 35Section 15
10/06/05
Problem session Oct 6, 2005.pdf
Cyclic groups    
10/11/0515. Direct Products7, 8, 9 , 11, 12, 13, 17, 18, 19, 21, 22 25 
10/13/05
Problem session Oct 13, 2005.pdf
Review Test # 2
Sections 9-15
    
10/18/05Test # 2    

Homework that will be collected

HomeworkDate AssignedDate DueHints
page 57 # 9.189/20/059/27/05 
page 61 # 10.16, 10.209/22/059/29/05For #16: use the suggestion in the book; it is straightforward.
page 69 #12.159/29/0510/06/05 
page 80 # 14.25, 14.3410/06/0510/13/05For # 25, notice that this is an “if and only if” statement, so you must proof both directions.For # 34, start by taking and element a in the group G and form the subgroup generated by a.