For any positive integer $ m $, the polynomials are defined as follows $(m>1)$:
$$f_m(x) = x^{2m+1} - (2m+1)x^{m+1} + (2m+1)x^m - 1$$
My goal is to prove that for any two distinct integers $ n $ and $ m $, the polynomials $ f_n(x) $ and $ f_m(x) $ have a gcd given by:
$$ \gcd(f_n(x), f_m(x)) = (x-1)^3 $$
In other words, I want to determine if they do not have any common complex roots other than 1.
What I've tried:
I have been using the Euclidean algorithm to compute the gcd for some small cases with computer. However, I haven't been able to detect any clear patterns in their coefficients when using Bézout's identity to express the gcd. So I am seeking for a theoretical proof.
Thanks for your time!