MAT 111 Module 9: Counting: Permutations and Combinations
Loading...
Date
2023-04-22
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This module introduces develops techniques of determining, without direct enumeration, the number of elements in a set, or the number of possible outcomes of an event. Such counting includes the study of permutations and combinations.
In this module, you will be introduced to the following concepts:
\begin{itemize}
\item Basic counting principles,
\item The binomial theorem and Pascal's triangle,
\item Permutations and combinations,
\item The Pigeonhole principle and its applications.
\end{itemize}
Description
This module introduces develops techniques of determining, without direct enumeration, the number of elements in a set, or the number of possible outcomes of an event. Such counting includes the study of permutations and combinations.
In this module, you will be introduced to the following concepts:
\begin{itemize}
\item Basic counting principles,
\item The binomial theorem and Pascal's triangle,
\item Permutations and combinations,
\item The Pigeonhole principle and its applications.
\end{itemize}