Logic:
	-Proving logical formulas  are equivalent: both by truth tables and logical equivalences
	-Translating from English to logic, and logic to English
	-De Morgan's law for negation
	-Quantifiers, order, negation
	-Translating to and from English with quantifiers and negation of quantifiers
	-Boolean functions
Proofs:
	-Contradiction, contrapositive
	-Proof by cases
	-Prove a collection of statements are equivalent
	-Know how to prove things rigorously
Sets:
	-Set operations: union, intersection, complement, set minus, cartesian product (tuples), power set
	-Set relations: element of, subset of, equality
	-Know how to prove two sets are the same
	-De Morgan's law for sets
	-'Sigma' notation with sets
	-Cardinality (no infinite cardinality, but you should know the definition and be able to find it for finite sets)
Functions:
	-How a function is defined: domain, codomain, and the mapping
	-Function composition
	-Injection, Surjection, Bijection - you should be able to prove or disprove a function is any of these, and give examples
Sequences and Series:
	-Find formulas that generate a sequence by looking for a pattern
	-Know the geometric series (partial sum version and infinite sum version)
	-Know the difference between a sequence and a series
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 3
	-Find a closed form formula for a recursive definition using the method of expansion and induction
	-Prove recursive definitions are true using induction

Number Theory:
	-Definition of mod, divides
	-GCD, LCM, relatively prime
	-Definition of prime, prime factorization
	-Euclidean Algorithm
	-Euler Phi-function
	-Modular Inverses: when do they exist, and how do we find them
	-Solve linear congruences: modular exponentiation (Fermat's little theorem) and linear equations
	-RSA: understand why it works, and how to use the algorithm with reasonable numbers
Combinatorics:
	-Combinations, permutations, reptition, no repitition: definitions, when to use them, formulas
	-Counting functions from one set to another
	-Pigeonhole principle
	-Word problems
	-Binomial coefficients and the binomial theorem
Probability:
	-Definition: a sample space, probability distribution over that sample space, random variables
	-Expected value and variance, rules about linearity
	-The basic distributions covered in class
	-Conditional probability
	-Independence of events, random variables
	-Finding probabilities by counting
Relations:
	-Definition of a relation on a set
	-Types of relations: symmetric, antisymmetric, transitive, reflexive
	-Examples: be able to think of them and work with them