Common divisors of totients of polynomial sequences
arXiv:1909.10808
Abstract
Motivated by a question of Venkataramana, we consider the greatest common divisor of where is a primitive polynomial with integer coefficients, and ranges over all natural numbers. Assuming Schinzel's hypothesis, we establish that this gcd may be bounded just in terms of the degree of the polynomial . Unconditionally we establish such a bound for quadratic polynomials, as well as polynomials that split completely into linear factors. The paper also addresses a question of Calegari, and establishes that there are infinitely many such that is not divisible by any prime provided is a large fixed integer.
15 pages