Many interesting formulas can be given bijective proofs: count the elements of a set in two different ways, or show that there is a correspondence between two different sets to get an equality. Proofs of this type can give better insight than others into why some facts are true. We will discuss many examples, involving binomial coefficients, Fibonacci numbers, and a famous theorem of Fermat. http://www.math.uconn.edu/mathclub