fix typo in Schnorr approx factor

src/lec03.tex

@@ -325,7 +325,7 @@ \section{The LLL Algorithm}
 (in~$n$), respectively. By choosing a value very close to~$1$, we can
 obtain an approximation factor of $(2/\sqrt{3})^{n}$ in polynomial
 time, but we cannot do any better using LLL.\@ We can get slightly
-better approximation factors of $2^{O(n(\log\log n)^2)/(\log n})$,
+better approximation factors of $2^{O(n(\log\log n)^2/\log n)}$,
 still in polynomial time, using Schnorr's
 generalization~\cite{DBLP:journals/tcs/Schnorr87} of LLL, where the
 analogue of the Lov{\'a}sz condition deals with blocks of $k \geq 2$