On integers as the sum of a prime and a $k$-th power

Details On integers as the sum of a prime and a $k$-th power On integers as the sum of a prime and a $k$-th power

2009-08-05

arxiv.org/abs/0908.0554v25

Mathematics

Number Theory

This paper has been withdrawn by the author due to several errors in the manuscript, a prominent problem being that it has bee

Scientific paper

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 E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured that for $k = 2$ and $k=3$, E_k(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$.

Affiliated with

Also associated with

No associations

Rating

On integers as the sum of a prime and a $k$-th power does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On integers as the sum of a prime and a $k$-th power, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On integers as the sum of a prime and a $k$-th power will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253838