Double counting establishes an identity by computing the cardinality of the same finite set in two ways. The useful step is to identify exactly what the members of that collection are; an algebraic equality then records two legitimate ways to organize them.
Take the ordered pairs where is a -element subset of an -element set and is marked. Choosing first gives pairs. Choosing first leaves members to choose from the other , giving . Hence
For five people and two-person teams, both counts give : ten teams with two choices of a marked member, or five choices of that member with four choices of a teammate. The identity is explained by the bijection between these descriptions, rather than merely verified through factorials.

There are no discussions about this article yet.

Articles by others on the same topic (NaN)

Double counting is a combinatorial proof technique used to show that two different expressions count the same quantity. The idea is to count the same set or scenario in two distinct ways. If both methods give the same total, it can help establish identities or combinatorial equalities. ### Steps in Double Counting: 1. **Identify the Set**: Choose a specific set or mathematical object that can be counted in two different ways.