Analogies and differences between polynomial evaluation and modulo operations

81 Views Asked by At

Given a polynomial $f(x)\in\Bbb Z[x]$, prime $p$ and integer $a$ are there analogies and differences between evaluating $f(x)$ at $x=a$ and computing $a\bmod p$? Both look like some kind of function evaluation.