On the greatest prime factor of \((n^2)+1\) (Q1166560): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.5802/aif.891 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018314941 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kloosterman sums and Fourier coefficients of cusp forms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the greatest prime factor of a quadratic polynomial / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4092051 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rosser's sieve / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.5802/AIF.891 / rank | |||
Normal rank | |||
Latest revision as of 15:59, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the greatest prime factor of \((n^2)+1\) |
scientific article |
Statements
On the greatest prime factor of \((n^2)+1\) (English)
0 references
1982
0 references
There exist infinitely many integers \(n\) such that the greatest prime factor of \(n^2 + 1\) is at least \(n^{6/5}\). The proof is a combination of Hooley's method -- for reducing the problem to the evaluation of Kloosterman sums -- and the majorization of Kloosterman sums on average due to the authors.
0 references
greatest prime factor
0 references
combination of Hooley's method
0 references
upper bound for Kloosterman sums
0 references
