Hey, can anyone help me clear something up with the statement of this problem? Suppose n in N. Given a pair of polynomials f_n, g_n s.t. deg(g_n) < deg(f_n) and deg(g_n) < n , the Euclidian Algorithm for computing gcd(f_n,g_n) takes at least n steps.
I'm making an example with f=x^3, g=x^2, so deg(g)=2 < deg(f)=3, but how does this part look: deg(g) < n ?