this is for holding javascript data
Massimiliano Sala edited bits1.tex
over 7 years ago
Commit id: b1f711d907fab6256c367242c02669e5d611b659
deletions | additions
diff --git a/bits1.tex b/bits1.tex
index e48713c..2f61b85 100644
--- a/bits1.tex
+++ b/bits1.tex
...
%From the rules of the sum of bits, we can derive how to compute \emph{mul% tiples} of bits.\\
\begin{Exercise}\label{FirstSumMult}
Compute the following operations in
$\F_b$: $\Fb$:
\begin{itemize}
\item $(1+1)+0$
\item $(1+1)+1 $
\item $(1+1)\cdot 1$
\item
$(0+0)+1+(1+0)*1$ $(0+0)+1+(1+0)\cdot 1$
\end{itemize}
\end{Exercise}
...
\begin{Exercise}\label{Opposto}
What is the opposite of
\begin{itemize}
\item
$(1+0)*1$? $(1+0)\cdot 1$?
\item
$(0+0)*0$? $(0+0)\cdot 0$?
\item
$1+1+1+1+0+1+(1*1)$? $1+1+1+1+0+1+(1\cdot 1)$?
\end{itemize}
\end{Exercise}
It is time that we introduce more formalism. We can consider any set $G$ endowed with an operation $*$ such that for any $a,b$ in $G$ the operation outputs another element $a*b$ of $G$.
...
\caption{Logic}\label{Logic}
\end{table}
We conclude this section with proposing a few exercises.
\begin{Exercise}\label{XorIsNice}
What can you observe by comparing tables \ref{SumProd} and \ref{Logic}?
\end{Exercise}