Difference between revisions of "Complementary counting"

Line 1: Line 1:
'''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. In problems that involve complex or overly complicated and tedious [[casework]], complementary counting is often a far easier and more efficient approach. Within a problem statement, a large hint that complementary counting may lead to a quick solution is the phrase "at least".
+
'''Complementary counting''' is a method of counting where one counts what they don't want, then subtracts that from the total number of possibilities. In problems that involve complex or overly complicated and tedious [[casework]], complementary counting is often a far easier and more efficient approach. Within a problem statement, a large hint that complementary counting may lead to a quick solution is the phrase "not" or "at least".
 +
 
 +
More formally, if <math>B</math> is a subset of <math>A</math>, complementary counting exploits the property that <math>|B| = |A| - |B'|</math>, where <math>B'</math> is the [[complement]] of <math>B</math>. In most instances, though, <math>A</math> is obvious from context.
  
  
 
==Video==
 
==Video==
 
+
This is a video explaining the basics of casework, complementary counting, and overcounting (more specifically, the [[Principle of Inclusion-Exclusion]]):
This is a video explaining the basics of casework, complementary counting, and overcounting (PIE):
 
 
https://youtu.be/Zhsb5lv6jCI
 
https://youtu.be/Zhsb5lv6jCI
  
Line 13: Line 14:
 
* [[2008 AMC 12B Problems/Problem 22 | 2008 AMC 12B Problem 22]]
 
* [[2008 AMC 12B Problems/Problem 22 | 2008 AMC 12B Problem 22]]
  
=== Somewhat Harder ===
+
=== Intermediate ===
 
* [[2004 AIME I Problems/Problem 15]]
 
* [[2004 AIME I Problems/Problem 15]]
  

Revision as of 12:53, 17 May 2021

Complementary counting is a method of counting where one counts what they don't want, then subtracts that from the total number of possibilities. In problems that involve complex or overly complicated and tedious casework, complementary counting is often a far easier and more efficient approach. Within a problem statement, a large hint that complementary counting may lead to a quick solution is the phrase "not" or "at least".

More formally, if $B$ is a subset of $A$, complementary counting exploits the property that $|B| = |A| - |B'|$, where $B'$ is the complement of $B$. In most instances, though, $A$ is obvious from context.


Video

This is a video explaining the basics of casework, complementary counting, and overcounting (more specifically, the Principle of Inclusion-Exclusion): https://youtu.be/Zhsb5lv6jCI

Examples

Introductory

Intermediate

See also