In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which van Lint & Wilson (2001) call “one of the most important tools in combinatorics,” one describes a finite set X from two perspectives leading to two distinct expressions for the size of the set. Since both expressions equal the size of the same set, they equal each other.
Famous quotes containing the words double and/or counting:
“Hollywood held this double lure for me, tremendous sums of money for work that required no more effort than a game of pinochle.”
—Ben Hecht (1893–1964)
“But counting up to two
Is harder to do....”
—Philip Larkin (1922–1986)