Let $f(x) := \sum_{k=0}^n c_k x^k $ be a polynomial of degree $n\geq 0$ with real coefficeints such that $f(x) = 0$ for $n+1$ distinct real values of $x$. Then how to prove that each $c_k = 0$ and that $f(x) = 0$ for all real $x$?
We don't have to use the methods of calculus and have to use only the most elementary ideas.
And how to prove the following statement without recourse to the division algorithm?
If $n \geq 1$ and $f(a) = 0$ for some real $a$, then $f(x) = (x-a) h(x)$, where $h$ is a polynomial of degree $n-1$.
Hint: Use the Mean Value Theorem repeatedly to find out the following:
The $1$st derivative has $n$ distinct real roots.
The $2$nd derivative has $n-1$ distinct real roots.
...
The $n-1$th derivative has $2$ distinct real roots.
The $n$th derivative has $1$ real root.
Of course, $f^{(n)}(x) = n!c_n$. Can you see where to go from here?