**Policies:** No books, calculators or computers allowed on
the exam. **One page (one sided) of handwritten notes allowed
on the exams.**

Exam questions are similar to homework questions, but doable in shorter amount of time. Best way to study is to do the homework and then do as many other problems in the covered sections as possible.

Material covered:

Chapter 4:

4.1 Divisibility and Modular Arithmetic

4.2 Integer Representations and Algorithms

4.3 Primes and Greatest Common Divisors

4.4 Solving Congruences

4.5 Applications of Congruences

Chapter 5:

5.1 Mathematical Induction

5.2 Strong Induction and Well-Ordering

5.3 Recursive Definitions and Structural Induction

5.4 Recursive Algorithms

5.5 Program Correctness

Chapter 6:

6.1 The Basics of Counting

6.2 The Pigeonhole Principle

6.3 Permutations and Combinations

6.4 Binomial Coeficients and Identities

6.5 Generalized Permutations and Combinations

Chapter 7:

7.1 An Introduction to Discrete Probability