deletions | additions       diff --git a/bits3.tex b/bits3.tex  index 16c35d3..9021afd 100644  --- a/bits3.tex  +++ b/bits3.tex 
...
We notice the following facts:  \begin{itemize}  \item performing the algorithm a (a  finite number of times times)  we get again the initial vector $(1,0,1)$ \item only the numbers $1,2,3,4,5,6,7$ can be written using three bits not all zero and, performing the algorithm, we found all these numbers. This is not true in general. The feedback polynomials for which this property holds is called \emph{primitive}.  \end{itemize}  \begin{Example}  We see now an example of non primitive non-primitive  polynomial. Let us consider $f=x^3+1$ and we start again from $(1,0,1)$, and we perform the algorithm \begin{center}  \begin{tabular}{ |c || c | c | c |}  \hline