An audit and restoration of the vector-sieve estimates for primes of the form m² + n² + 1 with p + 2 almost prime

Nath and Xie (Acta Arith. 223 (2026), 51–82; arXiv:2501.16723v3) state that there are ≫ x (log x)^(−5/2) primes p ≤ x with p = m² + n² + 1 and Ω(p+2) ≤ 9. The proof combines a semi-linear and a linear sieve in a vector sieve, Iwaniec's switching principle and Richert's weights, and ends with a numerical inequality H > 0. This note recomputes that inequality. Findings: (1) The linear sieve functions used in the computation, both as printed and in the authors' Matlab files, solve the delay system without the factor 1/s, so that the computed lower function exceeds the computed upper function. With the correct functions the quantities reported as G(0.4230, 0.0249) = 0.001378 and H(0.17, 0.25, 0.449, 0.011) = 1.2690 become −23.73 and −34.28. (2) The reported values are reproduced from the authors' code to three digits (−0.0009 and 1.2625) once a second artefact is taken into account, an optimiser called on an empty constraint set; this identifies the cause. (3) Three constants in the switched term (Proposition 4.2) need correction: the Wirsing constant lacks the Euler factor of the prime 2, the joint singular series of the two linear sieves has the wrong sign in its factors, and one inequality is reversed. Together they halve the switched term. (4) The levels in the switching step can be chosen more freely. With these changes the method of the paper gives Ω(p+2) ≤ 17; with the constants as printed it gives Ω(p+2) ≤ 59. With the Buchstab fixed point of Part XIV (doi:10.5281/zenodo.24231797) the bound improves to Ω(p+2) ≤ 15. These statements assume Propositions 3.10, 4.1 and 4.3 of the Nath–Xie paper; the numerical values come from floating-point grid searches, not interval arithmetic. All numbers are produced by a single script in the Python standard library (about 15 seconds). Code and data: https://github.com/Ruqing1963/nath-xie-sieve-audit

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24237369
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

An audit and restoration of the vector-sieve estimates for primes of the form m² + n² + 1 with p + 2 almost prime

Ruqing Chen
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

An audit and restoration of the vector-sieve estimates for primes of the form m² + n² + 1 with p + 2 almost prime

Ruqing Chen
preprint en

Abstract

Nath and Xie (Acta Arith. 223 (2026), 51–82; arXiv:2501.16723v3) state that there are ≫ x (log x)^(−5/2) primes p ≤ x with p = m² + n² + 1 and Ω(p+2) ≤ 9. The proof combines a semi-linear and a linear sieve in a vector sieve, Iwaniec's switching principle and Richert's weights, and ends with a numerical inequality H > 0. This note recomputes that inequality. Findings: (1) The linear sieve functions used in the computation, both as printed and in the authors' Matlab files, solve the delay system without the factor 1/s, so that the computed lower function exceeds the computed upper function. With the correct functions the quantities reported as G(0.4230, 0.0249) = 0.001378 and H(0.17, 0.25, 0.449, 0.011) = 1.2690 become −23.73 and −34.28. (2) The reported values are reproduced from the authors' code to three digits (−0.0009 and 1.2625) once a second artefact is taken into account, an optimiser called on an empty constraint set; this identifies the cause. (3) Three constants in the switched term (Proposition 4.2) need correction: the Wirsing constant lacks the Euler factor of the prime 2, the joint singular series of the two linear sieves has the wrong sign in its factors, and one inequality is reversed. Together they halve the switched term. (4) The levels in the switching step can be chosen more freely. With these changes the method of the paper gives Ω(p+2) ≤ 17; with the constants as printed it gives Ω(p+2) ≤ 59. With the Buchstab fixed point of Part XIV (doi:10.5281/zenodo.24231797) the bound improves to Ω(p+2) ≤ 15. These statements assume Propositions 3.10, 4.1 and 4.3 of the Nath–Xie paper; the numerical values come from floating-point grid searches, not interval arithmetic. All numbers are produced by a single script in the Python standard library (about 15 seconds). Code and data: https://github.com/Ruqing1963/nath-xie-sieve-audit

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon