Exceptional Set for Sums of Symmetric Mixed Powers of Primes

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.


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 k 1 1 + x k 2 2 + · · · + x k s 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 s k-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. 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 s k-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 s k-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 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 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 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 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 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 (mod2), the following Diophantine equation 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 (mod2), up to N, which can not be represented as 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.
. N is a sufficiently large integer and n ∈ (N/2, N], and hence log N log n.

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 By Dirichlet's rational approximation lemma (for instance, see Lemma 12 on p.104 of [26], for some integers a, q with 1 a q Q 2 and (a, q) = 1. Define Then we obtain the Farey dissection From (5), one has In order to prove Theroem 1, we need the two following propositions: S(n) n 13 12 log 4 n + O n 13 12 where S(n) is the singular series defined in (10), which is absolutely convergent and satisfies for any integer n satisfying n ≡ 0 (mod2) 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. This completes the proof of Theorem 1.

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 where δ k = 1 2 + log k log 2 and c is a constant.

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 .

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 This completes the proof of Lemma 4.
For 1 a q with (a, q) = 1, set For α ∈ m 2 , by Lemma 1, we have say. Then we obtain the following Lemma.

Lemma 5. We have
This completes the proof of Lemma 5.

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 where χ 0 is the principal character modulo q. Let χ 1 , χ 2 , χ 3 , χ 4 be Dirichlet characters modulo q. Set Proof. See the Problem 14 of Chapter VI of Vinogradov [28].

Lemma 7. Let p be a prime and p
Proof. See Lemma 8.3 of Hua [7].
For k 1, we define S k (q, a) = q ∑ m=1 e am k q .
Proof. We denote by S the left-hand side of (11). It follows from Lemma 8 that If |A k | = 0 for some k ∈ {1, 2, 3, 4}, then S = 0. If this is not the case, then S = 1 From Lemma 8, the quadruple outer sums have no more than 4! = 24 terms. For each of these terms, there holds 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 By noting the fact that τ(χ 0 ) = −1 for principal character χ 0 mod p, we derive that From the above arguments, we deduce that which completes the proof of Lemma 9.
Lemma 10. Let L(p, n) denote the number of solutions of the congruence Then, for n ≡ 0 (mod2), we have L(p, n) > 0.

Proof. We have
By Lemma 8, we obtain 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 For (q 1 , q 2 ) = 1, there holds C k (q 1 q 2 , a 1 q 2 + a 2 q 1 ) = Putting (13) into (12), we deduce that This completes the proof of Lemma 11.

Lemma 12.
Let A(n, q) be as defined in (10). Then 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), Proof. From Lemma 11, we know that B(n, q) is multiplicative in q. Therefore, there holds 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 Write Then 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 On the other hand, from Lemma 9, we can see that the first term in (16) is 2 4 · 24p − 3 2 = 384p − 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 and therefore  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 Plainly, one has |ξ j (n)| = 1 whenever ξ j (n) is nonzero. Therefore, we obtain ∑ n∈Z j (N) where the exponential sum K j (α) is defined by ξ j (n)e(−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