In these notes (pag 3, pdf alert) the author observes that, given a complex polynomial $Q(s)=q_0 + q_1 s+ ... + q_m s^m$ with $q_0\neq0$, "using the long-division algorithm", we have
$$\frac{1}{Q(s)}=\left(\frac{1}{q_0}-\frac{q_1 s}{q_0^2}\right) + s^2 \frac{R(s)}{Q(s)},\tag1$$ for some polynomial $R$.
I'm aware of what polynomial long division is, but I don't see how to apply it here. Normally, if I were to compute $p/q$, I would find a polynomial that multiplied by $q$ gives the same leading order term as $p$ and so on. But this assumes that the order of $p$ is larger than that of $q$, which is not the case for $1/Q(s)$ if I am to think about it as "$1$ divided by $Q$".
This actually looks closer to a partial fraction decomposition, but then again that would usually involve polynomials in the denominator of both factors in the RHS, which we do not have here.
So where does (1) come from?
We apply long division starting from the constant term, and then the $s$ term:
$$ \require{enclose} \begin{array}{r} \dfrac1{q_0}-\dfrac{q_1}{q_0^2}s+\dots \\[-1pt] q_0+q_1s+\dots \enclose{longdiv}{\hspace{7pt}1+\hspace{7pt}0s+\dots} \\[-1pt] \underline{1+\dfrac{q_1}{q_0}s+\dots} \\[1pt] -\dfrac{q_1}{q_0}s+\dots \\[1pt] \underline{-\dfrac{q_1}{q_0}s+\dots} \\[1pt] \dots & = s^2R(s) \end{array} $$
where "$\dots$" are the $\mathcal O(s^2)$ remainders.