Let $p(x)$ such that $\deg(p) \le 2n+1$ and $$p(x_i) = f(x_i) \\ p'(x_i) = f'(x_i)$$ $i=0,\ldots, n$.
Show that $p(x)$ is the only polynomial satisfying those demands for all polynomials with a degree $\le 2n+1$.
Assumption: for every $j\ne k$: $x_j \ne x_k$.
So let's assume by contradiction that there's another polynomial, $q(x)$ satisfying those constraints.
I'm not sure why but I think we would like to assume WLOG that $p(x),q(x)$ are monic.
Anyways, let's look at $h(x) = p(x) - q(x)$.
We notice that for $x_i$:$$h(x_i) = p(x_i) - q(x_i) = f(x_i) - f(x_i) = 0$$
So $h(x)$ has at least $n$ roots, and therefore, $h'(x)$ has at least $n-1$ roots .
My goal is to show that $h(x)\equiv 0$ by showing that there're more than $2n$ roots (I think $\deg(h(x)$ should be $\le 2n$ since we looked at monic polynomials)
How should I proceed?
EDIT
Basically, the same applies for the derivative:
$$h'(x_i) = p'(x_i) - q'(x_i) = 0$$
but aren't those the same roots as before?