RUME 13
2010
Raleigh, North Carolina
Counting Two Ways: The Art of Combinatorial Proof
Page: -1
Combinatorial proofs are used to show that many interesting identities hold. Typically, after examining an identity, one poses a counting question and proceeds to answer it in two different ways. This poses a challenge for students as it requires a way of thinking other than they have traditionally encountered. The newly introduced proof technique requires students to either create new strategies or adapt their old strategies to write such proofs. We will discuss the results of a preliminary study on the combinatorial proofs written by students in an upper-division combinatorics course and a graduate-level discrete mathematics course. In particular, we will identify some common difficulties that students have and suggest ways to overcome them.