math143A

Learning Center Schedule:

Handouts:

Assignments:

Section	Assigned Problems	Due Date
2	#1, 2, 3, 4, 5, 6, 9a; extra credit: #9b	9-14
3	#1, 2, 3, 4, 5, 6, 7	9-14
4	#1, 4, 6, 8, 11, 13	9-14
5	#2, 3, 6, 7, 8	9-14
6	#1de, 8, 10a, 11def, 12ab, 14	9-21
7	#1, 4, 6, 7, 9, 10, 14	9-21
8	#1, 4, 5, 7	9-21
9	#1, 2, 3, 5, 7	9-21
10	#1cdghij, 4, 5cdef	9-30
11	#1, 3, 5, 7, 12, 16b, 25a, 25c	9-30
11	Extra Credit: #18	9-30
13	#1, 3, 6-9, 13ac + Extra Credit (see handout)	10-7
14	#1-3, 5, 8, 9	10-7
15	#1-4, 6, 9, 11-13	10-7
16	#1, 2, 3, 7, 8, 27, 28; Extra credit: Sec. 16 #31	10-14
18	#1, 3, 5	10-14
19	#1, 3, 4, 5, 8, 11ab	10-14
20	#1, 2, 3, 4	11-2
21	#1, 4b, 8a, 8b, 8c, plus: #17: Prove by induction on n that for all natural numbers n, 2^0 + 2^ 1 + 2^2 + ... + 2^n = 2^(n+1) - 1	11-2
46	#1, 2, 3, 6, 9, 10, 12, 16	11-7
47	#1, 2, 3, 4, 5, 6, 8 Extra credit: Prove or disprove: There exists a graph G = (V, E) with \|V\| = 5 such that G has no 3-clique and the complement of G has no 3-clique.	11-7
48	#1, 6, 8, 9 Extra Credit: #7	11-14
49	#1, 6, 9 Extra Credit: #17	11-14
51	#1, 3, 4, 8, 13ab, 14	11-14
23	Function Homework Handout	11-30
28	#1ade (use definition of big-O); 2abcdef (justify each answer); 3, 5, 6	12-8
30	#5, 6b, 7, 9b, 12abc, 16, 17, 18, 20	12-8
31	#1abcdef, 13, 14, 15, 16	12-8

Tentative Schedule: