Next Article in Journal
Short-Distance Physics with Rare Kaon Decays
Previous Article in Journal
Dual-Loop μ-Synthesis Direct Thrust Control for Turbofan Engines
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Goldbach–Linnik–Type Problem of Symmetric Mixed Powers of Primes and Powers of Two

1
Department of Mathematics, China University of Mining and Technology, Beijing 100083, China
2
School of Applied Science, Beijing Information Science and Technology University, Beijing 100192, China
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(8), 945; https://doi.org/10.3390/sym16080945
Submission received: 2 June 2024 / Revised: 17 July 2024 / Accepted: 18 July 2024 / Published: 24 July 2024
(This article belongs to the Section Mathematics)

Abstract

:
This article demonstrates that every sufficiently large odd integer can be expressed as the sum of one square of a prime, six cubes of primes, and 23 powers of two. This finding represents an improvement on the previous results of Sinnadurai in 1965 and Hooley in 1981.

1. Introduction and Main Result

It is highly probable that for each s > 1 , every sufficiently large integer can be represented as the sum of one square and s k-th powers of positive integers with k 3 . To be specific, our focus will be on the Diophantine equation
N = x 2 + y 1 k + y 2 k + + y s k ,
where s , k N are natural numbers with k 3 . This family of equations is a subset of the variants of Waring’s problem, which have been extensively studied by various scholars since the early applications of the Hardy–Littlewood method. A purely heuristic application of this method, based solely on major arc analysis, suggests that the number R k , s ( N ) of solutions to (1) in natural numbers x , y 1 , , y s adheres to the asymptotic relation
R k , s ( N ) = Γ ( 3 2 ) Γ s ( 1 + 1 k ) Γ ( 1 2 + s k ) S k , s ( N ) N s k 1 2 ( 1 + o ( 1 ) )
as N + , provided that s > k 2 . Here, the singular series is defined by
S k , s ( N ) = q = 1 1 q s + 1 a = 1 ( a , q ) = 1 q x = 1 q e a x 2 q y = 1 q e a y k q s e a N q ,
where e ( a ) = e 2 π i a . The first analysis of the problem was conducted by Stanley [1] in 1930. Following the methodology established by Hardy and Littlewood [2,3] in their classic series “Partitio Numerorum”, Stanley [1] formulated the asymptotic Formula (2) for s s 1 ( k ) , where
s 1 ( 3 ) = 7 , s 1 ( 4 ) = 14 , s 1 ( 5 ) = 28 , s 1 ( k ) = 2 k 3 ( k 2 ) + O ( k ) ( k > 5 ) .
Later, Sinnadurai [4] verified (2) for R 3 , 6 ( N ) , and Hooley [5] provided a different proof for this result. However, when k 4 , the authors are unaware of any improvements on Stanley’s bounds (3) documented in the literature. Yet, since the 1920s, the theory of Waring’s problem has experienced waves of innovation, resulting in significantly smaller lower bounds for s for which (2) can be demonstrated. The latest developments indicate that for k 3 and s 2 k 1 + 2 , then for any ε > 0 , one can demonstrate that
R k , s ( N ) = Γ ( 3 2 ) Γ s ( 1 + 1 k ) Γ ( 1 2 + s k ) S k , s ( N ) N s k 1 2 + O N s k 1 2 1 k · 2 k 1 + ε .
Moreover, there exists a function s 0 ( k ) that satisfies
s 0 ( k ) k 2 2 log k + O ( k 2 log log k ) ,
and ensures that (4) holds whenever s s 0 ( k ) . Notably, when k = 3 we may take s = 6 , thereby including the formula R 3 , 6 ( n ) as already established by Sinnadurai [4] and Hooley [5] within (4).
Given the result of Sinnadurai [4] and Hooley [5], it is reasonable to conjecture that for every sufficiently large odd integer N, the following equation is solvable:
N = p 2 + p 1 3 + p 2 3 + p 3 3 + p 4 3 + p 5 3 + p 6 3
where p (with or without a subscript) denotes a prime number. But this conjecture is perhaps out of reach at present. Motivated by this conjecture and the famous works of Linnik [6,7] and Gallagher [8] for representing a sufficiently large even integer N as sums of two primes and powers of 2, we consider the corresponding approximation of (5). For the literature on this topic, one can refer to [9,10,11,12].
In this paper, we focus on the symmetric approximation of the conjecture (5) and establish the following theorem:
Theorem 1.
Every sufficiently large odd integer can be represented as a sum of one square of a prime, six cubes of primes and 23 powers of two.
Notation. 
Throughout this paper, let p always denote a prime number with or without subscripts; ε always denotes an arbitrarily small positive number, which may not be the same at different occurrences. We use e ( α ) to represent e 2 π i α . Furthermore, φ ( n ) stands for Euler’s function.

2. Outline of the Proof of Theorem 1

Let N be a sufficiently large odd integer and η be a fixed positive constant which satisfies η 10 100 . Write
U 2 = ( 1 η ) N 8 1 2 , U 3 = ( 1 η ) N 16 1 3 , P 3 = η N 4 1 3 , V 3 = U 3 5 6 , L = log ( N / log N ) log 2 ,
and
H ( α ) = 1 v L e ( 2 v α ) , F ( α ) = U 2 < p 2 U 2 ( log p ) e ( p 2 α ) , S 1 ( α ) = U 3 < p 2 U 3 ( log p ) e ( p 3 α ) , S 2 ( α ) = P 3 < p 2 P 3 ( log p ) e ( p 3 α ) , T ( α ) = V 3 < p 2 V 3 ( log p ) e ( p 3 α ) .
Define
R ( k , N ) : = N = p 1 2 + p 2 3 + p 3 3 + p 4 3 + p 5 3 + p 6 3 + p 7 3 + 2 v 1 + + 2 v k U 2 < p 1 2 U 2 , U 3 < p 2 , p 3 2 U 3 , P 3 < p 4 , p 5 2 P 3 V 3 < p 6 , p 7 2 V 3 , 1 v k L ( log p 1 ) ( log p 2 ) ( log p 7 ) .
To apply the circle method, we define
Q 1 = N 25 / 216 2 ε , Q 2 = N 191 / 216 + ε .
Then, we define the major arcs M and minor arcs m as follows
M = q Q 1 1 a q ( a , q ) = 1 M ( q , a ) , m = 1 Q 2 , 1 + 1 Q 2 M ,
where
M ( q , a ) = a q 1 q Q 2 , a q + 1 q Q 2 .
By the orthogonality of the exponential sum, one has
R ( k , N ) = 0 1 F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α = M + m F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α = I ( k , M , N ) + I ( k , m , N ) .
To prove Theorem 1, we need the two propositions below, which will be proved in Section 3 and Section 4, respectively.
Proposition 1.
Suppose that k = 23 . Define M as in (8). Then we have
I ( k , M , N ) 0.14457265 · η 2 / 3 ( 1 η ) 13 / 18 N 25 / 18 4 19 / 9 L k .
Proposition 2.
Suppose that k = 23 . Define m as in (8). Then we have
| I ( k , m , N ) | 8.499467692 λ k η 2 / 3 ( 1 η ) 13 / 18 N 25 / 18 4 19 / 9 L k + O η 2 / 3 ( 1 η ) 13 / 18 N 25 / 18 4 19 / 9 L k 1 ,
where λ = 0.83372131691 .

3. Proof of Proposition 1

In this section, we shall investigate the lower bound of I ( k , M , N ) . Some preliminaries have to be given first. Let
C 2 ( q , a ) = m = 1 ( m , q ) = 1 q e a m 2 q , C 3 ( q , a ) = m = 1 ( m , q ) = 1 q e a m 3 q , B ( n , q ) = a = 1 ( a , q ) = 1 q C 2 ( q , a ) C 3 6 ( q , a ) e a n q , A ( n , q ) = B ( n , q ) φ 7 ( q ) .
where φ ( n ) stands for Euler’s function.
Proposition 3.
Let M and m be defined as in (8), and consider N / 2 < n N . Then we have
M F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α = 1 2 · 3 6 S ( n ) J ( n ) + O N 25 / 18 L 1 ,
where S ( n ) is a singular series defined by
S ( n ) = q = 1 A ( n , q ) .
Furthermore, for any odd integer n, S ( n ) is absolutely convergent and satisfies
0 < c * S ( n ) 1
with some fixed positive constant c * , while
J ( n ) = n = m 1 + m 2 + m 3 + m 4 + m 5 + m 6 + m 7 U 3 3 < m 2 , m 3 8 U 3 3 P 3 3 < m 4 , m 5 8 P 3 3 V 3 3 < m 6 , m 7 8 V 3 3 U 2 2 < m 1 4 U 2 2 m 1 1 / 2 ( m 2 m 3 m 4 m 5 m 6 m 7 ) 2 / 3 N 25 / 18 .
Proof. 
The proof of Proposition 3 is exactly the same as that of Proposition 2.1 of Zhang and Li [13], hence we omit the details herein. □
For k 1 , we define
S k ( q , a ) = m = 1 q e a m k q .
Lemma 1.
Assume that ( p , a ) = 1 . Then
S k ( p , a ) = χ A k χ ( a ) ¯ τ ( χ ) ,
where A k is the set of non-principal characters χ modulo p for which χ k is principal, and τ ( χ ) signifies the Gauss sum
m = 1 p χ ( m ) e m p .
In addition, it holds that | τ ( χ ) | = p 1 / 2 and | A k | = ( k , p 1 ) 1 .
Proof. 
This conclusion is supported by Lemma 4.3 found in Vaughan [14]. □
Lemma 2.
Suppose that k = 23 . Let Ξ ( N , k ) = { ( 1 η ) N n N : n = N 2 v 1 2 v 2 2 v k , 1 v 1 , , v k L } . Then, for N 1 ( mod 2 ) , one has
n Ξ ( N , k ) n 1 ( mod 2 ) S ( n ) 0.98815819 L k .
Proof. 
Let C 2 ( q , a ) , C 3 ( q , a ) , B ( n , q ) and A ( n , q ) be defined as in (9). By Lemma 1, for p 5 , ( p , a ) = 1 and p 2 ( mod 3 ) , we have C 3 ( p , a ) = 1 . In order to obtain an appropriate lower bound for B ( n , p ) with p 2 ( mod 3 ) , we define the notation
G ( χ , n ) = h = 1 p χ ( h ) e h n p , c q ( n ) = h = 1 ( h , q ) = 1 q e h n q ,
where c q ( n ) is the Ramanujan sum. By Theorem 7.5.4 in [15], for p 5 , we have
C 2 ( p , a ) = S 2 ( p , a ) 1 = χ ( a ) S 2 ( p , 1 ) 1 ,
where χ ( · ) is the Legendre symbol ( · p ) . Thus, if p 2 ( mod 3 ) , we can write B ( n , p ) as
B ( n , p ) = S 2 ( p , 1 ) G ( χ , n ) c p ( n ) .
By Theorem 7.5.5 and Theorem 7.5.8 of Hua [15], we have
S 2 ( p , 1 ) = p , if p 1 ( mod 4 ) , i p , if p 3 ( mod 4 ) ,
and
| G ( χ , n ) | = p , if p n , 0 , if p | n , c p ( n ) = 1 , if p n , p 1 , if p | n ,
and thus B ( n , p ) ( p 1 ) for p 2 ( mod 3 ) .
For p 1 ( mod 3 ) , by Lemma 1, we have
| B ( n , p ) | = | a = 1 p 1 C 2 ( p , a ) C 3 6 ( p , a ) e a n p | ( p 1 ) ( p + 1 ) ( 2 p + 1 ) 6 .
Combining the above two cases, we obtain the following result:
p 300 ( 1 + A ( n , p ) ) p 300 p 2 ( mod 3 ) 1 1 ( p 1 ) 6 × p 300 p 1 ( mod 3 ) 1 ( p + 1 ) ( 2 p + 1 ) 6 ( p 1 ) 6 .
On the one hand, we have the numerical lower bound
300 p p 10000 p 2 ( mod 3 ) 1 1 ( p 1 ) 6 × 300 p p 10000 p 1 ( mod 3 ) 1 ( p + 1 ) ( 2 p + 1 ) 6 ( p 1 ) 6 0.9992282 ,
where the p r denotes the r-th prime. On the other hand, there holds
p > p 10000 1 + A ( n , p ) p > p 10000 1 1 p 2 0.99999923688927 .
Thus,
p 300 ( 1 + A ( n , p ) ) 0.9992274374 = : C 1 .
Set P = { 3 , 7 , 13 } . By noting that n 1 ( mod 2 ) , N 1 ( mod 2 ) and v j 1 with j = 1 , 2 , , k , we deduce that
n Ξ ( N , k ) n 1 ( mod 2 ) S ( n ) min n Ξ ( N , k ) n 1 ( mod 2 ) p P 1 + A ( n , p ) n Ξ ( N , k ) p P ( 1 + A ( n , p ) ) min n Ξ ( N , k ) n 1 ( mod 2 ) p P 2 p < 300 ( 1 + A ( n , p ) ) min n Ξ ( N , k ) n 1 ( mod 2 ) p 300 1 + A ( n , p ) × n Ξ ( N , k ) p P 1 + A ( n , p ) 0.98895427533 C 1 n Ξ ( N , k ) p P ( 1 + A ( n , p ) ) 0.98819024 1 j q n Ξ ( N , k ) n j ( mod q ) p P ( 1 + A ( n , p ) ) = 0.98819024 1 j q p P ( 1 + A ( j , p ) ) n Ξ ( N , k ) n j ( mod q ) 1 ,
where q = p P p . For an odd q, denote by ϱ ( q ) the smallest positive integer ϱ such that 2 ϱ ( q ) 1 ( mod q ) . Then the inner sum in (12) becomes
S : = n Ξ ( N , k ) n j ( mod q ) 1 = L ϱ ( q ) + O ( 1 ) k 1 v 1 , , v k ϱ ( q ) 2 v 1 + + 2 v k N j ( mod q ) 1 .
By noting that
S = L ϱ ( q ) + O ( 1 ) k 1 q s = 0 q 1 e s ( j N ) q 1 ν ϱ ( q ) e s 2 ν q k ,
we have
S L ϱ ( q ) + O ( 1 ) k 1 q ϱ k ( q ) ( q 1 ) max 1 s q 1 | 1 ν ϱ ( q ) e s 2 ν q | k = L k q 1 ( q 1 ) 1 ϱ ( q ) max 1 s q 1 | 1 ν ϱ ( q ) e s 2 ν q | k + O ( L k 1 ) .
It should be noted that q = 273 , and hence ϱ ( q ) = 12 . It is easy to check that
max 1 s q 1 | 1 ν ϱ ( q ) e s 2 ν q | < 6.00001 ,
and
( q 1 ) 1 ϱ ( q ) max 1 s q 1 | 1 ν ϱ ( q ) e s 2 ν q | 23 0.000032425 .
Therefore
S ( 1 0.000032425 ) L k q + O ( L k 1 ) ,
and
n Ξ ( N , k ) n 1 ( mod 2 ) S ( n ) 0.98819024 1 j q p P ( 1 + A ( j , p ) ) ( 1 0.000032425 ) L k q + O ( L k 1 ) = 0.98819024 ( 1 0.000032425 ) L k q p P j = 1 p ( 1 + A ( j , p ) ) + O ( L k 1 ) .
Observing that
j = 1 p ( 1 + A ( j , p ) ) = p + 1 ( p 1 ) 7 a = 1 p 1 C 2 ( p , a ) C 3 6 ( p , a ) j = 1 p e a j q = p ,
one has
n Ξ ( N , k ) n 1 ( mod 2 ) S ( n ) 0.98815819 L k + O ( L k 1 ) .
This completes the proof of Lemma 2. □
Lemma 3.
For ( 1 η ) N n N and J ( n ) defined by (10), we have
J ( n ) 213.3129454 η 2 / 3 ( 1 η ) 13 / 18 N 25 / 18 4 19 / 9 L k .
Proof. 
The sum J ( n ) is defined over the domain which can be represented as
D = { ( m 1 , , m 7 ) : U 2 2 < m 1 4 U 2 2 , U 3 3 < m 2 , m 3 8 U 3 3 , P 3 3 < m 4 , m 5 8 P 3 3 , V 3 3 < m 6 , m 7 8 V 3 3 , n = m 1 + m 2 + + m 7 } .
To provide the lower bound for J ( n ) , we define
D * = { ( m 1 , , m 7 ) : U 2 2 < m 1 1 14 η 2 N , U 3 3 < m 3 7 U 3 3 + 3 η 2 N , U 3 3 < m 2 8 U 3 3 , m 2 + m 3 9 U 3 3 , P 3 3 < m 4 , m 5 8 P 3 3 , V 3 3 < m 6 , m 7 8 V 3 3 , m 2 = n m 1 m 3 m 4 m 5 m 6 m 7 } .
By the definition of D * , one deduces that
U 3 3 < n m 1 m 3 5 η N n m 1 m 3 m 4 m 5 m 6 m 7 = m 2 9 U 3 3 m 3 = 8 U 3 3 .
Therefore, D * is a subset of D . By the elementary estimate
α < m β m ν ( 1 η ) ( 1 ν ) 1 ( β 1 ν α 1 ν ) ,
we derive that
J ( n ) ( m 1 , , m 7 ) D m 1 1 / 2 ( m 2 m 3 m 4 m 5 m 6 m 7 ) 2 / 3 U 2 2 < m 1 4 U 2 2 m 1 1 / 2 × P 3 3 < m 4 , m 5 8 P 3 3 ( m 4 m 5 ) 2 / 3 × V 3 3 < m 6 , m 7 8 V 3 3 ( m 6 m 7 ) 2 / 3 × U 3 3 < m 3 7 U 3 3 + 3 η N / 2 ( 9 U 3 3 m 3 ) m 3 2 / 3 ( 1 η ) 5 · 2 · 3 4 · 1 14 η 2 N 1 / 2 1 η 8 N 1 / 2 P 3 2 V 3 2 × U 3 3 < m 3 7 U 3 3 + 3 η N / 2 ( 9 U 3 3 m 3 ) m 3 2 / 3 ( 1 η ) 5 · 2 · 3 4 · ( 1 η ) 2 1 / 2 8 1 / 2 N 1 / 2 P 3 2 V 3 2 × U 3 3 < m 3 7 U 3 3 + 3 η N / 2 ( 9 U 3 3 m 3 ) m 3 2 / 3 .
Regarding the sum on the right side of the above inequality, applying partial summation yields the following:
U 3 3 < m 3 7 U 3 3 + 3 η N / 2 ( 9 U 3 3 m 3 ) m 3 2 / 3 ( 1 η ) U 3 3 7 U 3 3 + 3 η 2 N ( 9 U 3 3 u ) u 2 / 3 d u ( 1 η ) U 3 1 1 7 ( 9 t ) t 2 / 3 d t 0.931080434 U 3 1 ,
which, combined with (15) and the identity N = ( 1 η ) 1 16 U 3 3 , implies that
J ( n ) ( 1 η ) 5 · 2 · 3 4 · ( 1 η ) 2 1 / 2 8 1 / 2 · 0.931080434 U 3 1 N 1 / 2 P 3 2 V 3 2 213.3129454 · P 3 2 U 3 1 / 2 V 3 2 .
This completes the proof of Lemma 3. □
For k = 23 , it should be noted that
H k ( α ) e ( N α ) = n Ξ ( N , k ) e ( n α ) ,
which combined with (11) and (14) yields
I ( k , M , N ) = n Ξ ( N , k ) n 1 ( mod 2 ) M F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) e ( n α ) d α = n Ξ ( N , k ) n 1 ( mod 2 ) 1 2 · 3 6 S ( n ) J ( n ) + O N 25 / 18 L 1 1 1458 × 213.3129454 × P 3 2 U 3 1 / 2 V 3 2 × n Ξ ( N , k ) n 1 ( mod 2 ) S ( n ) + O N 25 / 18 L k 1 0.14457265 · P 3 2 U 3 1 / 2 V 3 2 L k .
This completes the proof of Proposition 1.

4. Proof of Proposition 2

In this section, we present the upper bound estimate for I ( k , m , N ) . To achieve this, we further divide the minor arc m . We propose the following definition:
E ( λ ) = α ( 0 , 1 ] : | H ( α ) | λ L .
Then, we have
I ( k , m , N ) = m F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α = m E ( λ ) + m E ( λ ) F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α = I ( k , m E ( λ ) , N ) + I ( k , m E ( λ ) , N ) .
Lemma 4.
Suppose that α is a real number, and that there exist integers a Z and q N satisfying
( a , q ) = 1 , 1 q N 3 / 4 , | q α a | N 3 / 4 .
Then, we have
F ( α ) U 2 1 1 / 8 + ε + U 2 1 + ε q ( 1 + N | α a / q | ) .
Proof. 
See Theorem 3 of Kumchev [16]. □
Lemma 5.
For α m , we have
F ( α ) N 191 / 432 + ε .
Proof. 
By Dirichlet’s lemma on rational approximation (e.g., see Lemma 2.1 of Vaughan [14]), each real number α m can be written as
α = a q + λ , ( a , q ) = 1 , | λ | 1 q Q 0 ,
with 1 q Q 0 = N 3 / 4 . Since α m , it follows that q > Q 1 or q Q 1 = N 25 / 216 2 ε with | λ | > ( q Q 2 ) 1 . Therefore, one always has
q ( 1 + N | λ | ) > min Q 1 , N Q 2 1 N 25 / 216 2 ε .
By Lemma 4, we obtain
sup α m | F ( α ) | U 2 1 1 / 8 + ε + U 2 1 + ε N 25 / 216 2 ε N 191 / 432 + ε ,
which completes the proof of Lemma 5. □
For A ( U 3 , 2 U 3 ] N , where N denotes the set of natural numbers, and we define
g ( α ) = g A ( α ) = n A ( log n ) e ( n 3 α ) ,
and the multiplicative function w 3 ( q ) by
w 3 ( q ) = 3 p u 1 / 2 , if u 0 , v = 1 , p u 1 , if u 0 , 2 v 3 ,
we then have the following lemma:
Lemma 6.
Let M denote the union of the intervals M ( q , a ) for 1 a q P 3 3 / 4 and ( a , q ) = 1 , where
M ( q , a ) = α : | q α a | P 3 9 / 4 .
Let G ( α ) and h ( α ) be integrable functions of period one. Then, for any measurable set m ( 0 , 1 ] , we have
m g ( α ) G ( α ) h ( α ) d α N 1 / 3 J 0 1 / 4 m | G ( α ) | 2 d α 1 / 4 J 1 / 2 ( m ) + N 7 / 24 + ε J ( m ) ,
where
J ( m ) = m | G ( α ) h ( α ) | d α , J 0 = sup β ( 0 , 1 ] M w 3 2 ( q ) | h ( α + β ) | 2 ( 1 + P 3 3 | α a / q | ) 2 d α .
Proof. 
See Lemma 3.1 of Zhao [17]. □
In order to give appropriate an upper bound estimate of I ( k , m E ( λ ) , N ) , one needs to consider the measure of the set E ( λ ) . We have the following lemma:
Lemma 7.
Let
H h ( α ) = n = 0 h 1 e ( 2 n α ) , F ( ξ , h ) = 1 2 h r = 0 2 h 1 exp ξ · H h 2 h r .
Then, it holds that
meas ( E ( λ ) ) N E ( λ ) ,
where
E ( λ ) = ξ λ log 2 log F ( ξ , h ) h log 2 ε log 2
for any h N , ξ > 0 and ε > 0 .
Proof. 
See the arguments on pp. 562–565 of Heath–Brown and Puchta [18]. □
Lemma 8.
Let E ( λ ) be defined as in Lemma 7. Then, one has
E ( 0.83372131691 ) > 2 3 + 10 10 .
Proof. 
Taking ξ = 1.0835751541553 , h = 40 as in Lemma 7, we deduce the desired conclusion immediately. □
Lemma 9.
Let F ( α ) , S 1 ( α ) , S 2 ( α ) and T ( α ) be defined as in (7). Then we have
( i ) 0 1 | S 1 4 ( α ) T 4 ( α ) | d α 7.3909 U 3 V 3 4 ; ( ii ) 0 1 | F 2 ( α ) T 4 ( α ) | d α N 10 / 9 + ε ; ( iii ) 0 1 | F 2 ( α ) S i 2 ( α ) T 2 ( α ) | d α N 11 / 9 + ε , ( i = 1 , 2 ) .
Proof. 
For (i), one can see Lemma 2.6 of Liu [19]. For (ii) and (iii), one can see Lemma 2.3 of Liu [20]. □
Lemma 10.
Let F ( α ) , S 2 ( α ) be defined as in (7). Then we have
0 1 | F 2 ( α ) S 2 4 ( α ) | d α 9.77431043494196 P 3 4 .
Proof. 
We can deduce from the arguments on page 417 of [21] that
0 1 | F 2 ( α ) S 2 4 ( α ) | d α ( 8 + o ( 1 ) ) · S · I ˜ ,
where
S = q = 1 A ( q ) , A ( q ) = 1 φ 6 ( q ) a = 1 ( a , q ) = 1 q | C 2 2 ( q , a ) C 3 4 ( q , a ) | ,
I ˜ = 1 2 2 · 3 4 m 1 + m 2 + m 3 = n 1 + n 2 + n 3 P 3 3 < m 2 , m 3 , n 2 , n 3 8 P 3 3 U 2 2 < m 1 , n 1 4 U 2 2 ( m 1 n 1 ) 1 / 2 ( m 2 m 3 n 2 n 3 ) 2 / 3 .
From Lemma 8.3 of Hua [22], we know that A ( q ) is multiplicative and A ( p j ) = 0 for j 2 . Therefore, we have
S = p 1 + A ( p ) .
By Lemma 1, we have
1 + A ( p ) 1 + ( p + 1 ) 2 ( 2 p + 1 ) 4 ( p 1 ) 5 .
Then, we obtain
p 301 ( 1 + A ( p ) ) < 1.0093278341 .
By simple calculation, it is easy to see that
2 p 300 ( 1 + A ( p ) ) < 3.49275743638 .
Thus, we obtain
S = 2 p 300 1 + A ( p ) p 301 1 + A ( p ) < 3.52533729815 .
For I ˜ , by noting that
m 1 = n 1 + n 2 + n 3 m 2 m 3 n 1 + 2 P 3 3 16 P 3 3 1 29 8 η n 1 ,
and
P 3 3 < m 8 P 3 3 m 2 / 3 3 P 3 , U 2 2 < m 4 U 2 2 m 1 2 log 2 ,
one deduces that
I ˜ 1 2 2 · 3 4 m 1 + m 2 + m 3 = n 1 + n 2 + n 3 P 3 3 < m 2 , m 3 , n 2 , n 3 8 P 3 3 U 2 2 < m 1 , n 1 4 U 2 2 1 29 8 η 1 / 2 n 1 1 m 2 m 3 n 2 n 3 2 / 3 1 2 2 · 3 4 1 + 29 8 η · ( 2 log 2 ) · ( 3 P 3 ) 4 log 2 2 + 2 η P 3 4 .
Combining (17), (18) and (19), we have
0 1 | F 2 ( α ) S 2 4 ( α ) | d α 9.77431044 P 3 4 .
This completes the proof of Lemma 10. □
It follows from Lemma 9, Lemma 10 and the Cauchy–Schwarz inequality that
0 1 | F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) | d α 0 1 | F 2 ( α ) S 2 4 ( α ) | d α 1 / 2 0 1 | S 1 4 ( α ) T 4 ( α ) | d α 1 / 2 ( 9.77431044 P 3 4 ) 1 / 2 · ( 7.3909 U 3 V 3 4 ) 1 / 2 8.499467692 P 3 2 U 3 1 / 2 V 3 2 ,
which, combined with the definition of E ( λ ) in (16), yields:
| m E ( λ ) F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α | ( λ L ) k · 0 1 | F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) | d α 8.499467692 λ k P 3 2 U 3 1 / 2 V 3 2 L k .
Lemma 11.
For λ = 0.83372131691 , we have
m E ( λ ) F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α P 3 2 U 3 1 / 2 V 3 2 L k 1 .
Proof. 
It follows from Hölder’s inequality that
m E ( λ ) F ( α ) S 1 2 ( α ) S 2 2 ( α ) T 2 ( α ) H k ( α ) e ( N α ) d α L k 0 1 | S 1 4 ( α ) T 4 ( α ) | d α 1 / 4 0 1 | S 2 ( α ) | 8 d α 3 / 16 × m | F ( α ) | 2 | S 2 ( α ) | | S 1 ( α ) | 2 | T ( α ) | 2 d α 1 / 2 E ( λ ) 1 d α 1 / 16 .
Taking
g ( α ) = S 1 ( α ) , h ( α ) = T ( α ) , G ( α ) = | F ( α ) | 2 | S 2 ( α ) | S 1 ( α ) T ( α )
in Lemma 6, we deduce that
m | F ( α ) | 2 | S 2 ( α ) | | S 1 ( α ) | 2 | T ( α ) | 2 d α N 1 3 J 0 1 4 m | F ( α ) | 4 | S 1 ( α ) | 2 | S 2 ( α ) | 2 | T ( α ) | 2 d α 1 4 m | F ( α ) | 2 | S 1 ( α ) | | S 2 ( α ) | | T ( α ) | 2 d α 1 2 + N 7 24 + ε m | F ( α ) | 2 | S 1 ( α ) | | S 2 ( α ) | | T ( α ) | 2 d α ,
where
J 0 = sup β ( 0 , 1 ] q P 3 3 / 4 a = 1 ( a , q ) = 1 q M ( q , a ) w 3 2 ( q ) | h ( α + β ) | 2 ( 1 + P 3 3 | α a / q | ) 2 d α
with
M ( q , a ) = α : | q α a | P 3 9 / 4 .
It follows from analogous arguments, referring to Lemma 6.2 of Zhang and Li [13], that
J 0 V 3 2 P 3 3 ( log N ) c N 4 / 9 + ε .
By Lemma 2.5 of Vaughan [14], Lemma 5, Lemma 9 and Hölder’s inequality, one derives that
m | F ( α ) | 4 | S 1 ( α ) | 2 | S 2 ( α ) | 2 | T ( α ) | 2 d α sup α m | F ( α ) | 3 0 1 | S 1 ( α ) | 8 d α 1 / 4 0 1 | S 2 ( α ) | 8 d α 1 / 4 0 1 | F 2 ( α ) T 4 ( α ) | d α 1 / 2 ( N 191 / 432 + ε ) 3 · ( N 5 / 3 + ε ) 1 / 4 · ( N 5 / 3 + ε ) 1 / 4 · ( N 10 / 9 + ε ) 1 / 2 N 391 / 144 + ε .
In addition, by (iii) of Lemma 9 and Cauchy’s inequality, one also has
m | F ( α ) | 2 | S 1 ( α ) | | S 2 ( α ) | | T ( α ) | 2 d α 0 1 | F 2 ( α ) S 1 2 ( α ) T 2 ( α ) | d α 1 / 2 0 1 | F 2 ( α ) S 2 2 ( α ) T 2 ( α ) | d α 1 / 2 N 11 / 9 + ε .
It follows from (23)–(26) that
m | F ( α ) | 2 | S 2 ( α ) | | S 1 ( α ) | 2 | T ( α ) | 2 d α N 109 / 72 + ε ,
which, combined with (22), Lemma 8, (i) of lemma 9 and Lemma 2.5 of Vaughan [14], yields (21). This completes the proof of Lemma 11. □
From (20) and Lemma 11, we derive the result of Proposition 2.

5. Proof of Theorem 1

Taking λ = 0.83372131691 , k = 23 in Proposition 1 and Proposition 2, we can deduce that
R ( k , N ) I ( k , M , N ) | I ( k , m , N ) | ( 0.14457265 8.499467692 × 0 . 83372131691 k ) P 3 2 U 3 1 / 2 V 3 2 L k 0.01489 P 3 2 U 3 1 / 2 V 3 2 L k .
This completes the proof of Theorem 1.

6. Conclusions

In this paper, we have established an asymptotic formula for the Goldbach–Linnik type problem concerning the symmetric mixed powers of primes and powers of 2. Specifically, we have shown that every sufficiently large odd integer can be represented as the sum of one prime square, six cubes of primes, and 23 powers of two. This result extends the classical Goldbach conjecture by incorporating higher powers and mixed types, offering a broader understanding of the additive properties of primes and their powers.
Our findings contribute to analytic number theory by providing deeper insights into the behavior of primes in additive problems. The innovative techniques developed, such as the application of the circle method, pave the way for future research. The symmetry observed in the mixed powers of primes suggests an underlying structure that enhances our understanding of prime distribution.
Practical advantages include potential applications in cryptographic algorithms [23] and computational number theory, aiding efficient algorithm design [24]. This study underscores the importance of cross-disciplinary approaches in advancing mathematical theories.
In conclusion, our work addresses a significant problem in additive number theory and lays the groundwork for future research. It highlights the potential for discovering new mathematical phenomena through the interplay of primes and their powers, enriching our understanding of fundamental mathematical structures.

Author Contributions

Conceptualization, F.X. and M.Z.; Methodology, F.X. and J.L.; Software, F.X.; Writing—original draft, M.Z. and J.W. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the Beijing Natural Science Foundation (Grant No. 1242003), and the National Natural Science Foundation of China (Grant Nos. 11901566, 12001047, 11971476, 12071238, 12301305). In particular, Fei Xue is supported by the China Scholarship Council (Grant No. 202306430075) and the Fundamental Research Funds for the Central University (Grant No. BBJ2024097).

Data Availability Statement

No new data were created or analyzed in this study.

Acknowledgments

The authors would like to appreciate the referees for their patience in refereeing this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Stanley, G.K. The representation of a number as the sum of one square and a number of kth powers. Proc. London Math. Soc. 1930, 31, 512–553. [Google Scholar] [CrossRef]
  2. Hardy, G.H.; Littlewood, J.E. Some problems of ‘Partitio Numerorum’ (I): A new solution to Waring’s problem. Göttingen Nachrichten 1920, 1920, 33–54. [Google Scholar]
  3. Hardy, G.H.; Littlewood, J.E. Some problems of ‘partitio numerorum’ (VI): Further researches in Waring’s problem. Math. Z. 1925, 23, 1–37. [Google Scholar] [CrossRef]
  4. Sinnadurai, J. Representation of integers as sums of six cubes and one square. Quart. J. Math. Oxford Ser. 1965, 16, 289–296. [Google Scholar] [CrossRef]
  5. Hooley, C. On a new approach to various problems of Waring’s type. In Recent Progress in Analytic Number Theory; Academic Press: London, UK, 1981; Volume 1, pp. 127–191. [Google Scholar]
  6. Linnik, Y.V. Prime numbers and powers of two. Trudy Nat. Inst. Steklov. 1951, 38, 152–169. [Google Scholar]
  7. Linnik, Y.V. Addition of prime numbers with powers of one and the same number. Mat. Sbornik N.S. 1953, 32, 3–60. [Google Scholar]
  8. Gallagher, P.X. Primes and powers of 2. Invent. Math. 1975, 29, 125–142. [Google Scholar] [CrossRef]
  9. Han, X.; Liu, H.F. Powers of 2 in two Goldbach–Linnik type problems involving prime cubes. Discrete Math. 2024, 347, 113674. [Google Scholar] [CrossRef]
  10. Li, G.; Hu, L.; Huang, X. On pairs of equations in eight prime cubes and powers of 2. AIMS Math. 2023, 8, 3940–3948. [Google Scholar] [CrossRef]
  11. Liu, Y.H. On sums of unequal powers of primes and powers of 2. arXiv 2023, arXiv:2401.01355v1. [Google Scholar]
  12. Zhao, X.; Ge, W. Eight cubes of primes and 204 powers of 2. Int. J. Number Theory 2020, 16, 1547–1555. [Google Scholar] [CrossRef]
  13. Zhang, M.; Li, J. Exceptional set for sums of unlike powers of primes. Taiwanese J. Math. 2018, 22, 779–811. [Google Scholar] [CrossRef]
  14. Vaughan, R.C. The Hardy–Littlewood Method, 2nd ed.; Cambridge University Press: Cambridge, UK, 1997. [Google Scholar]
  15. Hua, L.K. Introduction to Number Theory; Springer: Berlin/Heidelberg, Germany; New York, NY, USA, 1982. [Google Scholar]
  16. Kumchev, A.V. On Weyl sums over primes and almost primes. Michigan Math. J. 2006, 54, 243–268. [Google Scholar] [CrossRef]
  17. Zhao, L.L. On the Waring–Goldbach problem for fourth and sixth powers. Proc. Lond. Math. Soc. 2014, 108, 1593–1622. [Google Scholar] [CrossRef]
  18. Heath–Brown, D.R.; Puchta, J.C. Integers represented as a sum of primes and powers of two. Asian J. Math. 2002, 6, 535–565. [Google Scholar] [CrossRef]
  19. Liu, Y.H. Two results on Goldbach-Linnik problems for cubes of primes. Rocky Mountain J. Math. 2022, 52, 999–1007. [Google Scholar] [CrossRef]
  20. Liu, Y.H. On sums of two prime squares, four prime cubes and powers of two. Bull. Aust. Math. Soc. 2020, 102, 207–216. [Google Scholar] [CrossRef]
  21. Zhao, L.L. On unequal powers of primes and powers of 2. Acta Math. Hungar. 2015, 146, 405–420. [Google Scholar] [CrossRef]
  22. Hua, L.K. Additive Theory of Prime Numbers; American Mathematical Society, Providence: Rhode Island, NY, USA, 1965. [Google Scholar]
  23. Shoup, V. A Computational Introduction to Number Theory and Algebra; Cambridge University Press: Cambridge, UK, 2005. [Google Scholar]
  24. Granville, A. Prime number patterns. Amer. Math. Monthly 2008, 115, 279–296. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Xue, F.; Li, J.; Zhang, M.; Wu, J. Goldbach–Linnik–Type Problem of Symmetric Mixed Powers of Primes and Powers of Two. Symmetry 2024, 16, 945. https://doi.org/10.3390/sym16080945

AMA Style

Xue F, Li J, Zhang M, Wu J. Goldbach–Linnik–Type Problem of Symmetric Mixed Powers of Primes and Powers of Two. Symmetry. 2024; 16(8):945. https://doi.org/10.3390/sym16080945

Chicago/Turabian Style

Xue, Fei, Jinjiang Li, Min Zhang, and Juanjuan Wu. 2024. "Goldbach–Linnik–Type Problem of Symmetric Mixed Powers of Primes and Powers of Two" Symmetry 16, no. 8: 945. https://doi.org/10.3390/sym16080945

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop