Proving Binomial Identities

James Rickards

12:00, Friday, November 1
BURN 1025



Couting the size of a set in different ways allows for slick proofs of otherwise difficult identities. However, given the identity to prove, coming up with the correct set to count can be equally as hard. In this talk we will present various identities involving binomial coefficients, and motivate the construction of the sets that they count.

All graduate students are invited. As with all talks in the graduate student seminar, this talk will be accessible to all graduate students in math and stats.

This seminar was made possible by funding from the McGill mathematics and statistics department and PGSS.

back