0. Notes on Proofs.
Propositional Logic. Implication. Direct Proof. The Contrapositive. Proof by Contradiction. If And Only If.

1. Sets.
What Are Sets? New Sets from Old. Properties of Sets. A Paradox. Large Collection of Sets.

2. Functions and Relations.
Exponential and Log Functions. Floor and Ceiling Functions. Relations.

3. Boolean Algebra.
Propositional Logic. Sets. Boolean Algebras. Some Boolean Algebra Theorems. Switching Circuits.
Storing Numbers in a Digital Computer. Circuitry to Add.

4. Natural Numbers and Induction.
Well-ordering and Mathematical Induction. Well-ordering Implies Mathematical Induction. The Peano Axioms.

5. Number Theory.
The Division Theorem. Greatest Common Divisors. Primes. Modular Arithmetic. A Cryptological Example.
Modular Multiplication and Division. More Cryptology. Fermat\'s Little Theorem. Fast Exponentiation. Euler\'s Theorem. RSA Encryption.

6. Recursion.
Binary Search. Euclid\'s Algorithm. Tower of Hanoi.

7. Solving Recurrences.
8. Counting.
The Rules of Sum and Product. Permutations. Combinations. Calculation Considerations.
The Binomial Theorem. Applications of Counting to Probability.

9. Matrices.
Matrix Operations. Systems of Equations. The Determinant. Gaussian Elimination.
Computing Multiplicative Inverses. Encryption Revisited.

10. Graphs.
Euler Circuits and Tours. Symbols and Terms for Graphs. A Return to Euler Circuits.
Minimal Spanning Tree. Some Programming Considerations.

Solutions.
Index.