On values of \(n^2 + 1\) free of large prime factors (Q2481715): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00013-007-2404-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054021399 / rank | |||
Normal rank |
Latest revision as of 23:58, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On values of \(n^2 + 1\) free of large prime factors |
scientific article |
Statements
On values of \(n^2 + 1\) free of large prime factors (English)
0 references
15 April 2008
0 references
For any \(\alpha>4/5\) it is shown that \(P^+(n^2+1)<x^{\alpha}\) for a positive proportion of integers \(n\), where \(P^+(m)\) is the largest prime factor of \(m\). This improves on earlier work of \textit{C. Dartyge} [Acta Math. Hung. 72, No. 1--2, 1--34 (1996; Zbl 0860.11053)] which required \(\alpha>0.8324\). The basic idea is to count solutions of \(n^2+1=prs\) with \(x<n\leq 2x\) and where \(p\) is a prime in the range \(A<p\leq AB\), all prime factors of \(s\) exceed \(B\), and \(r\) is an integer in the range \(F<r\leq FB\). Providing that \(B\) is a small power of \(x\), and \(A,F\) are chosen as suitable powers of \(x\), it then suffices to show that there are \(\gg x\) solutions. The method draws its power from estimates developed by \textit{J.-M. Deshouillers} and \textit{H. Iwaniec} [Ann. Inst. Fourier 32, No. 4, 1--11 (1982; Zbl 0489.10038)] in their work on the largest prime factor of \(n^2+1\).
0 references
quadratic polynomial
0 references
smooth number
0 references
lower bound
0 references