Things:

Notes from the 2012 Canada/USA Mathcamp:

Proof Techniques:

Lecture 1: The art and technique of proof.
Lecture 2: Working with axioms.
Lecture 3: The sizes of infinity.
Lecture 4: Proof techniques.
Homework sets: 1, 2, 3, 4.

Latin Squares:

Lecture 1: An introduction to Latin squares.
Lecture 2: Mutually orthogonal Latin squares and finite fields.
Lecture 3: Latin squares and groups.
Lecture 4: Latin squares and geometry.
Lecture 5: Latin squares and magic squares.
Lecture 6: Latin squares and the n-queens problem.
Lecture 7: Latin squares and error-correcting codes, part 1/2.
Lecture 8: Latin squares and error-correcting codes, part 2/2.
Homework sets: 1, 2, 3, 4, 5, 6, 7, 8, 9.

Many Campers Sort Piles:

Lecture 1: An introduction to algorithms.
Lecture 3: The use of randomness in algorithm design.
Lecture 5: A field guide to sorting algorithms.
Homework sets: 1, 2, 3, 4.

Random and Quasirandom Graphs:

Lecture 1: Background on probability, spectral graph theory, and o(n) notation.
Lecture 2: Properties of random graphs.
Lecture 3: Quasirandom graphs: definitions, and some proof.
Lecture 4: Quasirandom graphs: examples, 1/2.
Lecture 5: Quasirandom graphs: examples, 2/2.
Homework sets: 1, 2, 3, 4.

The Only Random Graph:

Lecture 1: The only random graph.

A Quick Guide to Malbolge:

Lecture 1: A quick guide to Malbolge.

The Unit Distance Graph and the Axiom of Choice:

Lecture 1: The Unit Distance Graph and the Axiom of Choice.