deletions | additions       diff --git a/bits1.tex b/bits1.tex  index 82679d5..f51bbdc 100644  --- a/bits1.tex  +++ b/bits1.tex 
...
$$ 0+1\,=\,1+0\,=\,1 \,. $$  We leave to the reader the verification of this statement for each $a,b \in \Fb$.\\  This property can be formalized 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  Now we examine the behaviour of take a close look at  $0 \in \ZZ$. Taken Considering  anyother  integernumber  $a$, we have that $a+0=0+a=a$, as  for example $3+0=0+3=3$, so $3+0=0+3=3$. In other words,  summing a number with zero gives, as result, again that number. leaves the number unchanged (and this happens \emph{only} for $0$).  \\  Also the bit The same happens with  $0 \in \Fb$,has the same behaviour,  since in $\Fb$  $0+0=0$ and $0+1=1+0=1.$\\  We can formalize this statement by saying $0+1=1+0=1$.\\  In a general setting, if we have a sum operation with a special element $e$ such that  $a+e=e+a=a$ for any $a$ in the set, then we say  that $0$ $e$  is the \emph{neutral element} of the sum, both operation.\\  Therefore, we can say that $0\in \Fb$ is the neutral element of the sum  in $\ZZ$ and $\Fb$, while $0\in\ZZ$   is the neutral element  in $\Fb$. $ZZ$.  \\  \smallskip