deletions | additions       diff --git a/bits1.tex b/bits1.tex  index b135fc4..29f348c 100644  --- a/bits1.tex  +++ b/bits1.tex 
...
We claim that this holds also for bits, as for example  $$ 0+1\,=\,1+0\,=\,1 \,. $$  We leave to the reader the verification of this statement for each $a,b \in \Fb$.\\  Again, we We  can formalize this property by saying that both the sum in $\ZZ$ and the sum in $\Fb$ are \emph{commutative} operations. In a more general setting, a sum operation on a set is called commutative if for any $a,b$ in  that set we have  $$ a+b\,=\,b+a\,.$$ 
...
\smallskip  Consider now $2,3 \in \ZZ$. We know that $2\cdot 3=3\cdot 2=6$ and this holds for every couple pair  of integer numbers. But this is again true also integers.   We claim the same for  for bits, since  for example $$0\cdot 1=1\cdot 0=1.$$ $$ 0\cdot 1\,=\,1\cdot 0\,=\,1\,.$$  We leave, as an exercise to the reader, to verify that it is true this  for each $a,b \in \Fb$.\\ This Again, this  property can be formalized by saying that both the product in $\ZZ$ and the product in $\Fb$ are \emph{commutative}. In formulas, we say that $\forall a,b$ (which are elements of $\ZZ$ or of $\Fb$), we have $$a\cdot b=b\cdot a.$$  \smallskip