Difference between revisions of "Casework"
m (fixed syntax for internal link) |
(→Videos) |
||
| (11 intermediate revisions by 6 users not shown) | |||
| Line 1: | Line 1: | ||
| − | '''Casework''' is | + | '''Casework''' is a [[counting]] approach that breaks a problem into two or more subproblems (the cases) and adding the result from each case together. While casework is sometimes the most elegant method of solution, it may be considered [[brute force]] when a more elegant solution exists. |
| + | == Videos == | ||
| + | * [https://artofproblemsolving.com/videos/counting/chapter2/186 AoPS Casework Counting Part 1] | ||
| + | * [https://artofproblemsolving.com/videos/counting/chapter2/187 AoPS Casework Counting Part 2] | ||
== Example Problems and Solutions == | == Example Problems and Solutions == | ||
| Line 6: | Line 9: | ||
* [[2006_AMC_12A_Problems/Problem_20 | 2006 AMC 12A Problem 20]] | * [[2006_AMC_12A_Problems/Problem_20 | 2006 AMC 12A Problem 20]] | ||
| + | * [[2005_AMC_10A_Problems/Problem_14 | 2005 AMC 10A Problem 14]] | ||
=== Intermediate === | === Intermediate === | ||
| − | * [ | + | * [https://artofproblemsolving.com/wiki/index.php/2004_AIME_II_Problems/Problem_2 2004 AIME 2 Problem 2] |
| − | * [ | + | * [https://artofproblemsolving.com/wiki/index.php/2004_AIME_II_Problems/Problem_4 2004 AIME 2 Problem 4] |
| − | * [ | + | * [https://artofproblemsolving.com/wiki/index.php/2005_AIME_I_Problems/Problem_5 2005 AIME 1 Problem 5] |
| − | * [ | + | * [https://artofproblemsolving.com/wiki/index.php/2000_AIME_I_Problems/Problem_5 2000 AIME 1 Problem 5] |
| + | == See also == | ||
| + | * [[Math books]] | ||
| − | + | [[Category:Combinatorics]] | |
| − | + | [[Category:Definition]] | |
| − | |||
| − | |||
Revision as of 19:22, 1 November 2020
Casework is a counting approach that breaks a problem into two or more subproblems (the cases) and adding the result from each case together. While casework is sometimes the most elegant method of solution, it may be considered brute force when a more elegant solution exists.
