Next Article in Journal
Implementing a Novel Use of Multicriteria Decision Analysis to Select IIoT Platforms for Smart Manufacturing
Next Article in Special Issue
Some Identities on Type 2 Degenerate Bernoulli Polynomials of the Second Kind
Previous Article in Journal
Transport Properties in Dense QCD Matter
Previous Article in Special Issue
Some Identities and Inequalities Involving Symmetry Sums of Legendre Polynomials
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Exceptional Set for Sums of Symmetric Mixed Powers of Primes

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.
Submission received: 17 January 2020 / Revised: 15 February 2020 / Accepted: 25 February 2020 / Published: 2 March 2020
(This article belongs to the Special Issue Current Trends in Symmetric Polynomials with Their Applications Ⅱ)

Abstract

:
The main purpose of this paper is to use the Hardy–Littlewood method to study the solvability of mixed powers of primes. To be specific, we consider the even integers represented as the sum of one prime, one square of prime, one cube of prime, and one biquadrate of prime. However, this representation can not be realized for all even integers. In this paper, we establish the exceptional set of this kind of representation and give an upper bound estimate.

1. Introduction and Main Result

Let N , k 1 , k 2 , , k s be natural numbers which satisfy 2 k 1 k 2 k s , N > s . Waring’s problem of unlike powers concerns the possibility of representation of N in the form
N = x 1 k 1 + x 2 k 2 + + x s k s .
For previous literature, the reader could refer to section P12 of LeVeque’s Reviews in number theory and the bibliography of Vaughan [1]. For the special case, k 1 = k 2 = = k s , an interesting problem is to determine the value for k 2 , called Waring’s problem, of the function G ( k ) , the least positive number s such that every sufficiently large number can be represented the sum of at most sk-th powers of natural numbers. For this problem, there are only two values of the function G ( k ) determined exactly. To be specific, G ( 2 ) = 4 , by Lagrange in 1770, and G ( 4 ) = 16 , by Davenport [2]. The majority of information for G ( k ) has been derived from the Hardy–Littlewood method. This method has arised from a celebrated paper of Hardy and Ramanujan [3], which focused on the partition function.
There are many authors who devoted to establish many kinds of generalisations of this classical version of Waring’s problem. Among these results, it is necessary to illustrate some of the majority variants. We begin with the most famous Waring–Goldbach problem, for which one devotes to investigate the possibility of the representation of integers as sums of k-th powers of prime numbers. In order to explain the associated congruence conditions, we denote by k a natural number and p a prime number. We write θ = θ ( k ; p ) as the integer with the properties p θ | k and p θ k , and then define γ = γ ( k , p ) by
γ ( k , p ) = θ + 2 , when p = 2 and θ > 0 , θ + 1 , otherwise .
Also, we set
K ( k ) = ( p 1 ) | k p γ .
Denote by H ( k ) the smallest integer s, which satisfies every sufficiently large integer congruent to s modulo K ( k ) can be represented as the sum of sk-th powers of primes. By noting the fact that for ( p 1 ) | k , we have p θ ( p 1 ) | k , provided that a k 1 ( mod p γ ) and ( p , a ) = 1 . This states the seemingly awkward definition of H ( k ) , because if n is the sum of sk-th powers of primes exceeding k + 1 , then it must satisfy n s ( mod K ( k ) ) . Trivially, further congruence conditions could arise from the primes p which satisfy ( p 1 ) k . Following the previous investigations of Vinogradov [4,5], Hua systematically considered and investigated the additive problems involving prime variables in his famous book (see Hua [6,7]).
For the nonhomogeneous case, the most optimistic conjecture suggests that, for each prime p, if the Equation (1) has p-adic solutions and satisfies
k 1 1 + k 2 1 + + k s 1 > 1 ,
then n can be written as the sum of unlike powers of positive integers (1) provided that n is sufficiently large in terms of k. For s = 3 , such an claim maybe not true in certain situations (see Jagy and Kaplansky [8], or Exercise 5 of Chapter 8 of Vaughan [1]). However, a guide of application for the Hardy–Littlewood method suggests that the condition (2) should ensure at least that almost all integers satisfying the expected congruence conditions can be represented. Moreover, once subject to the following condition
k 1 1 + k 2 1 + + k s 1 > 2 ,
a standard application of the Hardy–Littlewood method suggests that all the integers, which satisfy necessary congruence conditions, could be written in the form (1). Meanwhile, a conventional argument of the circle method shows that in situations in which the condition (2) does not hold, then every sufficiently large integer can not be represented in the expected form.
Since the Hardy–Littlewood method, the investigation of Waring’s problem for unlike powers has produced splendid progress in circle method, especially for the classical version of Waring’s problem. Additive Waring’s problems of unlike powers involving squares, cubes or biquadrates offen attract greater interest of many mathematicians than those cases with higher mixed powers, and the current circumstance is quite satisfactory. For example, the reader can refer to references [9,10,11,12,13,14,15,16,17,18,19].
The Waring–Goldbach problem of mixed powers concerns the representation of N which satisfying some necessary congruence conditions as the form
N = p 1 k 1 + p 2 k 2 + + p s k s ,
where p 1 , p 2 , , p s are prime variables.
In 2002, Brüdern and Kawada [20] proved that for every sufficiently large even integer N, the equation
N = x + p 2 2 + p 3 3 + p 4 4
is solvable with x being an almost–prime P 2 and the p j ( j = 2 , 3 , 4 ) primes. As usual, P r denotes an almost–prime with at most r prime factors, counted according to multiplicity. On the other hand, in 2015, Zhao [21] established that, for k = 3 or 4, every sufficiently large even integer N can be represented as the form
N = p 1 + p 2 2 + p 3 3 + p 4 k + 2 ν 1 + 2 ν 2 + + 2 ν t ( k ) ,
where p 1 , , p 4 are primes, ν 1 , ν 2 , , ν t ( k ) are natural numbers, and t ( 3 ) = 16 , t ( 4 ) = 18 , which is an improvement result of Liu and Lü [22]. Afterwards, Lü [23] improved the result of Zhao [21] and showed that every sufficiently large even integer N can be represented as a sum of one prime, one square of prime, one cube of prime, one biquadrate of prime and 16 powers of 2.
In view of the results of Brüdern and Kawada [20], Zhao [21], Liu and Lü [22] and Lü [23], it is reasonable to conjecture that, for sufficiently large integer N satisfying N 0 ( mod 2 ) , the following Diophantine equation
N = p 1 + p 2 2 + p 3 3 + p 4 4
is solvable, here and below the letter p, with or without subscript, always denotes a prime number. However, this conjecture may be out of reach at present with the known methods and techniques.
In this paper, we shall consider the exceptional set of the problem (4) and establish the following result.
Theorem 1.
Let E ( N ) denote the number of positive integers n, which satisfy n 0 ( mod 2 ) , up to N, which can not be represented as
n = p 1 + p 2 2 + p 3 3 + p 4 4 .
Then, for any ε > 0 , we have
E ( N ) N 61 144 + ε .
We will establish Theorem 1 by using a pruning process into the Hardy–Littlewood circle method. For the treatment on minor arcs, we will employ the argument developed by Wooley in [24] combined with the new estimates for exponential sum over primes developed by Zhao [25]. For the treatment on major arcs, we shall prune the major arcs further and deal with them respectively. The explicit details will be given in the related sections.
Notation. In this paper, let p, with or without subscripts, always denote a prime number; ε always denotes a sufficiently small positive constant, which may not be the same at different occurrences. The letter c always denotes a positive constant. As usual, we use χ mod q to denote a Dirichlet character modulo q, and χ 0 mod q the principal character. Moreover, we use φ ( n ) and d ( n ) to denote the Euler’s function and Dirichlet’s divisor function, respectively. e ( x ) = e 2 π i x ; f ( x ) g ( x ) means that f ( x ) = O ( g ( x ) ) ; f ( x ) g ( x ) means that f ( x ) g ( x ) f ( x ) . N is a sufficiently large integer and n ( N / 2 , N ] , and hence log N log n .

2. Outline of the Proof of Theorem 1

Let N be a sufficiently large positive integer. By a splitting argument, it is sufficient to consider the even integers n ( N / 2 , N ] . For the application of the Hardy–Littlewood method, it is necessary to define the Farey dissection. For this purpose, we set the parameters as follows
A = 100 100 , Q 0 = log A N , Q 1 = N 1 6 , Q 2 = N 5 6 , I 0 = 1 Q 2 , 1 1 Q 2 .
By Dirichlet’s rational approximation lemma (for instance, see Lemma 12 on p.104 of [26], or Lemma 2.1 of [1]), each α ( 1 / Q 2 , 1 1 / Q 2 ] can be represented in the form
α = a q + λ , | λ | 1 q Q 2 ,
for some integers a , q with 1 a q Q 2 and ( a , q ) = 1 . Define
M ( q , a ) = a q 1 q Q 2 , a q + 1 q Q 2 , M = 1 q Q 1 1 a q ( a , q ) = 1 M ( q , a ) , M 0 ( q , a ) = a q Q 0 100 q N , a q + Q 0 100 q N , M 0 = 1 q Q 0 100 1 a q ( a , q ) = 1 M 0 ( q , a ) , m 1 = I 0 \ M , m 2 = M \ M 0 .
Then we obtain the Farey dissection
I 0 = M 0 m 1 m 2 .
For k = 1 , 2 , 3 , 4 , we define
f k ( α ) = X k < p 2 X k e ( p k α ) ,
where X k = ( N / 16 ) 1 k . Let
R ( n ) = n = p 1 + p 2 2 + p 3 3 + p 4 4 X i < p i 2 X i i = 1 , 2 , 3 , 4 1 .
From (5), one has
R ( n ) = 0 1 k = 1 4 f k ( α ) e ( n α ) d α = 1 Q 2 1 1 Q 2 k = 1 4 f k ( α ) e ( n α ) d α = M 0 + m 1 + m 2 k = 1 4 f k ( α ) e ( n α ) d α .
In order to prove Theroem 1, we need the two following propositions:
Proposition 1.
For n ( N / 2 , N ] , there holds
M 0 k = 1 4 f k ( α ) e ( n α ) d α = Γ ( 2 ) Γ ( 3 2 ) Γ ( 4 3 ) Γ ( 5 4 ) Γ ( 25 12 ) S ( n ) n 13 12 log 4 n + O n 13 12 log 5 n ,
where S ( n ) is the singular series defined in (10), which is absolutely convergent and satisfies
( log log n ) c S ( n ) d ( n )
for any integer n satisfying n 0 ( mod 2 ) and some fixed constant c > 0 .
The proof of (6) in Proposition 1 follows from the well–know standard technique in the Hardy–Littlewood method. For more information, one can see pp. 90–99 of Hua [7], so we omit the details herein. For the properties (7) of singular series, we shall give the proof in Section 4.
Proposition 2.
Let Z ( N ) denote the number of integers n ( N / 2 , N ] satisfying n 0 ( mod 2 ) such that
j = 1 2 | m j k = 1 4 f k ( α ) e ( n α ) d α | n 13 12 log 5 n .
Then we have
Z ( N ) N 61 144 + ε .
The proof of Proposition 2 will be given in Section 5. The remaining part of this section is devoted to establishing Theorem 1 by using Proposition 1 and Proposition 2.
Proof of Theorem 1.
From Proposition 2, we deduce that, with at most O N 61 144 + ε exceptions, all even integers n ( N / 2 , N ] satisfy
j = 1 2 | m j k = 1 4 f k ( α ) e ( n α ) d α | n 13 12 log 5 n ,
from which and Proposition 1, we conclude that, with at most O N 61 144 + ε exceptions, for all even integers n ( N / 2 , N ] , R ( n ) holds the asymptotic formula
R ( n ) = Γ ( 2 ) Γ ( 3 2 ) Γ ( 4 3 ) Γ ( 5 4 ) Γ ( 25 12 ) S ( n ) n 13 12 log 4 n + O n 13 12 log 5 n .
In other words, all even integers n ( N / 2 , N ] can be represented in the form p 1 + p 2 2 + p 3 3 + p 4 4 with at most O N 61 144 + ε exceptions, where p 1 , p 2 , p 3 , p 4 are prime numbers. By a splitting argument, we get
E ( N ) 0 log N Z N 2 0 log N N 2 61 144 + ε N 61 144 + ε .
This completes the proof of Theorem 1.

3. Some Auxiliary Lemmas

In this section, we shall list some necessary lemmas which will be used in proving Proposition 2.
Lemma 1.
Suppose that α is a real number, and that | α a / q | q 2 with ( a , q ) = 1 . Let β = α a / q . Then we have
f k ( α ) d δ k ( q ) ( log x ) c X k 1 / 2 q ( 1 + N | β | ) + X k 4 / 5 + X k q ( 1 + N | β | ) ,
where δ k = 1 2 + log k log 2 and c is a constant.
Proof. 
See Theorem 1.1 of Ren [27].  □
Lemma 2.
Suppose that α is a real number, and that there exist a Z and q N with
( a , q ) = 1 , 1 q X and | q α a | X 1 .
If P 2 δ 2 1 k X P k 2 δ 2 1 k , then one has
P < p 2 P e p k α P 1 δ 2 1 k + ε + P 1 + ε q 1 / 2 1 + P k | α a / q | 1 / 2 ,
where δ = 1 / 3 for k 4 .
Proof. 
See Lemma 2.4 of Zhao [25].  □
Lemma 3.
Suppose that α is a real number, and that there are a Z and q N with
( a , q ) = 1 , 1 q Q and | q α a | Q 1 .
If P 1 2 Q P 5 2 , then one has
P < p 2 P e p 3 α P 1 1 12 + ε + q 1 6 P 1 + ε 1 + P 3 | α a / q | 1 / 2 .
Proof. 
See Lemma 8.5 of Zhao [25].  □
Lemma 4.
For α m 1 , we have
f 3 ( α ) N 11 36 + ε and f 4 ( α ) N 23 96 + ε .
Proof. 
For α m 1 , we have Q 1 q Q 2 . By Lemma 3, we get
f 3 ( α ) X 3 11 12 + ε + X 3 1 + ε Q 1 1 6 N 11 36 + ε .
From Lemma 2, we obtain
f 4 ( α ) X 4 23 24 + ε + X 4 1 + ε Q 1 1 2 N 23 96 + ε .
This completes the proof of Lemma 4.  □
For 1 a q with ( a , q ) = 1 , set
I ( q , a ) = a q 1 q Q 0 , a q + 1 q Q 0 , I = 1 q Q 0 a = q ( a , q ) = 1 2 q I ( q , a ) .
For α m 2 , by Lemma 1, we have
f 3 ( α ) N 1 3 log c N q 1 2 ε 1 + N | λ | 1 / 2 + N 4 15 + ε = V 3 ( α ) + N 4 15 + ε ,
say. Then we obtain the following Lemma.
Lemma 5.
We have
I | V 3 ( α ) | 4 d α = 1 q Q 0 a = q ( a , q ) = 1 2 q I ( q , a ) | V 3 ( α ) | 4 d α N 1 3 log c N .
Proof. 
We have
1 q Q 0 a = q ( a , q ) = 1 2 q I ( q , a ) | V 3 ( α ) | 4 d α 1 q Q 0 q 2 + ε a = q ( a , q ) = 1 2 q | λ | 1 Q 0 N 4 3 log c N ( 1 + N | λ | ) 2 d λ 1 q Q 0 q 2 + ε a = q ( a , q ) = 1 2 q | λ | 1 N N 4 3 log c N d λ + 1 N | λ | 1 Q 0 N 4 3 log c N N 2 λ 2 d λ N 1 3 log c N 1 q Q 0 q 2 + ε φ ( q ) N 1 3 Q 0 ε log c N N 1 3 log c N .
This completes the proof of Lemma 5.  □

4. The Singular Series

In this section, we shall concentrate on investigating the properties of the singular series which appear in Proposition 1. First, we illustrate some notations. For k { 1 , 2 , 3 , 4 } and a Dirichlet character χ mod q , we define
C k ( χ , a ) = h = 1 q χ ( h ) ¯ e a h k q , C k ( q , a ) = C k ( χ 0 , a ) ,
where χ 0 is the principal character modulo q. Let χ 1 , χ 2 , χ 3 , χ 4 be Dirichlet characters modulo q. Set
B ( n , q , χ 1 , χ 2 , χ 3 , χ 4 ) = a = 1 ( a , q ) = 1 q C 1 ( χ 1 , a ) C 2 ( χ 2 , a ) C 3 ( χ 3 , a ) C 4 ( χ 4 , a ) e a n q ,
B ( n , q ) = B n , q , χ 0 , χ 0 , χ 0 , χ 0 ,
and write
A ( n , q ) = B ( n , q ) φ 4 ( q ) , S ( n ) = q = 1 A ( n , q ) .
Lemma 6.
For ( a , q ) = 1 and any Dirichlet character χ mod q , there holds
| C k ( χ , a ) | 2 q 1 / 2 d β k ( q )
with β k = ( log k ) / log 2 .
Proof. 
See the Problem 14 of Chapter VI of Vinogradov [28].  □
Lemma 7.
Let p be a prime and p α k . For ( a , p ) = 1 , if γ ( p ) , we have C k ( p , a ) = 0 , where
γ ( p ) = α + 2 , i f   p 2   or   p = 2 , α = 0 ; α + 3 , i f   p = 2 , α > 0 .
Proof. 
See Lemma 8.3 of Hua [7]. □
For k 1 , we define
S k ( q , a ) = m = 1 q e a m k q .
Lemma 8.
Suppose that ( p , a ) = 1 . Then
S k ( p , a ) = χ A k χ ( a ) ¯ τ ( χ ) ,
where A k denotes the set of non–principal characters χ modulo p for which χ k is principal, and τ ( χ ) denotes the Gauss sum
m = 1 p χ ( m ) e m p .
Also, there hold | τ ( χ ) | = p 1 / 2 and | A k | = ( k , p 1 ) 1 .
Proof. 
See Lemma 4.3 of Vaughan [1].  □
Lemma 9.
For ( p , n ) = 1 , we have
| a = 1 p 1 k = 1 4 S k ( p , a ) p e a n p | 24 p 3 2 .
Proof. 
We denote by S the left-hand side of (11). It follows from Lemma 8 that
S = 1 p 4 a = 1 p 1 k = 1 4 χ k A k χ k ( a ) ¯ τ ( χ k ) e a n p .
If | A k | = 0 for some k { 1 , 2 , 3 , 4 } , then S = 0 . If this is not the case, then
S = 1 p 4 χ 1 A 1 χ 2 A 2 χ 3 A 3 χ 4 A 4 τ ( χ 1 ) τ ( χ 2 ) τ ( χ 3 ) τ ( χ 4 ) × a = 1 p 1 χ 1 ( a ) χ 2 ( a ) χ 3 ( a ) χ 4 ( a ) ¯ e a n p .
From Lemma 8, the quadruple outer sums have no more than 4 ! = 24 terms. For each of these terms, there holds
| τ ( χ 1 ) τ ( χ 2 ) τ ( χ 3 ) τ ( χ 4 ) | = p 2 .
Since in any one of these terms χ 1 ( a ) χ 2 ( a ) χ 3 ( a ) χ 4 ( a ) ¯ is a Dirichlet character χ ( mod p ) , the inner sum is
a = 1 p 1 χ ( a ) e a n p = χ ( n ) ¯ a = 1 p 1 χ ( a n ) e a n p = χ ( n ) ¯ τ ( χ ) .
By noting the fact that τ ( χ 0 ) = 1 for principal character χ 0 mod p , we derive that
| χ ( n ) ¯ τ ( χ ) | p 1 2 .
From the above arguments, we deduce that
| S | 1 p 4 · 24 · p 2 · p 1 2 = 24 p 3 2 ,
which completes the proof of Lemma 9.  □
Lemma 10.
Let L ( p , n ) denote the number of solutions of the congruence
x 1 + x 2 2 + x 3 3 + x 4 4 n ( mod p ) , 1 x 1 , x 2 , x 3 , x 4 p 1 .
Then, for n 0 ( mod 2 ) , we have L ( p , n ) > 0 .
Proof. 
We have
p · L ( p , n ) = a = 1 p C 1 ( p , a ) C 2 ( p , a ) C 3 ( p , a ) C 4 ( p , a ) e a n p = ( p 1 ) 4 + E p ,
where
E p = a = 1 p 1 C 1 ( p , a ) C 2 ( p , a ) C 3 ( p , a ) C 4 ( p , a ) e a n p .
By Lemma 8, we obtain
| E p | ( p 1 ) ( p + 1 ) ( 2 p + 1 ) ( 3 p + 1 ) .
It is easy to check that | E p | < ( p 1 ) 4 for p 7 . Therefore, we obtain L ( p , n ) > 0 for p 7 . For p = 2 , 3 , 5 , we can check L ( p , n ) > 0 one by one. This completes the proof of Lemma 10.  □
Lemma 11.
A ( n , q ) is multiplicative in q.
Proof. 
From the definition of A ( n , q ) in (10), it is sufficient to show that B ( n , q ) is multiplicative in q. Suppose q = q 1 q 2 with ( q 1 , q 2 ) = 1 . Then we obtain
B ( n , q 1 q 2 ) = a = 1 ( a , q 1 q 2 ) = 1 q 1 q 2 k = 1 4 C k ( q 1 q 2 , a ) e a n q 1 q 2 = a 1 = 1 ( a 1 , q 1 ) = 1 q 1 a 2 = 1 ( a 2 , q 2 ) = 1 q 2 k = 1 4 C k ( q 1 q 2 , a 1 q 2 + a 2 q 1 ) e a 1 n q 1 e a 2 n q 2 .
For ( q 1 , q 2 ) = 1 , there holds
C k ( q 1 q 2 , a 1 q 2 + a 2 q 1 ) = m = 1 ( m , q 1 q 2 ) = 1 q 1 q 2 e ( a 1 q 2 + a 2 q 1 ) m k q 1 q 2 = m 1 = 1 ( m 1 , q 1 ) = 1 q 1 m 2 = 1 ( m 2 , q 2 ) = 1 q 2 e ( a 1 q 2 + a 2 q 1 ) ( m 1 q 2 + m 2 q 1 ) k q 1 q 2 = m 1 = 1 ( m 1 , q 1 ) = 1 q 1 e a 1 ( m 1 q 2 ) k q 1 m 2 = 1 ( m 2 , q 2 ) = 1 q 2 e a 2 ( m 2 q 1 ) k q 2 = C k ( q 1 , a 1 ) C k ( q 2 , a 2 ) .
Putting (13) into (12), we deduce that
B ( n , q 1 q 2 ) = a 1 = 1 ( a 1 , q 1 ) = 1 q 1 k = 1 4 C k ( q 1 , a 1 ) e a 1 n q 1 a 2 = 1 ( a 2 , q 2 ) = 1 q 2 k = 1 4 C k ( q 2 , a 2 ) e a 2 n q 2 = B ( n , q 1 ) B ( n , q 2 ) .
This completes the proof of Lemma 11.  □
Lemma 12.
Let A ( n , q ) be as defined in (10). Then
(i)
we have
q > Z | A ( n , q ) | Z 1 2 + ε d ( n ) ,
and thus the singular series S ( n ) is absolutely convergent and satisfies S ( n ) d ( n ) .
(ii)
there exists an absolute positive constant c > 0 , such that, for n 0 ( mod 2 ) ,
S ( n ) ( log log n ) c .
Proof. 
From Lemma 11, we know that B ( n , q ) is multiplicative in q. Therefore, there holds
B ( n , q ) = p t q B ( n , p t ) = p t q a = 1 ( a , p ) = 1 p t k = 1 4 C k ( p t , a ) e a n p t .
From (14) and Lemma 7, we deduce that B ( n , q ) = p q B ( n , p ) or 0 according to q is square–free or not. Thus, one has
q = 1 A ( n , q ) = q = 1 q   square free A ( n , q ) .
Write
R ( p , a ) : = k = 1 4 C k ( p , a ) k = 1 4 S k ( p , a ) .
Then
A ( n , p ) = 1 ( p 1 ) 4 a = 1 p 1 k = 1 4 S k ( p , a ) e a n p + 1 ( p 1 ) 4 a = 1 p 1 R ( p , a ) e a n p .
Applying Lemma 6 and noticing that S k ( p , a ) = C k ( p , a ) + 1 , we get S k ( p , a ) p 1 2 , and thus R ( p , a ) p 3 2 . Therefore, the second term in (16) is c 1 p 3 2 . On the other hand, from Lemma 9, we can see that the first term in (16) is 2 4 · 24 p 3 2 = 384 p 3 2 . Let c 2 = max ( c 1 , 384 ) . Then we have proved that, for p n , there holds
| A ( n , p ) | c 2 p 3 2 .
Moreover, if we use Lemma 6 directly, it follows that
| B ( n , p ) | = | a = 1 p 1 k = 1 4 C k ( p , a ) e a n p | a = 1 p 1 k = 1 4 | C k ( p , a ) | ( p 1 ) · 2 4 · p 2 · 24 = 384 p 2 ( p 1 ) ,
and therefore
| A ( n , p ) | = | B ( n , p ) | φ 4 ( p ) 384 p 2 ( p 1 ) 3 2 3 · 384 p 2 p 3 = 3072 p .
Let c 3 = max ( c 2 , 3072 ) . Then, for square–free q, we have
| A ( n , q ) | = p | q p n | A ( n , p ) | p | q p | n | A ( n , p ) | p | q p n c 3 p 3 2 p | q p | n c 3 p 1 = c 3 ω ( q ) p | q p 3 2 p | ( n , q ) p 1 2 q 3 2 + ε ( n , q ) 1 2 .
Hence, by (15), we obtain
q > Z | A ( n , q ) | q > Z q 3 2 + ε ( n , q ) 1 2 = d | n q > Z d ( d q ) 3 2 + ε d 1 2 = d | n d 1 + ε q > Z d q 3 2 + ε d | n d 1 + ε Z d 1 2 + ε = Z 1 2 + ε d | n d 1 2 + ε Z 1 2 + ε d ( n ) .
This proves (i) of Lemma 12.
To prove (ii) of Lemma 12, by Lemma 11, we first note that
S ( n ) = p 1 + t = 1 A n , p t = p 1 + A ( n , p ) = p c 3 1 + A ( n , p ) p > c 3 p n 1 + A ( n , p ) p > c 3 p | n 1 + A ( n , p ) .
From (17), we have
p > c 3 p n 1 + A ( n , p ) p > c 3 1 c 3 p 3 / 2 c 4 > 0 .
By (18), we know that there are c 5 > 0 such that
p > c 3 p | n 1 + A ( n , p ) p > c 3 p | n 1 c 3 p p | n 1 c 3 p ( log log n ) c 5 .
On the other hand, it is easy to see that
1 + A ( n , p ) = p · L ( p , n ) φ 4 ( p ) .
By Lemma 10, we know that L ( p , n ) > 0 for all p with n 0 ( mod 2 ) , and thus 1 + A ( n , p ) > 0 . Therefore, there holds
p c 3 1 + A ( n , p ) c 6 > 0 .
Combining the estimates (19)–(22), and taking c = c 5 > 0 , we derive that
S ( n ) ( log log n ) c .
This completes the proof Lemma 12.  □

5. Proof of Proposition 2

In this section, we shall give the proof of Proposition 2. We denote by Z j ( N ) the set of integers n satisfying n [ N / 2 , N ] and n 0 ( mod 2 ) for which the following estimate
| m j k = 1 4 f k ( α ) e ( n α ) d α | n 13 12 log 5 n
holds. For convenience, we use Z j to denote the cardinality of Z j ( N ) for abbreviation. Also, we define the complex number ξ j ( n ) by taking ξ j ( n ) = 0 for n Z j ( N ) , and when n Z j ( N ) by means of the equation
| m j k = 1 4 f k ( α ) e ( n α ) d α | = ξ j ( n ) m j k = 1 4 f k ( α ) e ( n α ) d α .
Plainly, one has | ξ j ( n ) | = 1 whenever ξ j ( n ) is nonzero. Therefore, we obtain
n Z j ( N ) ξ j ( n ) m j k = 1 4 f k ( α ) e ( n α ) d α = m j k = 1 4 f k ( α ) K j ( α ) d α ,
where the exponential sum K j ( α ) is defined by
K j ( α ) = n Z j ( N ) ξ j ( n ) e ( n α ) .
For j = 1 , 2 , set
I j = m j k = 1 4 f k ( α ) K j ( α ) d α .
By (23)–(25), we derive that
I j n Z j ( N ) n 13 12 log 5 n Z j N 13 12 log 5 N , j = 1 , 2 .
By Lemma 2.1 of Wooley [24] with k = 2 , we know that, for j = 1 , 2 , there holds
0 1 | f 2 ( α ) K j ( α ) | 2 d α N ε Z j N 1 2 + Z j 2 .
It follows from Cauchy’s inequality, Lemma 4 and (27) that
I 1 sup α m 1 | f 3 ( α ) | sup α m 1 | f 4 ( α ) | 0 1 | f 2 ( α ) K 1 ( α ) | 2 d α 1 2 0 1 | f 1 ( α ) | 2 d α 1 2 N 11 36 + ε · N 23 96 + ε · N ε Z 1 N 1 2 + Z 1 2 1 2 · N 1 2 N 301 288 + ε Z 1 1 2 N 1 4 + Z 1 Z 1 1 2 N 373 288 + ε + Z 1 N 301 288 + ε .
Combining (26) and (28), we get
Z 1 N 13 12 log 5 N I 1 Z 1 1 2 N 373 288 + ε + Z 1 N 301 288 + ε ,
which implies
Z 1 N 61 144 + ε .
Next, we give the upper bound for Z 2 . By (9), we obtain
I 2 m 2 | f 1 ( α ) f 2 ( α ) V 3 ( α ) f 4 ( α ) K 2 ( α ) | d α + N 4 15 + ε · m 2 | f 1 ( α ) f 2 ( α ) f 4 ( α ) K 2 ( α ) | d α = I 21 + I 22 ,
say. For α m 2 , we have either Q 0 100 < q < Q 1 or Q 0 100 < N | q α a | < N Q 2 1 = Q 1 . Therefore, by Lemma 1, we get
sup α m 2 | f 4 ( α ) | N 1 4 log 40 A N .
In view of the fact that m 2 I , where I is defined by (8), Hölder’s inequality, the trivial estimate K 2 ( α ) Z 2 and Theorem 4 of Hua (See [7], p. 19), we obtain
I 21 Z 2 sup α m 2 | f 4 ( α ) | × 0 1 | f 1 ( α ) | 2 d α 1 2 0 1 | f 2 ( α ) | 4 d α 1 4 I | V 3 ( α ) | 4 d α 1 4 Z 2 · N 1 4 log 40 A N · N 1 2 · ( N log c N ) 1 4 · ( N 1 3 log c N ) 1 4 Z 2 N 13 12 log 30 A N .
Moreover, it follows from (27), (31) and Cauchy’s inequality that
I 22 N 4 15 + ε · sup α m 2 | f 4 ( α ) | × 0 1 | f 1 ( α ) | 2 d α 1 2 0 1 | f 2 ( α ) K 2 ( α ) | 2 d α 1 2 N 4 15 + ε · N 1 4 log 40 A N · N 1 2 · N ε Z 2 N 1 2 + Z 2 2 1 2 N 61 60 + ε Z 2 1 2 N 1 4 + Z 2 Z 2 1 2 N 19 15 + ε + Z 2 N 61 60 + ε .
Combining (26), (30), (32) and (33), we deduce that
Z 2 N 13 12 log 5 N I 2 = I 21 + I 22 Z 2 N 13 12 log 30 A N + Z 2 1 2 N 19 15 + ε + Z 2 N 61 60 + ε ,
which implies
Z 2 N 11 30 + ε .
From (29) and (34), we have
Z ( N ) Z 1 + Z 2 N 61 144 + ε ,
which completes the proof of Proposition 2.

Author Contributions

All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research work is supported by National Natural Science Foundation of China (Grant No. 11901566, 11971476), the Fundamental Research Funds for the Central Universities (Grant No. 2019QS02), and National Training Program of Innovation and Entrepreneurship for Undergraduates (Grant No. 201911413071, C201907622).

Acknowledgments

The authors would like to express the most sincere gratitude to the referee for his/her patience in refereeing this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Vaughan, R.C. The Hardy-Littlewood Method; Cambridge University Press: Cambridge, UK, 1997. [Google Scholar]
  2. Davenport, H. On Waring’s problem for fourth powers. Ann. Math. 1939, 40, 731–747. [Google Scholar] [CrossRef]
  3. Hardy, G.H.; Ramanujan, S. Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. 1918, 17, 75–115. [Google Scholar] [CrossRef]
  4. Vinogradov, I.M. Representation of an odd number as a sum of three primes. Dokl. Akad. Nauk SSSR 1937, 15, 6–7. [Google Scholar]
  5. Vinogradov, I.M. Some theorems concerning the theory of primes. Mat. Sb. 1937, 44, 179–195. [Google Scholar]
  6. Hua, L.K. Additive Primzahltheorie; B. G. Teubner Verlagsgesellschaft: Leipzig, Germany, 1959. [Google Scholar]
  7. Hua, L.K. Additive Theory of Prime Numbers; American Mathematical Society: Providence, RI, USA, 1965. [Google Scholar]
  8. Jagy, W.C.; Kaplansky, I. Sums of squares, cubes, and higher powers. Exp. Math. 1995, 4, 169–173. [Google Scholar] [CrossRef]
  9. Brüdern, J. On Waring’s problem for cubes and biquadrates. J. Lond. Math. Soc. 1988, 37, 25–42. [Google Scholar] [CrossRef]
  10. Brüdern, J.; Wooley, T.D. On Waring’s problem: Three cubes and a sixth power. Nagoya Math. J. 2001, 163, 13–53. [Google Scholar] [CrossRef] [Green Version]
  11. Davenport, H.; Heilbronn, H. Note on a result in the additive theory of numbers. Proc. Lond. Math. Soc. 1937, 2, 142–151. [Google Scholar] [CrossRef]
  12. Davenport, H.; Heilbronn, H. On Waring’s problem: Two cubes and one square. Proc. Lond. Math. Soc. 1937, 2, 73–104. [Google Scholar]
  13. Roth, K.F. Proof that almost all positive integers are sums of a square, a positive cube and a fourth power. J. Lond. Math. Soc. 1949, 24, 4–13. [Google Scholar] [CrossRef]
  14. Vaughan, R.C. A ternary additive problem. Proc. Lond. Math. Soc. 1980, 41, 516–532. [Google Scholar] [CrossRef]
  15. 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]
  16. Davenport, H. On Waring’s problem for cubes. Acta Math. 1939, 71, 123–143. [Google Scholar] [CrossRef]
  17. Lu, M.G. On Waring’s problem for cubes and fifth power. Sci. China Ser. A 1993, 36, 641–662. [Google Scholar]
  18. Kawada, K.; Wooley, T.D. Sums of fourth powers and related topics. J. Reine Angew. Math. 1999, 512, 173–223. [Google Scholar] [CrossRef]
  19. Vaughan, R.C. A new iterative method in Waring’s problem. Acta Math. 1989, 162, 1–71. [Google Scholar] [CrossRef]
  20. Brüdern, J.; Kawada, K. Ternary problems in additive prime number theory. In Analytic Number Theory; Jia, C., Matsumoto, K., Eds.; Kluwer: Dordrecht, The Netherlands, 2002; pp. 39–91. [Google Scholar]
  21. Zhao, L. On unequal powers of primes and powers of 2. Acta Math. Hungar. 2015, 146, 405–420. [Google Scholar] [CrossRef]
  22. Liu, Z.; Lü, G. On unlike powers of primes and powers of 2. Acta Math. Hung. 2011, 132, 125–139. [Google Scholar] [CrossRef]
  23. Lü, X.D. On unequal powers of primes and powers of 2. Ramanujan J. 2019, 50, 111–121. [Google Scholar] [CrossRef]
  24. Wooley, T.D. Slim exceptional sets and the asymptotic formula in Waring’s problem. Math. Proc. Camb. Philos. Soc. 2003, 134, 193–206. [Google Scholar] [CrossRef]
  25. Zhao, L. On the Waring-Goldbach problem for fourth and sixth powers. Proc. Lond. Math. Soc. 2014, 108, 1593–1622. [Google Scholar] [CrossRef]
  26. Pan, C.D.; Pan, C.B. Goldbach Conjecture; Science Press: Beijing, China, 1981. [Google Scholar]
  27. Ren, X.M. On exponential sums over primes and application in Waring–Goldbach problem. Sci. China Ser. A 2005, 48, 785–797. [Google Scholar] [CrossRef]
  28. Vinogradov, I.M. Elements of Number Theory; Dover Publications: New York, NY, USA, 1954. [Google Scholar]

Share and Cite

MDPI and ACS Style

Li, J.; Liu, C.; Zhang, Z.; Zhang, M. Exceptional Set for Sums of Symmetric Mixed Powers of Primes. Symmetry 2020, 12, 367. https://0-doi-org.brum.beds.ac.uk/10.3390/sym12030367

AMA Style

Li J, Liu C, Zhang Z, Zhang M. Exceptional Set for Sums of Symmetric Mixed Powers of Primes. Symmetry. 2020; 12(3):367. https://0-doi-org.brum.beds.ac.uk/10.3390/sym12030367

Chicago/Turabian Style

Li, Jinjiang, Chao Liu, Zhuo Zhang, and Min Zhang. 2020. "Exceptional Set for Sums of Symmetric Mixed Powers of Primes" Symmetry 12, no. 3: 367. https://0-doi-org.brum.beds.ac.uk/10.3390/sym12030367

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