Sums of eight fourth power of primes
Yang Qu, Rong Ma

TL;DR
This paper proves that a positive proportion of large integers can be expressed as the sum of eight fourth powers of primes using circle method and sieve techniques.
Contribution
It establishes a lower bound on the density of integers representable as sums of eight prime fourth powers, advancing understanding of additive prime power representations.
Findings
Proves at least 1/414.465 of large integers are sums of eight prime fourth powers.
Uses circle method and sieve techniques for the proof.
Provides quantitative density results for such representations.
Abstract
For any sufficiently large , suppose that can be expressed as where are primes.For such , in this paper we will use circle method and sieves to prove that the proportion of in positive integers is at least .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Limits and Structures in Graph Theory
