this is for holding javascript data
Michela Ceria edited section_Bytes_The_polynomials_in__.tex
about 6 years ago
Commit id: 1d7c6621ca9e022036b8ca030b40299eddcf4963
deletions | additions
diff --git a/section_Bytes_The_polynomials_in__.tex b/section_Bytes_The_polynomials_in__.tex
index cf4f2c4..4c6be66 100644
--- a/section_Bytes_The_polynomials_in__.tex
+++ b/section_Bytes_The_polynomials_in__.tex
...
The polynomials in $\Fb[x]$ are infinite. However, if we bound the degree, we find a finite set, as for example
$$S:=\{p \in \Fb[x] \vert \deg(p) < 3\}=\{0,1,x,x+1,x^2,x^2+x, x^2+1,x^2+x+1\}.$$
This set contains $8$ polynomials; indeed, $f \in S$ if and only
if, if $f$ is of the form
$$f=a_0+a_1x+a_2x^2,\, a_0,a_1,a_2 \in\Fb$$
Since there are two choices for each coefficient $a_0,a_1,a_2 $ the polynomials are $2^3=8$.
If we take two polynomials $f,g $ in $ S$, then $f+g$ belongs to $S$ as well, since when we sum two polynomials, the degree cannot grow (see Exercise \ref{degree}), according to the rule in $\Fb[x]$