On the largest prime factor of n2 C 1

被引：1

作者：

Merikoski, Jori ^{[1
]}

机构：

[1] Univ Oxford, Math Inst, Radcliffe Observ Quarter, Andrew Wiles Bldg, Woodstock Rd, Oxford OX2 6GG, England

来源：

JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY | 2023年 / 25卷 / 04期

关键词：

Prime numbers; sieve methods; Kloosterman sums;

D O I：

10.4171/JEMS/1216

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We show that the largest prime factor of n2 + 1 is infinitely often greater than n1.279. This improves the result of de la Breteche and Drappeau specialIntscript who obtained this with 1.2182 in place of 1.279. The main new ingredients in the proof are a new Type II estimate and using this estimate by applying Harman's sieve method. To prove the Type II estimate we use the bounds of Deshouillers and Iwaniec on linear forms of Kloosterman sums. We also show that conditionally on Selberg's eigenvalue conjecture the exponent 1.279 may be increased to 1.312.

引用

页码：1253 / 1284

页数：32

共 8 条

[1] On the greatest prime factor of ab + 1
K. Matomäki
Acta Mathematica Hungarica, 2009, 124 : 115 - 123
[2] ON THE GREATEST PRIME FACTOR OF ab+1
Matomaki, K.
ACTA MATHEMATICA HUNGARICA, 2009, 124 (1-2) : 115 - 123
[3] Method for Determining Prime and Relatively Prime Numbers of 2n+k Type Based on the Periodicity Property
Yakymenko, Igor
Kasianchuk, Mykhailo
Ivasiev, Stepan
Shevchuk, Ruslan
Batko, Yuriy
Vasylkiv, Vladyslav
2020 10TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER INFORMATION TECHNOLOGIES (ACIT), 2020, : 751 - 754
[4] The binary Goldbach problem with one prime of the form p = k2+l2+1
Matomaeki, Kaisa
JOURNAL OF NUMBER THEORY, 2008, 128 (05) : 1195 - 1210
[5] Solutions of x12 + x22- x32 = n2 with small x3
Baier, Stephan
RAMANUJAN JOURNAL, 2024, 63 (02) : 293 - 337
[6] On the primality of n!±1 and 2 x 3 x 5 x ••• x p±1
Caldwell, CK
Gallot, Y
MATHEMATICS OF COMPUTATION, 2002, 71 (237) : 441 - 448
[7] Solutions of x12+x22-x32=n2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1^2+x_2^2-x_3^2=n^2$$\end{document} with small x3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_3$$\end{document}
Stephan Baier
The Ramanujan Journal, 2024, 63 (2) : 293 - 337
[8] Sequences. Period Math Hung. 2022; 85(1): 188- 202. https://doi.org/10.1007/s10998-021-00430-w . 12. Trojovsky P. On Diophantine equations related order of appearance in Fibonacci sequence. Math. 2019; 7(11): 10731083. https://doi.org/10.3390/math7111073 . 13. Shanmuganandham P, Deepa C. Sum of Squares 'n' Consecutive Carol Numbers. Baghdad Sci J. 2023 Mar. 1; 20(1(SI)): 0263-0263. https://doi.org/10.21123/bsj.2023.8399 14. Devi MU, Kamaraj M, Arockiaraj S. Odd Fibonacci Edge Irregular Labeling for Some Trees Obtained from Subdivision and Vertex Identification Operations. Baghdad Sci. J 2023; 20(1(SI)): 03320332. https://doi.org/10.21123/bsj.2023.8420 .
Athab, Ali S.
Hashim, Hayder R.
BAGHDAD SCIENCE JOURNAL, 2024, 21 (06) : 2079 - 2092

← 1 →