Let {ak}k≥1 be an infinite strictly increasing sequence of positive integers with ak∣ak+1 for every integer k≥1. Dai and Pan proved that the set of integers of the form p2+q2+ak+al, where p,q are primes and k,l≥1, has positive lower asymptotic density if limsupk→∞klogak<∞ and supk≥1∑d∣akd1<∞. They also asked whether the latter condition is necessary. In this paper, we show that this condition is necessary by proving that if supk≥1∑d∣akd1=∞, then this set has asymptotic density zero.
Introduction
Let N be the set of all positive integers. For a set A⊆N, write A(x)=∣A∩[1,x]∣. Its lower and upper asymptotic densities are defined by
d(A)=x→∞liminfxA(x),d(A)=x→∞limsupxA(x),
respectively. If d(A)=d(A), then its asymptotic density exists and is denoted by d(A).
has positive lower asymptotic density. This result has been generalized in various directions; see [1, 2, 3, 4, 6, 8, 9, 10, 12, 13, 14, 16, 18, 19, 20].
In 1950, Erdős [11 Theorem 4] extended Romanoff’s theorem to strictly increasing sequences {ak}k≥1 of positive integers satisfying ak∣ak+1. He proved that the set {p+ak:p is prime and k≥1} has positive lower asymptotic density if and only if
k→∞limsupklogak<∞(1)
and
k≥1supd∣ak∑d1<∞.(2)
Liu, Liu and Zhan [15] considered an analogue of Romanoff’s theorem for sums of two prime squares and proved that
{p2+q2+2k+2l:p,q are primes and k,l≥0}
has positive lower asymptotic density. Recently, Dai and Pan [5 Theorem 1.1] extended the result of Liu, Liu and Zhan to strictly increasing sequences {ak}k≥1 of positive integers with ak∣ak+1 satisfying (1.1) and (1.2). They proved the following result.
Theorem 1.1 ([5], Theorem 1.1). Let {ak}k≥1 be an infinite strictly increasing sequence of positive integers such that ak∣ak+1 for every integer k≥1. If {ak}k≥1 satisfies (1.1) and (1.2), then the set
{p2+q2+ak+al:p,q are primes and k,l≥1}
has positive lower asymptotic density.
In [5 Remark], they noted that (1.1) is necessary and asked whether (1.2) is necessary. In this paper, we answer this question by proving the following result.
Theorem 1.2. Let {ak}k≥1 be an infinite strictly increasing sequence of positive integers such that ak∣ak+1 for every integer k≥1. If
k≥1supd∣ak∑d1=∞,
then the set
{p2+q2+ak+al:p,q are primes and k,l≥1}
has asymptotic density zero.
Combining Theorems 1.1 and 1.2 with the necessity of (1.1), we obtain the following result.
Corollary 1.3. Let {ak}k≥1 be an infinite strictly increasing sequence of positive integers such that ak∣ak+1 for every integer k≥1. Then the set
{p2+q2+ak+al:p,q are primes and k,l≥1}
has positive lower asymptotic density if and only if (1.1) and (1.2) hold.
Throughout this paper, p and q denote primes, π(x) denotes the number of primes not exceeding x, and φ is Euler’s totient function. For functions f(x) and g(x) with g(x)>0, we write f(x)=O(g(x)) if there exists a constant C>0 such that ∣f(x)∣≤Cg(x) for all sufficiently large x, and f(x)=o(g(x)) if f(x)/g(x)→0 as x→∞.
Preliminary lemmas
For an odd prime q, let
χ(q)={1,−1,q≡1(mod4),q≡3(mod4).
Lemma 2.1. Let F be a nonempty finite set of odd primes, and let
For any pair of primes (p,q), if (pq,Q)=1, then there exist integers 1≤u,v<Q with (uv,Q)=1 such that p≡u(modQ) and q≡v(modQ), and so p2+q2≡u2+v2(modQ) and T(p2+q2)=T(u2+v2). Hence,
Fix a nonempty finite set F⊆P∖{2}, and let H,Q,T be as in Lemma 2.1. Since F is a finite set and ak∣ak+1 for every integer k≥1, it follows that there exists K≥1 such that Q∣aK, and so
Q∣ak(k≥K),T(p2+q2+ak+al)=T(p2+q2)(k,l≥K).(14)
Since the positive sequence {ak}k≥1 is strictly increasing and ak∣ak+1 for every integer k≥1, it follows that
ak≥2ak−1≥⋯≥2k−1a1≥2k−1.
Therefore
A(X)≤1+log2logX.(15)
If n≤X and n=p2+q2+ak+al, then p,q≤X and ak,al≤X. The number of integers of the form n=p2+q2+ak+al with n≤X and either k<K or l<K is at most
2(K−1)A(X)π(X)2=OF(logXX)=oF(X).(16)
For any integer of the form n=p2+q2+ak+al with n≤X and k,l≥K, we consider two cases.
Case 1.T(n)≥H/2. By (10), the number of such integers is at most
{1≤n≤X:T(n)≥2H}≤H4X+OF(1).(17)
Case 2.T(n)<H/2. By (14) and (11), the number of such integers is at most
a contradiction with d(S(A))>0. Hence (1.1) holds. This completes the proof of Corollary 1.3. □
Acknowledgments
This work was supported by the National Natural Science Foundation of China (Grant No. 12371005).
References
[1]Ballot, C., Luca, F.: On the sumset of the primes and a linear recurrence. Acta Arith. 161, 33–46 (2013).DOI
[2]Chen, Y.-G.: Romanoff theorem in a sparse set. Sci. China Math. 53, 2195–2202 (2010).
[3]Chen, Y.-G., Sun, X.-G.: On Romanoff’s constant. J. Number Theory 106, 275–284 (2004).DOI
[4]Chen, Y.-G., Xu, J.-Z.: On integers of the form p + 2^{k_1}^{r_1} + ··· + 2^{k_t}^{r_t}. J. Number Theory 258, 66–93 (2024).
[5]Dai, L.-X., Pan, H.: On Erdős’ generalization of the Romanoff theorem. J. Number Theory 291, 65–73 (2027).DOI
[6]Dai, L.-X., Pan, H.: Polynomial analogue of Erdős’ extension of the Romanoff theorem. J. Number Theory 279, 45–55 (2026).
[7]Davenport, H.: Multiplicative Number Theory, 3rd edn. Revised by H.L. Montgomery. Graduate Texts in Mathematics, vol. 74. Springer, New York (2000).
[8]Ding, Y.-C., Verwee, J.: Short intervals for the Romanoff-type sumset. J. Number Theory 289, 114–131 (2026).DOI
[9]Ding, Y.-C., Zhou, H.-Y.: Romanoff’s theorem for polynomials over finite fields revisited. Acta Arith. 200, 1–15 (2021).DOI
[10]Dubickas, A.: Sums of primes and quadratic linear recurrence sequences. Acta Math. Sin. (Engl. Ser.) 29, 2251–2260 (2013).
[11]Erdős, P.: On integers of the form 2^k + p and some related problems. Summa Brasil. Math. 2, 113–123 (1950).
[12]Kuan, Y.-L.: A function field analogue of Romanoff’s theorem. Int. J. Number Theory 11, 2161–2173 (2015).DOI
[13]Lee, K.S.E.: On the sum of a prime and a Fibonacci number. Int. J. Number Theory 6, 1669–1676 (2010).arxiv.org/abs/1011.0173