deletions | additions       diff --git a/bits2.tex b/bits2.tex  index 2fdef44..9e2439e 100644  --- a/bits2.tex  +++ b/bits2.tex 
...
\end{Exercise}  Talking about polynomials, it would be useful to understand whether a given   polynomial $p(x) \in \Fb[x]$ There  is irreducible or not.\\  More precisely a property for polynomials that plays a special role in cryptography.  We introduce it formally in the following definition and then we discuss it.  %  \begin{Definition}  A nonzero polynomial $p(x) $f  \in \Fb[x]$ of degree $\geq 1$ is called \emph{reducible} if there exist $q(x), r(x) \in \Fb[x]$ of positive \textbf{positive}  degree such that $$p(x)=q(x)r(x).$$ $$f(x)\,=\,q(x)r(x)\,.$$  If no polynomials of this form exist, then $p(x)$ $f(x)$  is an \emph{irreducible} polynomial.  \end{Definition}  %  Polynomials of degree $1$ are clearly irreducible.  \begin{Example}\label{}  Consider the polynomial $p(x)=x^4+x^2+x \in \Fb[x]$. It is easy to note that