From: couchot <couchot@localhost.localdomain>
Date: Tue, 30 Aug 2016 09:02:12 +0000 (+0200)
Subject: avant envoi christophe
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/16dcc.git/commitdiff_plain/0c607cc5762637d6a66776808212c498e88d061e

avant envoi christophe
---

diff --git a/hamilton.tex b/hamilton.tex
index b2c6e54..3c64cf6 100644
--- 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