Estimating the greatest common divisor of the value of two polynomials

DOI10.1142/S1793042118501518zbMath1445.11018arXiv1712.01054OpenAlexW2771834177MaRDI QIDQ4683202

Péter E. Frenkel, Gergely Zábrádi

Publication date: 20 September 2018

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.01054

zbMATH Keywords

greatest common divisorpolynomialresultant

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Polynomials (11S05)

Related Items (1)

On the least common multiple of several consecutive values of a polynomial

Cites Work

• Counting polynomial functions \(\pmod{p^ n}\)
• On the relationship between the number of solutions of congruence systems and the resultant of two polynomials
• COMMON FACTORS OF RESULTANTS MODULO p
• On the Greatest Common Divisor of the Value of Two Polynomials

This page was built for publication: Estimating the greatest common divisor of the value of two polynomials