On the largest prime factor of \(n^2 + 1\) (Q6160168)

In the paper under review, the author shows that the largest prime factor of \(n^2+1\) is greater than \(n^{1.279}\) for infinitely many integers \(n\). This improves on a recent work by \textit{R. De la Bretèche} and \textit{S. Drappeau} [J. Eur. Math. Soc. (JEMS) 22, No. 5, 1577--1624 (2020; Zbl 1458.11138)] in which it was proved the same result with the smaller exponent \(1.2182\). A key part in the proof is playing by a new type II estimate, which in turn depends on the best lower bound to date for the smallest eigenvalues \(\lambda_1(q)\) on the Hecke congruence subgroups \(\Gamma_0(q)\) obtained by \textit{H. H. Kim} [J. Am. Math. Soc. 16, No. 1, 139--183 (2003; Zbl 1018.11024)]. All these ingredients are then used by applying Harman's sieve [\textit{G. Harman}, Prime-detecting sieves. Princeton, NJ: Princeton University Press (2007; Zbl 1220.11118)]. The author also shows that, conditionally on Selberg's eigenvalue conjecture \(\lambda_1(q) \geqslant \frac{1}{4}\), the exponent \(1.279\) may be increased to \(1.312\).