Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. Theorem 1.1 of Cécile Dartyge and James Maynard, On the largest prime factor of quartic polynomial values: the cyclic and dihedral cases, states: for a monic irreducible quartic P∈Z[X]P\in\mathbb Z[X] whose Galois group is C4C_4 or D4D_4 there is a constant cP>0c_P>0 such that, for x>x0(P)x>x_0(P),

#{x<m≤2x: P+(P(m))≥x1+cP}≫x.\#\{x<m\leq2x:\ P^+(P(m))\geq x^{1+c_P}\}\gg x.

Taking x=n/2x=n/2 gives an m≤nm\le n whose value P(m)P(m) has a prime factor at least (n/2)1+cP(n/2)^{1+c_P}, so FP(n)≫Pn1+cPF_P(n)\gg_P n^{1+c_P} in the notation of Problem 976. The statement and this consequence are recorded on the theorem card.

Covers. The first question for monic irreducible quartics with Galois group C4C_4 or D4D_4. It covers no other quartic and does not give FP(n)≫n4F_P(n)\gg n^4.

Depends on. No page of this wiki.

Acceptance. Refereed: the Journal of the European Mathematical Society accepted the paper on 12 October 2023 and published it online on 31 January 2025 (DOI 10.4171/JEMS/1586). The site labels the problem OPEN.