Around the GCD of the Values of Two Polynomials

DOI10.1080/00029890.2025.2525048MaRDI QIDQ6901020zbMATH OpenFDO

Authors Arnaud Bodin, Christian Drouin

Publication date 12 November 2025

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00029890.2025.2525048

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Polynomials over finite fields (11T06) Solving polynomial systems; resultants (13P15)

Cites work

• COMMON FACTORS OF RESULTANTS MODULO p
• Computing congruences of modular forms and Galois representations modulo prime powers
• Estimating the greatest common divisor of the value of two polynomials
• Galois Theory and Applications
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 51347 (Why is no real title available?)
• On the Greatest Common Divisor of the Value of Two Polynomials
• Prime and coprime values of polynomials
• The Factorial Function and Generalizations
• Über die Existenz unendlich vieler Primzahlen in einigen speziellen arithmetischen Progressionen.

This page was built for publication: Around the GCD of the Values of Two Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901020)