# Math 111, Spring 2016

- Homework 1:
- Chapter 1: 1, 2, 4, 6, 9, 25, 26, 30, 31, 32

- Homework 2:
- Chapter 1: 18, 23, 33-39
- Chapter 2: 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 23, 25, 26 27
- Complete proof in class (which used Fibonacci sequences) that the Euclid algorithm to find gcd(a,b) for integers a,b, with a \geq b, terminates in at most
A log_2(b) steps for some constant A (that is independent of b).

- Homework 3:
- Chapter 3: 4, 5, 6, 7, 8, 9, 11, 12,13, 14, 15, 17, 18, 19, 20, 21, 23, 24, 25, 26

- Practice Midterm

- Homework 4:
- Chapter 4, due 5/9: 1, 3, 5, 6,7, 8, 11, 16, 18, 22, 23, 24

- Supplementary Course Notes

- Homework 5, due 5/9:
- Chapter 4: 2, 4, 9, 10, 12, 17, 19, 22

- Homework 6, due 5/16
- Chapter 5: 1-15

- Homework 7, due 5/23
- Chapter 5: 16, 17, 18, 19, 20, 21, 22, 26, 27, 28, 33, 34, 35

- Homework 8, due 5/30:
- From the book by Dudley:
- Section 19: 5, 6, 7,8
- Chapter 20: 1, 2, 5, 7, 8, 9, 10