deletions | additions       diff --git a/bits3.tex b/bits3.tex  index d2a4765..44b3bcd 100644  --- a/bits3.tex  +++ b/bits3.tex 
...
We notice the following facts:  \begin{itemize}  \item performing the algorithm (a finite number of (seven  times) we get again the initial vector $(1,0,1)$ \item performing the algorithm above, we find all the strings of three bits with at least a nonzero entry.  %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}.