On the Greatest Common Divisor of the Value of Two Polynomials
From MaRDI portal
Publication:4575264
Abstract: We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the values of the two polynomials at a suitable integer.
Recommendations
- scientific article; zbMATH DE number 3267423
- Estimating the greatest common divisor of the value of two polynomials
- On the remainders obtained in finding the greatest common divisor of two polynomials
- scientific article; zbMATH DE number 1263314
- On the greatest common divisor of two univariate polynomials. II
- Greatest common divisor of parameter-dependent polynomials
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- scientific article; zbMATH DE number 1981162
- Numerical Analysis and Its Applications
- Greatest common divisors of iterates of polynomials
Cites work
Cited in
(13)- On the least common multiple of several consecutive values of a polynomial
- Estimating the greatest common divisor of the value of two polynomials
- Evaluationally relatively prime polynomials
- Fixed divisors of products of polynomials
- On the greatest common divisor of two univariate polynomials. II
- scientific article; zbMATH DE number 3267423 (Why is no real title available?)
- Prime and coprime values of polynomials
- COMMON FACTORS OF RESULTANTS MODULO p
- Coprime values of polynomials in several variables
- Numerical Analysis and Its Applications
- scientific article; zbMATH DE number 1981162 (Why is no real title available?)
- Common divisors of values of polynomials
- The Hilbert-Schinzel specialization property
This page was built for publication: On the Greatest Common Divisor of the Value of Two Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575264)