Problem
Show that $f(t)=t^5-5t+1$ has no repeated roots.
My initial idea
I write $f$ in terms of linear factors $(t-\alpha_1)...(t-\alpha_5)$ where all the $\alpha_i$ make up the five roots of $f$. I’d like to show that each possibility of there even existing multiplicities in the factorization leads to a contradiction. The following statements are all that is necessary to prove the original question without loss of generality and after renumbering the $\alpha_i$. The first case would be that $f(t)=(t-\alpha_1)^2(t-\alpha_2)(t-\alpha_3)(t-\alpha_4)$. The second would be that $f(t)=(t-\alpha_1)^2(t-\alpha_2)^2(t-\alpha_3).$ The third case would be that $f(t)=(t-\alpha_1)^3(t-\alpha_2)(t-\alpha_3)$, and so on proving the rest of these possibilities until they are all exhausted out.
My question
Obviously, this is time consuming and there’s likely a better solution. I would like any suggestions on how to solve the problem quicker without this exhaustive method.
Any thoughts would be appreciated.
Remark
I tagged irreducible polynomials and gcd/lcm because I am not sure if any suggestions would have to do with them, yet I still suspect that they would.
$f(t)=t^5-5t+1 \implies f'(t)=5t^4-5, f'(1)=0,f'(-1)=0, f'(i)=0, f'(-i)=0$ but $f(1), f(\pm 1), f(\pm i)$ are non-zero. So there exist not even a root with multiplicity 2.
Edit: For multiplicity of orfer $m$ at $x=a$ we must have $f(a)=f'(a)=...f^{(m-1)}(a)=0$. $k(x)=(x-1)^4$ has multiplicity of order 4 at $x=1$.