this is for holding javascript data
Michela Ceria edited bits2.tex
about 8 years ago
Commit id: 04c0e681f25badd4871dee621ee5c35093cdf72a
deletions | additions
diff --git a/bits2.tex b/bits2.tex
index d14d843..e4aab29 100644
--- a/bits2.tex
+++ b/bits2.tex
...
0 & 0 & 1 & 0 & 1\\
1 & 0 & 1 & 1 & 0\\
\end{tabular}
\caption{$4$ functions}\label{FourFunctions} \caption{All the possible evaluations}\label{FourFunctions}
\end{table}
As an example, if we consider the polynomial $p(x)=x^2+x$, $p(0)=0$ and $p(1)=0$ as in column $2$ of the table; if we take
$q(x)=x^2+x+1$, $q(0)=q(1)=1$ as in the third column. If we take $r(x)=x^3$, we have $r(0)=0$ and $r(1)=1$ as in column four. Finally, if we take $s(x)=x^2+1$ we have $s(0)=1$ and $s(1)=0$, as in the last column of the table.\\
Can you find the four polynomials $p(x),q(x),r(x),s(x)\in \Fb[x]$ \emph{of minimal degree} such that, evaluated in $0,1$ behave exactly as in the corresponding column of the table?
\item Looking at the table \ref{FourFunctions}, decide how many functions $\Fb\rightarrow \Fb$ are there.
\end{enumerate}