avant envoi christophe

diff --git a/hamilton.tex b/hamilton.tex
index b2c6e54f20363f788ccc99a530be58f74bbb40f2..3c64cf6cd11f40161cabba3433fd5c5d9e502ec5 100644 (file)
--- a/hamilton.tex
+++ b/hamilton.tex
@@ -62,7 +62,7 @@ What follows shows that this fact is established and first recalls the approach.
 Let be given a $\mathsf{N}-2$-bit Gray code whose transition sequence is
 $S_{\mathsf{N}-2}$. What follows is the 
  \emph{Robinson-Cohn extension} method~\cite{ZanSup04}
-which produces a $n$-bits Gray code.
+which produces a $\mathsf{N}$-bits Gray code.
 
 \begin{enumerate}
 \item \label{item:nondet}Let $l$ be an even positive integer. Find