We know that the following facts.
- The quadratic equation $ax^2+bx+c=0$ can be reduce to $y^2+p=0$
- The cubic equation $ax^3+bx^2+cx+d=0$ can be reduce to $y^3+py+q=0$
- The quartic equation $ax^4+bx^3+cx^2+dx+e=0$ can be reduce to $y^4+py+q=0$
Finally the quintic equation $ax^5+bx^4+cx^3+dx^2+ex+f=0$ can be reduce to $y^5+py+q=0$, where $p,q\in\Bbb C$.
My question is about, what is the highest value of $n$ be to reduce a general polynomial $a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0=0$ to $y^n+py+q=0\,?$ What must be the highest $n$ for this to be applicable?Is it true that it should be $n\leq 5$?