Michela Ceria edited bits3.tex  over 7 years ago

Commit id: 8e05944ea5134b556fb678f8769e9060e8ab3354

deletions | additions      

       

\end{center}  We notice the following facts:  \begin{enumerate}  \item[\label{fact-a}] \begin{enumerate}[label=\textnormal{(\arabic*)}]  \item  After having performed the above algorithm seven times, we get again the initial vector $(1,0,1)$. \item[\label{fact-b}] \label{fact-a}   \item  While performing the above algorithm, we find all seven nonzero $3$-bit strings. strings \label{fact-b}  %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.   \end{enumerate}  %