Related papers: Vinogradov's Theorem with Fouvry-Iwaniec Primes

We give a new proof of Vinogradov's three primes theorem, which asserts that all sufficiently large odd positive integers can be written as the sum of three primes. Existing proofs rely on the theory of L-functions, either explicitly or…

Let $\theta > 11/20$. We prove that every sufficiently large odd integer $n$ can be written as a sum of three primes $n = p_1 + p_2 + p_3$ with $|p_i - n/3| \leq n^{\theta}$ for $i\in\{1,2,3\}$.

We prove that, for any $c_1,c_2,c_3\in(1,41/35)$, every sufficiently large odd number $N$ can be represented as the sum of three primes $N = p_1 + p_2 +p_3$ such that $p_i = \lfloor n_{i}^{c_i}\rfloor$ for some $n_i \in{\mathbb N}$ for each…

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

In this paper, we proved a theorem that every large enough odd number can be represented as the sum of three almost equal Piatetski-Shapiro primes.

n 1937 Ivan Vinogradov proved the three prime sum version of the Goldbach Conjecture, often called the weak form of Goldbach Conjecture. And that it holds for "sufficiently large" odd natural numbers. In this work we use Dirichlet Theorem,…

Vinogradov's three primes theorem indicates that, for every sufficiently large odd integer $N$, the equation $N=p_1+p_2+p_3$ is solvable in prime variables $p_1,p_2,p_3$. In this paper, it is proved that Vinogradov's three primes theorem…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 5/8, then all sufficiently large odd positive integers can be written as the sum of three primes in A. The constant 5/8 in this statement…

Let $g$ be sufficiently large, $b\in\{0,\ldots,g-1\}$, and $\mathcal{S}_b$ be the set of integers with no digit equal to $b$ in their base $g$ expansion. We prove that every sufficiently large odd integer $N$ can be written as $p_1 + p_2 +…

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…

We prove that every integer $n \geq 10$ such that $n \not\equiv 1 \text{mod} 4$ can be written as the sum of the square of a prime and a square-free number. This makes explicit a theorem of Erd\H{o}s that every sufficiently large integer of…

We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.

A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

We prove that every integer greater than two may be written as the sum of a prime and a square-free number.

We prove a generalisation of Vinogradov's theorem by finding for $m\geqslant 3$ and fixed positive integers $c_1, \dots ,c_m, r_1, \dots , r_m$ the asymptotics of the number of sequences $(n_1, \dots ,n_m) \in \mathbf{N}^{m}$ such that…

We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

Let $\mathbf H_2$ denote the set of even integers $n \not\equiv 1 \pmod 3$. We prove that when $H \ge X^{0.33}$, almost all integers $n \in \mathbf H_2$, $X < n \le X + H$ can be represented as the sum of a prime and the square of a prime.…