Commit outstanding

discrete-math.tex

@@ -173,6 +173,11 @@ \section{Combinatorics}
   \red{TODO}
 \end{proof}
 
+\begin{claim}
+  Consider the assignment of $n$ items $x_1, x_2, \ldots, x_n$ to $k$ buckets. Define $S_i$ to be the sum of items assigned to bucket $i$. The assignments for which $\max_i S_i$ is minimized is the assignment for which $\var S_i$ is minimized.
+\end{claim}
+
+Not true?
 
 \begin{theorem*}[Identities]~\\
   \begin{align*}

linear-algebra.tex

@@ -1594,11 +1594,12 @@ \subsubsection{3. Find the matrix product $V^{-1}AV$
 \\\\
 &=
 \frac{1}{\sqrt5}
-\matMMxNN{\varphi}{0}
-         {0}{-\psi}
+\matMMxNN{2 + \varphi}{0}
+         {0}{-(2+\psi)}
 \end{align*}
 
-Where we have used $\varphi\psi = 1$, and $\varphi^2 = 1 + \varphi$, and $\psi^2 = 1 + \psi$.
+Where we have used $\varphi\psi = -1$, and $\varphi^2 = 1 + \varphi$, and $\psi^2 = 1 + \psi$.
+