Difference between revisions of "Casework"

Line 1: Line 1:
 
+
In [[combinatorics]], '''casework''' is a [[counting]] method where one splits a problem into several parts, counts these cases individually, then adds together each part's total. While there are problems where casework produces the most elegant solution, in those where a shorter answer exists, casework may be considered [[brute force]].
'''Casework''' is a method of [[counting]] where one splits a problem into several parts, counts these parts individually, then adds together each case's total. While there are problems where casework produces the most elegant solution, in those where a shorter answer exists, casework may be considered [[brute force]].
 
  
 
== Videos ==
 
== Videos ==

Revision as of 15:39, 18 May 2021

In combinatorics, casework is a counting method where one splits a problem into several parts, counts these cases individually, then adds together each part's total. While there are problems where casework produces the most elegant solution, in those where a shorter answer exists, casework may be considered brute force.

Videos

Example Problems and Solutions

Introductory

Intermediate

See also