Waring-Goldbach problems for one square and higher powers

This paper proves that every sufficiently large odd integer can be expressed as the sum of one square and fourteen fifth powers of primes, while every sufficiently large even integer can be written as the sum of one square, one biquadrate, and twelve fifth powers of primes.

The Gist

Imagine you are a master chef trying to bake a very specific, giant cake. The recipe has a strict rule: you must use exactly one square-shaped ingredient (like a square cookie) and a bunch of fifth-power-shaped ingredients (think of these as hyper-cubes, or ingredients stacked in a very specific, complex 3D pattern).

The big question mathematicians have been asking for decades is: "If I have a huge number of ingredients (a large integer), can I always find a way to mix them together to make the cake, provided I use only 'prime' ingredients?"

In this paper, the author, Geovane Matheus Lemes Andrade, acts as the head chef who finally proves that yes, you can.

Here is the breakdown of what he did, using simple analogies:

1. The Goal: The "Prime" Cake

In the world of math, there's a famous game called the Waring-Goldbach problem.

• The Players: You have numbers like 2, 3, 5, 7, 11, etc. (these are primes).
• The Shapes: You can square them ($p^2$) or raise them to the 5th power ($p^5$).
• The Challenge: Can you take a giant number (like a trillion) and break it down into a sum of these prime shapes?

Previous chefs (mathematicians) had tried this. They knew you could do it if you used many fifth-power ingredients, but they wanted to use as few as possible.

• Old Recipe: You needed 1 square + 17 fifth-powers to make the cake.
• New Recipe (This Paper): You only need 1 square + 14 fifth-powers.

2. The Two Special Cakes

The author proves two specific recipes work for "sufficiently large" numbers (meaning, if the number is big enough, the recipe works perfectly):

• The Odd Cake: If your number is odd, you can write it as:
  $$1 \text{ (Prime Square)} + 14 \text{ (Prime Fifth Powers)}$$
• The Even Cake: If your number is even, you can write it as:
  $$1 \text{ (Prime Square)} + 1 \text{ (Prime Fourth Power)} + 12 \text{ (Prime Fifth Powers)}$$

3. The Tools: The "Circle Method"

How did he prove this? He used a famous mathematical tool called the Circle Method.

Imagine the number line as a giant clock face (a circle).

• The Major Arcs (The Main Stage): This is where the "good" numbers live. These are the times on the clock where the ingredients line up perfectly. The author shows that if you look at these main stages, there are so many ways to combine the primes that you are guaranteed to find a solution. It's like having a massive buffet where you can't possibly fail to find a combination that adds up to your target.
• The Minor Arcs (The Backstage Noise): These are the weird, chaotic parts of the clock where the numbers don't line up nicely. Usually, these create "noise" that messes up the calculation. The author's job was to prove that this noise is so quiet (mathematically speaking) that it doesn't drown out the signal from the Main Stage.

4. The Secret Sauce: "Pruning" and "Squeezing"

To get the number of ingredients down from 17 to 14, the author had to be very precise.

• The Squeeze (Hölder's Inequality): He used a mathematical "squeezer" to tighten the bounds. He showed that even if you lose a little bit of efficiency in one area, you can make up for it elsewhere.
• The Pruning (Cutting the Fat): He used advanced techniques (like the Vinogradov Mean Value Theorem) to "prune" the problem. Imagine you have a bush with too many branches. He carefully cut away the branches that didn't matter, leaving only the essential ones needed to prove the cake works. This allowed him to reduce the count of fifth-powers needed.

5. Why Does This Matter?

You might ask, "Who cares about adding prime squares and fifth powers?"

• It's a Puzzle: It's like solving a Sudoku on a cosmic scale. Every time we prove a number can be built from fewer pieces, we understand the "DNA" of numbers better.
• It Shows Power: It proves that our mathematical tools (the Circle Method) are getting sharper. We are moving from "we think this is possible" to "we know exactly how many pieces we need."
• The "Odd" vs. "Even" Twist: The fact that the recipe changes slightly depending on whether the number is odd or even shows the deep, hidden structure of how numbers interact.

Summary

Geovane Andrade took a difficult math puzzle that had been stuck for a while. He used a giant mathematical magnifying glass (the Circle Method) to look at how prime numbers behave. He proved that for any huge number, you don't need a mountain of ingredients to build it; you only need a small, specific handful (one square and 14 fifth-powers).

He essentially said: "Stop guessing. The recipe is proven. If you have a big enough number, you can always build it with these specific prime ingredients."

Technical Summary

Here is a detailed technical summary of the paper "Waring–Goldbach problems for one square and higher powers" by Geovane Matheus Lemes Andrade.

1. Problem Statement

The paper addresses a specific variant of the Waring–Goldbach problem, which seeks to represent large integers as sums of powers of prime numbers. Specifically, the author investigates the representation of large integers as the sum of one square and a specific number of higher powers (specifically 4th and 5th powers) of primes.

The core questions addressed are:

1. Can every sufficiently large odd integer $n$ be written as $n = x_1^2 + x_2^5 + \dots + x_{15}^5$, where all $x_i$ are primes?
2. Can every sufficiently large even integer $n$ be written as $n = x_1^2 + x_2^4 + x_3^5 + \dots + x_{14}^5$, where all $x_i$ are primes?

This work improves upon previous bounds established by M. Zhang, J. Li, and F. Xue (2024), who proved the result for even integers using 17 fifth powers. Andrade reduces the required number of fifth powers to 14 (for the even case with an added biquadrate) and establishes the result for odd integers using 14 fifth powers (plus one square).

2. Methodology

The proof relies on the Hardy–Littlewood Circle Method, a standard analytic number theory technique for additive problems. The method involves analyzing the exponential sum associated with the representation problem.

Key Components of the Approach:

• Generating Functions:
  The author defines exponential sums over primes:

  • $f_k(\alpha) = \sum_{P_k/2 < p \le P_k} e(\alpha p^k) \log p$, where $P_k = n^{1/k}$.
  • Specific auxiliary functions $g_j(\alpha)$ involving fifth powers with varying ranges defined by parameters $\lambda_j$.
  • The main generating functions are constructed as:
    • $F_1(\alpha) = f_2(\alpha)f_5(\alpha)^4 G(\alpha)$ (for odd $n$)
    • $F_2(\alpha) = f_2(\alpha)f_4(\alpha)f_5(\alpha)^2 G(\alpha)$ (for even $n$)
    • Where $G(\alpha)$ is a product of $g_j(\alpha)$ terms designed to optimize the mean value estimates.

• Major and Minor Arcs:
  The unit interval $[0, 1]$ is partitioned into:

  • Major Arcs ($\mathcal{M}$): Intervals around rational numbers $a/q$ with small denominators. Here, the exponential sums are approximated using singular series and singular integrals.
  • Minor Arcs ($\mathfrak{m}$): The complement of the major arcs. The goal is to show that the contribution from these arcs is negligible compared to the main term.

• Analytic Tools:

  • Mean Value Estimates: The author utilizes deep results from Hooley, Brüdern, Thanigasalam, and Kawada–Wooley to bound the number of solutions to associated Diophantine equations.
  • Vinogradov Mean Value Theorem (VMVT): Recent advances in VMVT are used to handle fractional contributions involving fifth powers.
  • Kumchev's Bounds: Used for exponential sums over primes to control the error terms on the minor arcs.
  • Hölder's Inequality: Applied to separate the "fractional" fifth power contribution, allowing the use of specific bounds for the remaining terms.
  • Pruning Argument: A technique to refine the ranges of integration and eliminate negligible contributions.

3. Key Contributions and Technical Results

A. Improved Bounds for $s(k)$

The paper refines the known bounds for $s_1(k)$, the minimal number of $k$-th powers of primes needed (along with one square) to represent large integers.

• Previous Best (for $k=5$): 17 fifth powers (Zhang, Li, Xue).
• New Result:
  • Odd Integers: $n = p_1^2 + \sum_{i=2}^{15} p_i^5$ (1 square + 14 fifth powers).
  • Even Integers: $n = p_1^2 + p_2^4 + \sum_{i=3}^{14} p_i^5$ (1 square + 1 biquadrate + 12 fifth powers).

B. Theoretical Framework

The author introduces a sophisticated parameterization using $\lambda_j$ values derived from Kawada and Wooley's work.

• Defined $\Lambda = 2\lambda_9 + \sum_{j=1}^8 \lambda_j$, leading to a specific constant $\lambda \approx 0.00365$.
• Established lower bounds for the number of solutions $\nu_j(n)$:
  $$\nu_j(n) \gg n^{\Theta_j}$$
  where $\Theta_1 = \frac{3}{10} + \frac{\Lambda}{5}$ and $\Theta_2 = \frac{3}{20} + \frac{\Lambda}{5}$.

C. Handling the Minor Arcs

A significant technical hurdle in Waring–Goldbach problems is bounding the exponential sums on the minor arcs.

• The author isolates the contribution of the fifth power sums ($f_5$) by defining sets $E_j$ where $|f_5(\alpha)|$ is small.
• On the complement of these sets, the author applies Lemma 2.2 from [13] (related to VMVT) and Kumchev's bounds to show that the exponential sums decay sufficiently fast.
• The proof demonstrates that the integral over the minor arcs is $O(n^{\Theta_j} L^{-1})$, which is negligible compared to the main term on the major arcs.

4. Results

Theorem 1:

1. Odd Case: Every sufficiently large odd integer $n$ can be expressed as the sum of one square of a prime and fourteen fifth powers of primes.
2. Even Case: Every sufficiently large even integer $n$ can be expressed as the sum of one square of a prime, one biquadrate (4th power) of a prime, and twelve fifth powers of primes.

The proof confirms that the singular series $S_j(n)$ is bounded away from zero ($S_j(n) \gg 1$) for all sufficiently large $n$ satisfying the parity conditions, ensuring the existence of solutions.

5. Significance

• Advancement in Additive Number Theory: This work pushes the boundaries of the Waring–Goldbach problem for $k=5$. Reducing the number of required variables from 17 to 14 (and 12 in the even case with a biquadrate) represents a significant tightening of the bounds.
• Methodological Synthesis: The paper successfully integrates classical circle method techniques with modern refinements in the Vinogradov Mean Value Theorem and prime exponential sum bounds. This synthesis provides a template for tackling similar problems with higher powers.
• Resolution of Specific Cases: While the general Waring–Goldbach problem for arbitrary $k$ remains open, this paper provides a definitive solution for the specific case of one square plus fifth powers, contributing to the broader understanding of how primes distribute in additive bases.

In summary, Andrade's paper is a rigorous analytic number theory contribution that improves the known efficiency of representing large integers as sums of primes and powers, utilizing a combination of classical and cutting-edge analytic techniques.