· For Tuesday, Sept. 20: Section 2.1, problems 1, 3, 7, 9, 11, 13, 16(a,e), 17(a), 19.
· For Wednesday, Sept. 21: Section 2.2, problems 1, 3, 11, 15, 18, 20 and Section 2.3, problems 12, 14, 18, 40(a,b), 43 .
· For Thursday, Sept. 22: Section 3.1, problems 4, 7, 11, 19, 25, 29, 31, 34, 36, 41, 43, 54, 56.
· For Friday, Sept. 23: Section 3.2, problems 3, 6, 12, 15, 19, 30 .
· For Tuesday, Sept. 27: Section 3.3, problems 12, 17, 24, 25, 34(a), 37(a) and
Section 3.4, problems 3, 5, 7, 13, 36, 38.
· For Thursday, Sept. 29: Section 3.5, problems 2-4, 8, 9, 14, 17, 21, 23, 26.
· For Monday, Oct. 3: Section 3.6, problems 1, 5, 8(b), 17, 27.
· For Tuesday, Oct. 4: Section 4.1, problems 3,5,12,14,20,27,35,46,52,58,62,63,65.
· For Thursday, Oct. 6: Section 4.2, problems 1, 6, 8, 10, 13, 16, 19, 21, 24, 27, 29.
· For Monday, Oct. 10: Section 4.3, problems 2, 4, 8, 11, 13, 14, 16, 23, 24, 29, 31.
· For Thursday, Oct. 13: Section 4.4, problems 2, 4, 7
and Section 4.5, problems 1-4, 6-8 and the following exercise:
“Use the Euclidian algorithm to compute gcd(500,112) and gcd(315,84)”.
· For Tuesday, Oct. 18: Section 11.1, problems 3, 16, 25, 26, 28, 14 (optional), 45 (optional), 46 (optional).
· For Friday, Oct. 21: Section 5.1, problems 1, 3, 10, 12, 14, 19, 21, 22, 26(a, b, c).
· For Monday, Oct. 24: Section 6.1, problems 2, 7-13, 21, 23, 26, 28, 31.
· For Tuesday, Oct. 25: Section 6.2, problems 1, 3, 4, 6, 10, 11(a,b,c), 14, 16, 19(a,b,c), 23-25 .
· For Friday, Oct. 28: Section 6.3, problems 1, 5, 6, 8, 9, 11, 21, 26, 28.
· For Monday, Oct. 31: Section 6.4, problems 4-7, 10, 13, 15, 17.
· For Tuesday, Nov. 1: Section 6.5, problems 1, 3, 5, 8-10, 16,
and the following problem:
“Write a program that will output all
4-combinations of the following set:
{
· For Tuesday, Nov. 8: Section 9.2, problems 22, 31, 42, 43, 54, 56.
·
For Monday, Nov. 14: Section 9.3, problems 2, 4, 6, 8, 9, 11, 14, 17 and
Section 9.4, problems 13, 18, 19, 20, 25, 26.