Complementary counting

Revision as of 16:51, 10 August 2010 by Mathgeek2006 (talk | contribs) (Introductory)

Complementary counting is counting the complement of the set we want to count, and subtracting that from the total number of possibilities, or the universal set for that particular problem. A big hint that complementary counting may lead to a quick solution is the phrase "at least".


Examples

Introductory

See also

Invalid username
Login to AoPS