Homework will be due on Wednesdays at the beginning of class.

If you have questions, you can contact me using email: sands@cems.uvm.edu

In addition to the problems from the text listed below, there will sometimes be extra problems handed out.

 #  Due            Assignment             Comments

1	(Sept. 8) Sept. 15	(Writing Assignment) p. 8 # 2,6,10,14,16,22,23	(Explain trick using Fermat's Little Theorem) 1.2 Integers and the Division Algorithm
2	Sept. 22 (Sept. 27)	p. 8 #  12, 17, 18, 19, 21, 30 (Writing assignment from class)	1.2 Euclidean Algorithm  Sample solution to #17 1.4 Practice writing proofs and counterexamples.
3	Sept. 29	p. 21 # 2,4,6,8,10,14,17 Additional problems	1.5 Logic
4	Oct. 6	Problem sheet	Set theory Solutions
5	Oct. 20	p. 29 # 1,2,3,6,8,10,11,16 p. 29 #  12,14, 15	1.6 Relations (Test to here on Oct. 13) Solutions 1.6 Functions Solutions
6	Oct. 27	p. 47 # 2, 11, 17, 19 p. 52 #  2, 3, 4	2.1 Induction Template for proof by induction.  Sol. to  17 2.2 Recursion Solution to 4b
7	(Oct. 29)   Nov. 3	(Writing Assignment) p. 63 # 5cd, 17, 19ad p. 68 #5,6,7,9,11 p. 47 #17	Explaining Sandzini Trick 3.1 Extended Euclidean Algorithm 3.2 Modular Arithmetic  (Solutions)
8	Nov. 17  (Nov. 12)	p. 72 # 2, 6, 9, 10 (Optional Writing Assignment)	(Test on 11/10/10)  3.3 Properties of Modular Arithmetic (Sketch of Solutions) Explaining Trick
9	Dec. 1	Problem sheet	3.4 Euler Phi Function and Chinese Remainder Theorem (Solutions)
10	Nov. 19-Dec. 8	Class presentations	.
	Dec. 14	Final Exam at 7:30 AM	.