Pith. sign in

REVIEW

Common divisors of totients of polynomial sequences

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.10808 v1 pith:EMEZT3BZ submitted 2019-09-24 math.NT

Common divisors of totients of polynomial sequences

classification math.NT
keywords polynomialcommonestablishintegerpolynomialsquestionaddressesassuming
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.