Finish lecture

week10/22-03-2022/22-03-2022.tex

@@ -0,0 +1,42 @@
+%        File: 20-01-2022.tex
+%     Created: 12:28:35 Thu, 20 Jan 2022 EST
+% Last Change: 12:28:35 Thu, 20 Jan 2022 EST
+%
+\documentclass[letterpaper]{article}
+\usepackage{amsmath}
+\usepackage{graphicx}
+\usepackage{cancel}
+\usepackage{amssymb}
+\usepackage{listings}
+\usepackage[shortlabels]{enumitem}
+\usepackage{soul}
+%\usepackage[smartEllipses,hashEnumerators,hybrid]{markdown}
+\usepackage{geometry}
+\usepackage{dirtytalk}
+\usepackage{mathtools}
+\usepackage{lplfitch}
+
+\geometry{portrait, margin=1in}
+
+%\begin{minted}[linenos,bgcolor=LightGray]{[language]}
+
+\date{03/15/2022}
+\title{%
+        Counting\\
+            \large MATH--190--01 : Discrete Mathematics for Computing}
+\author{Blizzard MacDougall}
+\begin{document}
+\maketitle
+\pagenumbering{arabic}
+\section{Basics of counting}
+If a task can be done either $n_1$ ways or $n_2$ ways, the number of the ways
+to do the task, then
+\begin{equation}
+    |n_1\cup n_2|=|n_1|+|n_2|-|n_1\cap n_2|
+\end{equation}
+
+\section{The Pidgeonhole Principle}
+
+If there are more objects than slots to hold them, some slot has to hold more than one object.
+
+\end{document}