Constructive counting
Revision as of 16:36, 18 May 2021 by Etmetalakret (talk | contribs)
In combinatorics, Constructive counting is a counting method where one "constructs" a set to count it. This strategy is useful for complicated counting or combinatorics questions, as the problem can be broken down into cases, the number of possibilities in each case can be computed, and those numbers can be summed to find the final answer.
Examples
This video is a great introduction to permutations, combinations, and constructive counting: https://www.youtube.com/watch?v=t6a4uHEwQnM&t=1868s
See also
This article is a stub. Help us out by expanding it.
