For polynomials over any commutative coefficient ring, the high-school polynomial long division algorithm works to divide with remainder by any monic polynomial, i.e any polynomial $\,F\,$ whose leading coefficient $\,a=1$ (or a unit = invertible), since this implies that the leading term of $\,F\,$ divides all monomials $\,x^k\,$ so the division algorithm works to kill all higher degree monomials in the dividend, leaving a remainder of degree $ < \deg F,\,$ i.e. as below we scale $F$ by $\,\color{#c00}{(b/a)x^k}$ so its leading term equals the leading term of $G$, so they cancel upon subtraction, leaving a result of lower degree than $G$. By induction (recursion) we can iterate this till we obtain a remainder with smaller degree than the dividend $F$.
$$\begin{align} G - \color{#c00}{\frac{b}a x^{\large j}} F \,\ = \,\ (\overbrace{b x^{\large k+j} + g}^{\large {\rm dividend}\ G})\ -\ &\color{#c00}{\frac{b}a x^{\large j}} (\overbrace{a x^{\large k} + f}^{\large {\rm divisor}\ F})\ =\ \overbrace{\color{#0a0}{g-\frac{b}a x^j f}}^{\large {\rm deg}\ <\ k+j}\\[.4em]
\Longrightarrow\ \ \ \dfrac{b x^{\large k+j}+g}{ax^{\large k}+f}\, =\ &\color{#c00}{\frac{b}a x^{\large j}}\ \ +\ \underbrace{\dfrac{\color{#0a0}{g-\frac{b}a x^{\large j} f}}{ax^k + f}}_{\large\rm recurse\ on\ this}\end{align}\qquad\qquad$$
This division algorithm generally fails if $\color{#c00}{a}$ is not invertible, e.g. $\, x = 2x\,q + r\,$ has no solution for $\,r\in \mathbb Z,\ q\in \mathbb Z[x],\,$ since evaluating at $\,x=0\,$ $\Rightarrow$ $\,r=0,\,$ evaluating at $\,x=1\,$ $\Rightarrow$ $\,2\,|\,1\,$ in $\mathbb Z\,$ $\Rightarrow\!\Leftarrow$ Notice that the same proof works in any coefficient ring $\,R\,$ in which $2$ is not a unit (invertible). Conversely, if $2$ is a unit in $\,R,$ say $\,2u = 1\,$ for $\,u\in R,\,$ then division is possible: $\, x = 2x\cdot u + 0.$
However, we can generalize the division algorithm to the non-monic case by scaling the above division step by $\,a,\,$ i.e. using $\,\color{#c00}aG-\color{#c00}{bx^j} F,\,$ which inductively yields the following
Theorem (nonmonic Polynomial Division Algorithm) $\ $ Let $\,0\neq F,G\in A[x]\,$ be polynomials over a commutative ring $A,$ with $\,a\,$ = lead coef of $\,F,\,$ and $\, i \ge \max\{0,\,1\!+\!\deg G\!-\!\deg F\}.\,$ Then
$\qquad\qquad \phantom{1^{1^{1^{1^{1^{1}}}}}}a^{i} G\, =\, Q F + R\ \ {\rm for\ some}\ \ Q,R\in A[x],\ \deg R < \deg F$
Proof $\,\ $ If $\ \deg G < \deg F\,$ then let $\, Q = 0 ,\ R = a^i G.\, $ Else we induct on $\,\deg G.\,$ Let $\, k = \deg F,\,$ so $\,\deg G = k+j\,$ for $\, j \geq 0.\,$ Splitting $\,G,F\,$ into $ $ lead $\color{#c00}+$ rest $ $ terms:
$\begin{array}{lrl}
\ G = b x^{k+j\!}\color{#c00} + g,\ \deg g<k\!+\!j\!\!\!\!\!\! &\Rightarrow\quad aG\!\!\!\! &=\,abx^{k+j}+ag\\
\ F = a x^k\color{#c00}+f,\quad \deg f \!< k & bx^jF\!\!\!\! &=\, abx^{k+j}+bx^jf\\
\ {\rm with}\ \,a,b\neq 0\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! & aG-bx^jF\!\!\!\! &=\, ag-bx^jf\ \ {\rm has\ \ deg} < k\!+\!j \end{array}$
$\begin{array}{lrl}{\rm Therefore,\, by\ \ induction}\!\! &a^j(aG-bx^jF) =&\!\!\! Q F + R\ \ {\rm for}\ \ Q,R\in A[x], \ \deg R < k\\
&\Rightarrow\quad a^{j+1} G\, =&\!\!\! \bar QF + R\ \ {\rm for}\ \ \bar Q = Q\!+b(ax)^j\end{array}$
Remark $\ $ Alternatively, if localizations are known, we can divide by the monic $\,a^{-1} F\in A[a^{-1}][x]\,$ then pullback the result to $\,A[x].$
Or, as in the AC-method, we can conjugate to the monic case: scaling $\,F\,$ by $\,a^{k-1}\,$ for $\,k = {\rm deg} F,\,$ we can rewrite $\,F\,$ as a monic polynomial in $\,X = ax,\,$ and similarly we can scale $\,G\,$ by $\,a^i\,$ to make it a polynomial in $\,X.\,$ Then we divide $\,G(X)\,$ by the monic $\,F(X),\,$ and finally replace $\,X\,$ by $\,ax.$