Answers are grounded in this paper and cite their sources.
This note re-examines the final numerical step of M. Bordignon, D. R. Johnston and V. Starichkova, "An explicit version of Chen's theorem and the linear sieve", Int. J. Number Theory 21 (2025), no. 10, 2497–2572 (doi:10.1142/S1793042125501192, arXiv:2207.09452). The main theorem of that paper states that every even N > exp(exp(32.7)) is the sum of a prime and a number with at most two prime factors, with an explicit lower bound for the number of representations. Three issues are reported and quantified.(i) In the upper bound for S(B, P(y)), the factor 1/U_N is bounded by (2e^γ C_2)^(-1) = 0.4252, whereas the definition of U_N only gives (2e^(-γ) C_2)^(-1) = 1.3490, a factor e^(2γ) larger.(ii) In the same bound, ε_2 is evaluated at X_3^8, although the hypothesis it needs is only available at X_3.(iii) The explicit linear-sieve constants obtained from the paper's lemmas are about 25% larger than those printed in its Table 1, and the tail bound gives no bound at all for 1/ε ≥ 221. At the paper's parameters, the lower bound in the case of a large exceptional modulus is +4.5e-4 as computed in the paper, -5.6e-3 once (i) is corrected, and -8.3e-3 once (i) and (ii) are both corrected. Issue (iii) changes it by a further 2e-5 only. The theorem can be restored. With the paper's lemmas and a re-chosen δ it holds for N > exp(exp(32.72)). With a one-line sharpening of the lemma that bounds the largest prime factor of the exceptional modulus, it holds as stated, for N > exp(exp(32.7)), with margin 4.1e-3. Contents: the note (LaTeX source and PDF, 5 pages); verify_bjs_chen.py, a self-contained Python/mpmath program (about four minutes) that reproduces the paper's two margins and every number in the note; its output and CSV data; and the script that draws the figure. Line numbers in the note refer to the LaTeX source of arXiv:2207.09452v6, which is not redistributed here. The README gives the correspondence between the arXiv and journal numbering of the results. Not checked: the external explicit inputs used by the paper (bounds for exceptional zeros and for primes in arithmetic progressions, zero-free regions, and the results quoted from Nathanson's book), which are used as quoted. Source repository: https://github.com/Ruqing1963/bordignon-johnston-chen-audit
No takes yet. Share an insight, caveat, or question.
Ruqing Chen (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: