Around the gcd of the values of two polynomials

Abstract

We propose a mathematical walk around the gcd of the values $A(n)$ and $B(n)$ of two polynomials evaluated at an integer $n$. This is an opportunity to use a very powerful tool: the resultant.

The final version will appear in the American Mathematical Monthly