Chapter 1
Chapter 1 Basic Math
Course: Ged Test Prep
Subject: Mathematics
Chapter: Chapter 2 Geometry
Counting
Counting techniques refer to methods used in combinatorial mathematics to determine the number of possible outcomes or arrangements in a set.
Common counting techniques include the fundamental principle of counting, permutations, combinations, and the binomial theorem.
The fundamental principle of counting states that if there are m ways to perform the first task and n ways to perform the second task, then there are m x n ways to perform both tasks.
Permutations are arrangements of objects where order matters, while combinations are selections of objects where order does not matter.
The binomial theorem gives a formula for finding the coefficients of terms in the expansion of binomials.
Examples
Fundamental principle of counting:
Permutations:
Combinations: