English

Common divisors of totients of polynomial sequences

Number Theory 2019-09-25 v1

Abstract

Motivated by a question of Venkataramana, we consider the greatest common divisor of ϕ(f(n))\phi(f(n)) where ff is a primitive polynomial with integer coefficients, and nn 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 ff. 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 nn such that n2+1n^2+1 is not divisible by any prime 1mod2m\equiv 1 \bmod 2^m provided mm is a large fixed integer.

Keywords

Cite

@article{arxiv.1909.10808,
  title  = {Common divisors of totients of polynomial sequences},
  author = {J. Brüdern and K. Soundararajan},
  journal= {arXiv preprint arXiv:1909.10808},
  year   = {2019}
}

Comments

15 pages