Show that for every mapping, that there exists a polynomial
such that
for all
I'm pretty sure Lagrange Interpolation is what is needed here but I'm not sure how to use it.
Printable View
Show that for every mapping, that there exists a polynomial
such that
for all
I'm pretty sure Lagrange Interpolation is what is needed here but I'm not sure how to use it.
Yes since the sets used are finite with the same cardinal and thatis a group for
(I assume
denotes a prime) you can write something like
, and it is an element of