Difference between revisions of "Complementary counting"
Mathgeek2006 (talk | contribs) (→Introductory) |
Expilncalc (talk | contribs) (Added another problem which contains this technique) |
||
| Line 7: | Line 7: | ||
* [[2002 AIME I Problems/Problem 1 | 2002 AIME I Problem 1]] | * [[2002 AIME I Problems/Problem 1 | 2002 AIME I Problem 1]] | ||
* [[2008 AMC 12B Problems/Problem 22 | 2008 AMC 12B Problem 22]] | * [[2008 AMC 12B Problems/Problem 22 | 2008 AMC 12B Problem 22]] | ||
| + | |||
| + | === Somewhat Harder === | ||
| + | * [[2004_AIME_I_Problems/Problem_15]] | ||
=== See also === | === See also === | ||
Revision as of 20:53, 28 February 2017
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".
