Emergent Mind
On integers as the sum of a prime and a $k$-th power
(0908.0554)
Published Aug 5, 2009
in
math.NT
and
cs.DS
Abstract
Let $\mathcal{R}k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define Ek(X) := |{n \le X, n \in Ik, n\text{not a sum of a prime and a $k$-th power}}|. Hardy and Littlewood conjectured that for $k = 2$ and $k=3$, Ek(X) \ll_{k} 1. In this note we present an alternative approach grounded in the theory of Diophantine equations towards a proof of the conjecture for all $k \ge 2$.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.