(adsbygoogle = window.adsbygoogle || []).push({}); Problem:Let R=Q[y] and suppose f,g \in F[x] both have degree 10 with respect to x and degree 6 with respect to y. Suppose h = gcd(f,g) has degree 4 with respect to x and degree 2 with respect to y. Derive an upper bound (as good as possible) on the number of distinct integers i such that gcd(f(x,i), g(x,i)) \in Q[x] has degree not equal to 4.

Start of solution:We can write h as h=p_{4}(y)x^{4}+p_{3}(y)x^{3}+p_{2}(y)x^{2}+p_{1}(y)x + p_{0}(y), where each p_{i}is a polynomial of degree at most 2 in y. Then there exist at most 2 integers i that cause p_{4}(y) to evaluate to zero, thus dropping the degree of h.

Also, evaluating f(x,i) is equivalent to computing f(x,y) mod (y-i). I know that there are results that say precisely when gcd(f mod i, g mod i) = gcd(f,g) mod i, and I suspect that these are required to find the remainder of the cases. But that's about as far as I can get. What results should I use to proceed?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Degree of polynomial gcd

Loading...

Similar Threads - Degree polynomial | Date |
---|---|

I Existence of basis for P_2 with no polynomial of degree 1 | Oct 7, 2016 |

Characteristic polynomial has degree n and leading coefficent (-1)^n | Jul 22, 2013 |

Finding roots to a recursively defined polynomial of degree n | Jan 20, 2013 |

Fast Construction of Irreducible Polynomials of degree n over any Finite Field | Mar 27, 2011 |

Minimum degree of polynomial time NP complete problem algorithm | Jan 10, 2011 |

**Physics Forums - The Fusion of Science and Community**