2000 character limit reached
Representation of even integers as a sum of squares of primes and powers of two
Published 27 Sep 2021 in math.NT | (2109.13174v3)
Abstract: In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even number is the sum of two primes and at most $K$ powers of 2. Since then, this style of approximation has been considered for problems similar to the Goldbach conjecture. One such problem is the representation of a sufficiently large even number as a sum of four squares of primes and at most $k$ powers of two. In 2014, Zhao proved this to be true with $k = 46$. In this paper, we reduce this to $k = 31$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.