deletions | additions       diff --git a/bits4.tex b/bits4.tex  index ef48b0f..bbfd739 100644  --- a/bits4.tex  +++ b/bits4.tex 
...
Verify the above statement, by evaluating $f$ at all $3$-tuples of bits.  \end{Exercise}  In general, it holds We conclude this section with  the following most general formulation of the Absolute Normal Form Theorem.  \begin{Theorem}[Absolute Normal Form Theorem]  Any Boolean function   $$f: (\Fb)^n \rightarrow (\Fb)$$  with $n\in \NN$, can be written as the sum of all the \emph{squarefree monomials} of degree from $0$ to $n$ with coefficients in $\Fb$ i.e.,  $$f(x,y,z)=a_0+a_1x_1+...+a_n $$f(x_1,...,x_n)=a_0+a_1x_1+...+a_n  x_n+a_{n+1}x_1x_2+...+a_dx_1x_2...x_n.$$ \end{Theorem}  \begin{Example}\label{ExMorevar}  Consider the   \end{Example}