Prove theorem The Composition Of Permutations Is A Permutation). As some reminders, you may use the following facts that you proved in either Math 301 or Math 340. You may use these facts without proof.

1. The composition of two injective functions is injective.
2. The composition of two surjective functions is surjective.
3. A function is a bijection if it is both injective (1 to 1) and surjective (onto). Hence, the composition of two bijective functions is a bijection.
4. You might find induction helps you get from a composition of two bijective functions is bijective to the composition of $n$ bijective functions is bijective.

• Make remarks with a list.

problem.the_composition_of_permutations_is_a_permutation.tex

%%%%%
% DEPENDENCIES
% RequiredPackages: \usepackage{tikz}
% RequiredMacros: \DeclareMathOperator{\aut}{Aut} 
%%%%%
\begin{problem}
Prove theorem [[Theorem:The Composition Of Permutations Is A Permutation]]).  
As some reminders, you may use the following facts that you proved in either Math 301 or Math 340. You may use these facts without proof.  
\begin{enumerate}
\item The composition of two injective functions is injective.
\item The composition of two surjective functions is surjective.
\item A function is a bijection if it is both injective (1 to 1) and surjective (onto). Hence, the composition of two bijective functions is a bijection. 
\end{enumerate}
  - You might find induction helps you get from a composition of two bijective functions is bijective to the composition of $n$ bijective functions is bijective. 
\end{problem}

• Dihedral group

problem ben