Pith. sign in

REVIEW 5 minor 33 references

A Romanoff-type theorem for $P_2$+{$a^a$: a$\ge$ 1}

T0 review · 0 major / 5 minor · reviewed 2026-07-12 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The set of two-almost-primes plus numbers of the form a^a has positive lower density.

desk verdict Clean Romanoff-type density for P2 + a^a; the new average singular-factor bound is real and the second-moment argument holds. read the letter →

arxiv 2607.03662 v1 pith:SFGFD7GN submitted 2026-07-04 math.NT

Yuchen Ding , Huixi Li , Junfeng Li This is my paper · ORCID
classification math.NT MSC 11P3211N3511N3611B13
keywords RomanofftheorempositivelowerdensityalmostprimesSelbergsievesingularfactorsumsetsa^a
topics Goldbach's Conjecture
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper shows that many positive integers can be written as the sum of a number with at most two prime factors and a term of the sequence a^a. Although the powers a^a are extremely sparse, their sumset with two-almost-primes still occupies a positive proportion of the integers. The argument follows the classical second-moment method of Romanoff: one counts representations of n as m + a^a with m almost prime, shows that the total number of representations up to N is large, and shows that the second moment stays of comparable size. The new analytic work is an average bound on the sieve weights attached to the differences a^a - b^b; once those correlations are controlled, the second-moment comparison yields a positive lower density.

What carries the argument

The average singular-factor estimate: the mean value, over a eq b ≤ K, of the product ∏_{p | a^a-b^b}(1 + κ/p) remains bounded by a constant depending only on κ. This bound tames the off-diagonal second-moment terms and lets the Romanoff argument close.

What would settle it

Exhibit a sequence of K for which the average of ∏_{p | a^a-b^b}(1 + κ/p) over a eq b ≤ K grows without bound for some fixed κ > 0; that would invalidate the second-moment comparison.

Watch

Extended reading notes

Core claim

There exists a positive constant δ such that, for all sufficiently large N, at least δ N integers n ≤ N admit a representation n = m + a^a with Ω(m) ≤ 2 and a a natural number.

Load-bearing premise

The proof stands or falls on the claim that the sieve weights attached to the differences a^a - b^b stay bounded on average, no matter how large K becomes.

Editorial extensions

If this is right

  • A positive proportion of the positive integers are of the form two-almost-prime plus a^a.
  • The same second-moment template applies to other sparse sequences whose pairwise differences admit a comparable average singular-factor bound.
  • The density of P2 + {a^a} is at least some absolute positive constant for large N.
  • The method recovers the spirit of the earlier positive-density theorem for P2 + 2^p.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the average singular-factor bound can be made effective, an explicit numerical lower density for P2 + {a^a} becomes available.
  • The same period argument used for a^a mod p may extend the result to other exponential sequences such as a^{a+1} or a! with only minor changes.
  • A matching upper-density bound, or the existence of an arithmetic progression avoiding the sumset, remains open and would parallel the classical Romanoff picture.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper proves that the sumset P_2 + {a^a : a ≥ 1} has positive lower density (Theorem 1.1): there exists δ > 0 such that for all large N the number of n ≤ N of the form m + a^a with m ∈ P_2 is at least δN. The argument is a Romanoff second-moment method in the style of Li–Pan. The first moment follows from Landau’s asymptotic for #P_2 together with the rapid growth of a^a (so that ∑_{a≤K} a^a = O(N) with K ∼ log N / log log N). The second-moment off-diagonal terms are reduced, via a uniform upper-bound sieve for pairs of shifted P_2 (Lemma 2.3), to an average of the singular factors W_κ(a^a - b^b). The main new ingredient is Proposition 3.1, which shows that this average remains bounded by a constant C_κ independent of K, by splitting prime factors of a^a - b^b into small/medium/large ranges and using the period p(p-1) of the map x ↦ x^x (mod p).

Significance. The result is a natural and nontrivial extension of classical Romanoff-type theorems to the sparse sequence a^a, whose counting function up to N is of the same order as {2^p : p prime} or other familiar sparse sequences. The technical novelty lies in controlling the average arithmetic correlation of the nonlinear differences a^a - b^b; the period argument of Lemma 3.2 and the ensuing convergent series for the small-prime contribution are clean and appear reusable for other exponential or super-exponential shifts. The paper is self-contained, relies only on classical tools (Landau, Mertens, Selberg upper-bound sieve), and contains no fitted parameters or circularity. While δ is not computed and the constants are not optimized, the existence statement is of genuine interest in additive number theory and sits comfortably alongside Li–Pan and related works.

minor comments (5)
  1. The absolute constants C, c, κ_0, C_κ are left completely unspecified. While existence is enough for Theorem 1.1, a short remark on whether any of them can be made effective (or even a crude numerical upper bound for C_κ) would strengthen the presentation.
  2. In the proof of Lemma 2.3 the enlargement of κ_1 is invoked several times; a single sentence collecting the final dependence of κ_0 on the sieve constant c of Lemma 2.2 would make the bookkeeping clearer.
  3. Lemma 3.2 treats p = 2 as immediate; a one-line verification (or an explicit count of solutions of a^a ≡ b^b (mod 2)) would remove any residual ambiguity.
  4. The notation P(z) for the product of odd primes below z is standard but appears without definition on first use in the paragraph preceding Lemma 2.2; a brief parenthetical would help.
  5. A few typographical inconsistencies appear (e.g., spacing around a^a, the product symbol in the abstract versus the body). These are purely cosmetic.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: self-contained Romanoff second-moment argument with classical sieves and an elementary average singular-factor bound.

full rationale

The derivation of Theorem 1.1 is a standard first- and second-moment argument. The first moment uses Landau’s asymptotic for #P2 (Lemma 2.1), which is classical and independent of the target density. The second-moment off-diagonal terms are reduced by the uniform upper-bound sieve of Lemma 2.3 (itself obtained from Selberg’s sieve, Lemma 2.2) to the average of the singular factors W_κ0(a^a-b^b). That average is controlled by Proposition 3.1, proved by splitting primes into three ranges: medium and large contributions are bounded pointwise by Mertens and the crude size |h|≤K^K, while the small-prime contribution is reduced via the period-p(p-1) counting of Lemma 3.2 to a convergent series ∑_q τ(q-1)(log q)^κ/q^{2-ε}≪1. No parameters are fitted to data; the constants C_κ and δ are pure existence statements. The citation of Li–Pan is only motivational (“in the spirit of”), not load-bearing. Background tools (Landau, Mertens, Selberg) are external classical results. The argument is therefore self-contained and free of definitional, fitted-input, or self-citation circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper rests entirely on classical analytic-number-theory tools (Landau asymptotic, Mertens estimates, Selberg upper-bound sieve) plus elementary modular arithmetic for the map x o x^x. No free parameters are fitted; the constants that appear are absolute or depend only on the fixed sieve weight κ. No new physical or arithmetic entities are postulated.

assumptions (4)
  • standard math Landau’s asymptotic: #{m ≤ X : Ω(m) = r} ∼ (X / log X) (log log X)^{r-1} / (r-1)! (Lemma 2.1)
    Used for the first-moment count of P2 and for the diagonal second-moment contribution.
  • standard math Selberg upper-bound sieve for the product of two non-proportional linear forms (Lemma 2.2, citing Halberstam–Richert)
    Supplies the uniform estimate needed to bound correlations of two shifted P2 conditions.
  • standard math Mertens-type product estimates and the elementary bound au(n) ≪_ε n^ε
    Used both in the sieve lower bound for G(z) and in the convergence of the series that bounds the average singular factor.
  • standard math The map x o x^x mod p has period dividing p(p-1)
    Elementary fact used in Lemma 3.2 to count solutions of a^a ≡ b^b mod p.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Romanoff-type theorem for $P_2$+{$a^a$: a$\ge$ 1}." pith.science (2026). https://pith.science/paper/SFGFD7GN

@misc{pith2026260703662,
  author       = {Pith},
  title        = {Pith review of: A Romanoff-type theorem for $P_2$+$a^a$: a$\ge$ 1},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SFGFD7GN}},
  note         = {Machine review of arXiv:2607.03662}
}
abstract

Let $\Omega(n)$ denote the number of prime factors of $n$, counted with multiplicity, and put $P_2$={$m$ $\ge$ 1:$\Omega(m)$ $\le$ 2}. We prove that the sumset $P_2$+{$a^a$: a$\ge$ 1} has positive lower density. The proof uses the Romanoff second moment method, in the spirit of Li and Pan's theorem on $P_2$+$2^{\mathcal P}$. The main new ingredient is the following average estimate for the singular factor \[ \frac{1}{K(K-1)} \sum_{\substack{1\le a,b\le K\\a\ne b}} \prod_{p\mid a^a-b^b}\left(1+\frac{\kappa}{p}\right) \le C_\kappa \] for some constant $C_\kappa>0$, which is valid for all $K \ge 2$ and any fixed $\kappa>0$. This estimate controls the average arithmetic correlation among the shifts $a^a$ and allows the Romanoff argument to be carried out.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

33 extracted references · 1 linked inside Pith

  1. [1]

    On the sumset of the primes and a linear recurrence.Acta Arith., 161(1):33–46, 2013

    Christian Ballot and Florian Luca. On the sumset of the primes and a linear recurrence.Acta Arith., 161(1):33–46, 2013

    2013

  2. [2]

    A conjecture of Erd˝ os onp+ 2 k.Israel J

    Yong-Gao Chen. A conjecture of Erd˝ os onp+ 2 k.Israel J. Math., to appear

  3. [3]

    The minimal common difference of Erd˝ os’ infinite arithmetic progressions.Acta Math

    Yong-Gao Chen. The minimal common difference of Erd˝ os’ infinite arithmetic progressions.Acta Math. Hungar., to appear

  4. [4]

    On Romanoff’s constant.Journal of Number Theory, 106(2):275– 284, 2004

    Yong-Gao Chen and Xue-Gong Sun. On Romanoff’s constant.Journal of Number Theory, 106(2):275– 284, 2004

    2004

  5. [5]

    The sum of a prime and a term of exponential sequences.Acta Math

    Yong-Gao Chen and Rui-Jing Wang. The sum of a prime and a term of exponential sequences.Acta Math. Sinica (Chinese Ser.), 67(2):259–272, 2024

    2024

  6. [6]

    Some computational results on a conjecture of de Polignac about numbers of the formp+ 2 k.J

    Yuda Chen, Xiangjun Dai, and Huixi Li. Some computational results on a conjecture of de Polignac about numbers of the formp+ 2 k.J. Number Theory, 266:249–268, 2026

    2026

  7. [7]

    Arithmetic progressions not containing numbers of the formp+F n.The Fibonacci Quarterly, 63(2):336–344, 2025

    Yuda Chen and Huixi Li. Arithmetic progressions not containing numbers of the formp+F n.The Fibonacci Quarterly, 63(2):336–344, 2025

    2025

  8. [8]

    Polynomial analogue of Erd˝ os extension of the Romanoff theorem.J

    Lixia Dai and Hao Pan. Polynomial analogue of Erd˝ os extension of the Romanoff theorem.J. Number Theory, 279:45–55, 2026

    2026

Show all 33 references
  1. [9]

    de Polignac

    A. de Polignac. R´ ech` erches nouvelles sur les nombres premiers.C.R.Acad.Sci.Paris S´ er, pages 397–401, 1849

  2. [10]

    On computing the density of integers of the form 2 n +p.Mathematics of Computation, 89(325):2365–2386, 2020

    Gianna Del Corso, Ilaria Del Corso, Roberto Dvornicich, and Francesco Romani. On computing the density of integers of the form 2 n +p.Mathematics of Computation, 89(325):2365–2386, 2020

    2020

  3. [11]

    Extending an Erd˝ os result on a Romanov type problem.Archiv der Mathematik, 118(6):587–592, 2022

    Yuchen Ding. Extending an Erd˝ os result on a Romanov type problem.Archiv der Mathematik, 118(6):587–592, 2022

    2022

  4. [12]

    On a problem of Romanoff type.Acta Arith., 205(1):53–62, 2022

    Yuchen Ding. On a problem of Romanoff type.Acta Arith., 205(1):53–62, 2022

    2022

  5. [13]

    A generalization of the Romanoff theorem.International Journal of Number Theory, 22(01):163–173, 2026

    Yuchen Ding and Wenguang Zhai. A generalization of the Romanoff theorem.International Journal of Number Theory, 22(01):163–173, 2026

    2026

  6. [14]

    Sums of primes and quadratic linear recurrence sequences.Acta Math

    Art¯ uras Dubickas. Sums of primes and quadratic linear recurrence sequences.Acta Math. Sin. (Engl. Ser.), 29(12):2251–2260, 2013

    2013

  7. [15]

    On Romanov’s constant.Mathematische Zeitschrift, 288(3):713–724, 2018

    Christian Elsholtz and Jan-Christoph Schlage-Puchta. On Romanov’s constant.Mathematische Zeitschrift, 288(3):713–724, 2018

    2018

  8. [16]

    On integers of the form 2k +pand some related problems.Summa Brasil

    Paul Erd˝ os. On integers of the form 2k +pand some related problems.Summa Brasil. Math, 2:113–123, 1950

    1950

  9. [17]

    Some of my favourite problems in number theory, combinatorics, and geometry

    Paul Erd˝ os. Some of my favourite problems in number theory, combinatorics, and geometry. InResenhas, 165-186, 1995. 11

    1995

  10. [18]

    On integers of the formp+2k.Acta Arith., 122(1):45–50, 2006

    Laurent Habsieger and Xavier-Fran¸ cois Roblot. On integers of the formp+2k.Acta Arith., 122(1):45–50, 2006

    2006

  11. [19]

    An effective version of the Bombieri-Vinogradov theorem, and applications to Chen’s theorem and to sums of primes and powers of two.Arch

    Laurent Habsieger and Jimena Sivak-Fischler. An effective version of the Bombieri-Vinogradov theorem, and applications to Chen’s theorem and to sums of primes and powers of two.Arch. Math. (Basel), 95(6):557–566, 2010

    2010

  12. [20]

    Halberstam and H.-E

    H. Halberstam and H.-E. Richert.Sieve methods, volume No. 4 ofLondon Mathematical Society Mono- graphs. Academic Press [Harcourt Brace Jovanovich, Publishers], London-New York, 1974

    1974

  13. [21]

    An update on the Linnik–Goldbach and Romanov problems

    Daniel R Johnston and Tim Trudgian. An update on the Linnik–Goldbach and Romanov problems. arXiv preprint arXiv:2605.17825, 2026

    2026 arXiv

  14. [22]

    K. S. Enoch Lee. On the sum of a prime and a Fibonacci number.Int. J. Number Theory, 6(7):1669–1676, 2010

    2010

  15. [23]

    The Romanoff theorem revisited.Acta Arithmetica, 135:137–142, 2008

    Hongze Li and Hao Pan. The Romanoff theorem revisited.Acta Arithmetica, 135:137–142, 2008

    2008

  16. [24]

    The sum of a prime and a Fibonacci number.Int

    Zhixin Liu and Mengyuan Xue. The sum of a prime and a Fibonacci number.Int. J. Number Theory, 17(8):1815–1823, 2021

    2021

  17. [25]

    On Romanoff’s constant and its generalized problem.Adv

    Guangshi L¨ u. On Romanoff’s constant and its generalized problem.Adv. Math. (China), 36(1):94–100, 2007

    2007

  18. [26]

    J. Pintz. A note on Romanov’s constant.Acta Math. Hungar., 112(1-2):1–14, 2006

    2006

  19. [27]

    Computations concerning primes and powers of two.Calcolo, 20(3):319–336, 1983

    Francesco Romani. Computations concerning primes and powers of two.Calcolo, 20(3):319–336, 1983

    1983

  20. [28]

    Uber einige s¨ atze der additiven zahlentheorie.Math

    NP Romanov. Uber einige s¨ atze der additiven zahlentheorie.Math. Ann, 109:668–678, 1934

    1934

  21. [29]

    An explicit polynomial analogue of Romanoff’s theorem

    Igor E Shparlinski and Andreas J Weingartner. An explicit polynomial analogue of Romanoff’s theorem. Finite Fields and Their Applications, 44:22–33, 2017

    2017

  22. [30]

    Integers of the formp+a k.J

    Xue-Gong Sun. Integers of the formp+a k.J. Nanjing Norm. Univ. Nat. Sci. Ed., 27(1):20–23, 2004

    2004

  23. [31]

    American Mathematical Soc., 2015

    G´ erald Tenenbaum.Introduction to analytic and probabilistic number theory, volume 163. American Mathematical Soc., 2015

    2015

  24. [32]

    On de Polignac’s conjecture.Simon Stevin, 27:99–105, 1950

    JG Van Der Corput. On de Polignac’s conjecture.Simon Stevin, 27:99–105, 1950

    1950

  25. [33]

    On the sum of a Fibonacci number and a prime.Int

    Rui-Jing Wang and Yong-Gao Chen. On the sum of a Fibonacci number and a prime.Int. J. Number Theory, 19(4):873–889, 2023. School of Mathematics, Yangzhou University, Yangzhou 225002, People’s Republic of China; HUN-REN Alfr ´ed R´enyi Institute of Mathematics, Budapest, Pf. 12...

    2023

Pith tools

Reviewed July 12, 2026 · model on record in the stance chip above.