In this document: "The Elliptic Curve Digital Signature Algorithm (ECDSA)" - Don Johnson, Alfred Menezes, Scott Vanstone; in section 4.2 example 7 there is some finite field arithmetic:
Given $\alpha \in \mathbb{F}_{2^4}$ the following is claimed: $$ \begin{align*} & \quad \left( \frac{\alpha^8 + \alpha^{13}}{\alpha^6+\alpha^3} \right)^2 + \frac{\alpha^8 + \alpha^{13}}{\alpha^6+\alpha^3} + \alpha^6 + \alpha^3 + \alpha^4 \\ &=\left( \frac{\alpha^3}{\alpha^2} \right)^2 + \frac{\alpha^3}{\alpha^2} + \alpha^6 + \alpha^3 + \alpha^4 \\ &= 1 \end{align*} $$
I don't understand the simplification that is happening line-by-line. I tried using some concrete examples, like $\alpha=x$ or $\alpha=x+1$ and then sure enough the simplification works out (I used https://wims.math.cnrs.fr/wims/wims.cgi to double check my working).
The irreducible poly chosen in the text is $f(x) = x^4 + x + 1$ (not sure if it's relevant in the general case for $\alpha$).