Two problems on the greatest prime factor of \(n^2+1\) (Q6547206)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7856597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two problems on the greatest prime factor of \(n^2+1\) |
scientific article; zbMATH DE number 7856597 |
Statements
Two problems on the greatest prime factor of \(n^2+1\) (English)
0 references
30 May 2024
0 references
Let \(P^+(m)\) denote the greatest prime factor of the positive integer \(m\). In the paper under review, the author shows that\N\[\N\#\{n\leq x : P^+(n^2+1)<x^\alpha\}\gg x\N\]\Nfor \(\alpha\geq 0.567\).
0 references
prime
0 references
quadratic polynomial
0 references
0 references
0 references
0 references
0.8822979927062988
0 references
0.8510616421699524
0 references
0.8070392608642578
0 references
0.8051719069480896
0 references
0.8028776049613953
0 references
