diff --git a/Lectures/L33_WhiteBoxTestingContinued/WhiteBoxTestingContinued.tex b/Lectures/L33_WhiteBoxTestingContinued/WhiteBoxTestingContinued.tex
index 6562318ce7a4d996189ce92e9c60f3719779a264..39f7628b29282e7c043fecbc310066f3c792908c 100755
--- a/Lectures/L33_WhiteBoxTestingContinued/WhiteBoxTestingContinued.tex
+++ b/Lectures/L33_WhiteBoxTestingContinued/WhiteBoxTestingContinued.tex
@@ -174,7 +174,7 @@ TBD
 
 \begin{itemize}
 \item Desire a test set $T$ that is a finite subset of $D$ that will uncover all errors
-\item Determining and ideal $T$ leads to several
+\item Determining an ideal $T$ leads to several
   \href{https://en.wikipedia.org/wiki/Undecidable_problem}{undecideable
     problems}
 \item No algorithm exists: