Topics for Test 2:
------------------

Induction:
	- Be able to perform inductive proofs
	- Know the difference between weak and strong induction

Recursive Definitions:
	- Know how to recursively define: a set, a function, a sequence, and know the difference between these three
	- Prove recursive definitions are true using induction

Number Theory:
	- Definition of mod, divides
	- GCD, LCM, relatively prime
	- Definition of prime, prime factorization
	- Euclidean Algorithm
	- Modular Inverses: when do they exist, and how do we find them
	- Solve linear congruences
	- RSA: understand why it works, and how to use the algorithm with reasonable numbers

Combinatorics:
	- Combinations, permutations, repetition, no repetition: definitions, when to use them, formulas
	- Counting functions from one set to another
	- Word problems
	- Binomial coefficients and the binomial theorem