Using $ $ simpler multiples, $ $ we can invert $\,\ a \:\!-\:\! f,\,$ for invertible $\,a,\,$ say $\,\color{#0a0}{ab = 1},\,$ & nilpotent $\,f,\,$ say $\color{#c00}{f^n = 0},\,$ by inverting a simpler multiple $\, a^n-\color{#c00}{f^n} = \color{#0a0}{a^n},\,$ which has obvious inverse $\,\color{#0a0}{b^n},\,$ i.e.
$\ \ \ \ \ \ \ \ \ \color{#0a0}{ab=1},\, \color{#c00}{f^{\large n} = 0}\ \Rightarrow\ \overbrace{\dfrac{1}{a-f} = \dfrac{a^{\large n-1}\!+\!\cdots\! +\! f^{\large n-1}}{\!\!\!\!\!\color{#0a0}{a^{\large n}}-\color{#c00}{f^{\large n}}}}^{\large \text{check via cross multiply}} =\, \color{#0a0}{b^{\large n}}(a^{\large n-1}+\cdots + f^{\large n-1})$
$\!\begin{align}{\rm so}\ \ &\color{#0a0}{3(3)=1},\, \color{#c00}{f^{\large 3} = 0}\ \Rightarrow\ \dfrac{1}{3-f} = \dfrac{3^{\large 2}+\,3f\,+\, f^{\large 2^{\phantom{|^{|^|}}\!\!\!\!\!}}}{\color{#0a0}{3^{\large 3}-\color{#c00}{f^{\large 3}}}}\ \ \, =\, \ \ \color{#0a0}{3^{\large 3}}(3^{\large 2}\! +3f + f^{\large 2}) = \bbox[5px,border:1px solid #c00]{2x+3}\\[.1em]
&{\rm because}\ \ \ \color{#c00}{2^{\large 3}\mid f^{\large 3^{\phantom{ |^|}}}} {\rm by}\ \ 2\mid f = -6x-4x^2\,\ \ [\,{\rm to\ invert}\ \ 3\!-\!f = 3\!+\!6x\!+\!4x^2 \in \smash[b]{\Bbb Z_{\large \color{#c00}{2^{\Large 3}} }]}\end{align}$
Remark $ $ We may view this as a constructive proof that divisors of units are units, i.e. if $\,d\mid u\,$ unit, then $\,dd' = u\,$ so $\,\dfrac{1}d = \dfrac{d'}u.\,$ Above we chose $\,u = a^n-f^n,\,$ a unit multiple $\,a-f,\,$ which is "simpler" since it has $ $ obvious $ $ inverse, because $\,u= a^n\,$ for unit $\,a,\,$ by $\,f^n = 0$.
The same idea shows how to invert all cyclotomics $\Phi_{k}(f)$ for $\,k\ge n,\,$ since they have simpler multiple $\,1-f^k = 1.\,$ There are simple algorithms for recognizing polynomials of cyclotomic form (i.e. divisors of $\,1-x^k)$ and products of such, so the above method generalizes widely.
This idea of scaling to simpler multiples of the divisor is ubiquitous, e.g. it is employed analogously in the method of rationalizing denominators and in Gauss's algorithm for computing modular inverses. Analogous methods may be employed for for computing remainders via mod arithmetic.
Generally we can use standard (nonconstructive) methods of commutative algebra to give quicker proofs, e.g see here, which mentions how it is related to Euclid's proof that there are infinitely many primes (and generalizations). Compare also the methods used here to prove that a polynomial is a unit iff its constant term is a unit and all other coefficients are nilpotent (the method of proof there can be made constructive - analogous to above)