Set edits

Advanced/Size of Sets/main.tex

@@ -1,13 +1,13 @@
 % use [nosolutions] flag to hide solutions.
 % use [solutions] flag to show solutions.
 \documentclass[
-	solutions,
+	nosolutions,
 	singlenumbering
 ]{../../resources/ormc_handout}
 
 \uptitlel{Advanced 1}
 \uptitler{Summer 2023}
-\title{The Size of Sets, Part 1}
+\title{The Size of Sets}
 \subtitle{Prepared by Mark on \today{}}
 
 \begin{document}
@@ -19,7 +19,8 @@
 	\input{parts/2 cartesian.tex}
 	\input{parts/3 functions.tex}
 	\input{parts/4 enumeration.tex}
-	\input{parts/dense.tex}
+	%\input{parts/5 dense.tex}
+	\input{parts/6 uncountable.tex}
 
 
 	%\vfill
@@ -36,14 +37,6 @@
 	%	$(a, b) = \{ \{a\}, \{a, b\}\}$
 	%\end{solution}
 
-	%\vfill
-
-	%\problem{}
-	%Let $R$ be the set of all sets that do not contain themselves. \par
-	%Does $R$ exist? \par
-	%\hint{If $R$ exists, do we get a contradiction?}
-	%\vfill
-
 	%\problem{}
 	%Suppose $f: A \to B$ and $g: B \to C$ are both one-to-one. Must $h(x) = g(f(x))$ be one-to-one? \par
 	%Provide a proof or a counterexample.