Analogy between $\Bbb F[x]$ and $\Bbb Z$? Assume $\Bbb F$ is a field.
Does the simplified form of $(x+1)^4$ in $\Bbb F[x]/(x^2-1)(x+1)$ have any connection to reducing $(a+1)^4$ in $\Bbb Z/(a^2-1)(a+1)$ and reducing $(a-1)^4$ in $\Bbb Z/(a^2-1)(a-1)$ where $a\in\Bbb N$ holds?
 A: Yes, you can always specialize such polynomial equations via evaluation hom's
$$\begin{align} f(x) &= q(x) g(x) + r(x)\ \Rightarrow\ f(x) = r(x) \ \ {\rm in}\ \ \Bbb F[x]/q(x)\\
\Rightarrow\ \ f(a) &= q(a) g(a) + r(a) \ \,\Rightarrow\ f(a) = r(a) \ \ {\rm in}\ \ \Bbb Z/q(a)
\end{align}$$
For example, casting out nines can be viewed that way when we interpret decimal notation in polynomial form, i.e $\, n = f(10) = f_0 + f_1\cdot 10+\cdots +f_n\cdot 10^k.\ $ Then 
$$\begin{align} f(x) &= (x\!-\!1) g(x) + f(1)\ \Rightarrow\ \,\ f(x) = f(1) \ \ {\rm in}\ \ \Bbb Z[x]/(x\!-\!1)\\
\Rightarrow\ \ f(10) &= \ \quad\  9\  g(10) + f(1)  \ \Rightarrow\, f(10) = f(1) \ \ {\rm in}\ \ \Bbb Z/9
\end{align}$$
where $\, f(1) = $ sum of digits of $\,n.\,$ For another example, let  $\,f_n = (x^n-1)/(x-1),\,$ which satisfies $\, \gcd(f_m,f_n)\, =\, f_{\,\gcd(m,n)}.\,$ Specializing the associated Bezout gcd identity for $\,\gcd(m,n)=\gcd(15,21) = 3,\,$ then evaluating the polynomials at $\,x=2\,$ yields
$$\rm \begin{align} \frac{x^3-1}{x-1} &=\ (x^{15} + x^9 + 1)\ \frac{x^{15}-1}{x-1}\ -\ (x^9+x^3)\ \frac{x^{21}-1}{x-1}\\[0.5em]
\Rightarrow\ \ 2^3-1\ &=\ (2^{15}+2^9+1)\ (2^{15}-1)\ -\ (2^9+2^3)\ (2^{21}-1)
\end{align}$$
See this answer for more on this divisibility sequence.
A: (I am sorry if I misunderstood your question, but this is the best explanation of some "connection" I can come up with. Please be more specific in your question if this was not what you were looking for.)
As polynomials, $(x+1)^4$ is congruent to $4x^2+8x+4$ modulo $(x^2-1)(x+1)$ and then how you simplify $4$ and $8$ depends on what the characteristic of the field is.
As natural numbers, for any $a \in N$, $(a+1)^4$ is congruent to $4a^2+8a+4$ modulo $(a^2-1)(a+1)$. I think here, the connection is very clear because you're doing the same polynomial division process to find the divisor; it's just that in the beginning, the objects are actually polynomial while here, we're just working with polynomial expressions.
Also, for any $a \in N$, $(a-1)^4$ is congruent to $4a^2-8a+4$ modulo $(a^2-1)(a-1)$, so I do not really see the connection here.
