Sur une question d'Erdős et Schinzel. II. (On a question of Erdős and Schinzel. II) (Q912907): Difference between revisions

Let P(n) denote the largest prime factor of n, and let F(X) be a polynomial of degree \(g>1\), with integer coefficients, which is irreducible in \({\mathbb{Z}}[X]\). In a recent paper [``On the greatest prime factor of \(\prod^{x}_{k=1}f(k)\)'', Acta Arith. 55, No.2, 191-200 (1990)], \textit{P. Erdős} and \textit{A. Schinzel} proved that \[ P\left( \prod_{n\leq x} F(n) \right) > x \exp \exp (c(\log \log x)^{1/3}) \text{ for }x > x_ 0(F), \tag{*} \] \(c\) being an absolute constant, a result not yet strong enough to confirm an announcement made by Erdős in 1952. In the present paper, the author establishes Erdős' original announcement in a quantitative form by increasing the lower bound in (*) to \(x \exp((\log x)^\alpha)\), where \(0 < \alpha < 2-\log4\). This is achieved by deriving a lower bound for \[ H_ F (x,y,2y) = \text{card}\{n\leq x :\;\exists d | F(n),\quad y<d\leq 2y\} \] that is valid for \(y\leq x/2\) (\(x,y\to\infty\)), and thus improving on results obtained in the author's earlier paper of the same title [A Tribute to Paul Erdős, 405-443 (1990), edited by \textit{A. Baker}, \textit{B. Bollobás} and \textit{A. Hajnal}, Cambridge University Press, Cambridge]. A key step, which is of interest in its own right, is the establishment of an upper bound for the sum \(\sum_{n\leq x}\Delta (F(n))^ t\) for \(t\geq 1\), where \(\Delta\) denotes Hooley's \(\Delta\)-function, defined by \(\Delta (n)=\max_{u\in {\mathbb{R}}}\text{card}\{d : \;d | n,\quad e^ u<d\leq e^{u+1}\}\).