deletions | additions       diff --git a/bits4.tex b/bits4.tex  index 2f902a3..250820b 100644  --- a/bits4.tex  +++ b/bits4.tex 
...
Verify that the function $p(x,y,z)$ returns the parity bit.  \end{Exercise}  \begin{Example} \label{Prodotto1}  We are interested in a function that returns $1$ if a vector of bits is null, $0$ otherwise.  This is a useful Boolean function, since it recognizes if a vector of bits is the null vector $(0,\ldots,0)$. \\  We now show how to obtain a polynomial representing this function. We observed in Exercise \ref{XorIsNice} that the multiplication of bits has the same truth table of the $\AND$ operator. In particular we have $1$ if each bit is $1$, $0$ otherwise. This is the opposite of what we want and so we can add $1$ to have the sought-after function (see Exercise \ref{Not}). For example, if $n=3$ the function in $\Fb[x,y,z]$ is $$(x,y,z) \mapsto xyz+1.$$ 
...
\end{Theorem}  \begin{Example}\label{ExMorevar}  Consider As regards  the function of Example \ref{Prodotto1}, i.e. the function returning $1$ if a vector of bits is $1$ and $0$ otherwise, we can see that if we consider, for example, vectors of $4$ bits, it can be represented by the function  $$f: (\Fb)^4 \rightarrow \Fb $$  $$(x_1,x_2,x_3,x_4)\mapsto x_1x_2x_3x_4 +1. $$  \end{Example}