Related papers: On the Waring-Goldbach Problem for One Square and …
We show that all natural numbers $n\equiv 4\pmod 6$ are the sum of two Chen primes (primes $p$ such that $p+2$ has at most two prime factors), apart from a power-saving set of exceptions. This improves on various previous results and is…
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,…
Let $\mathcal{F}=\{f_1,\ldots,f_R\}$ be a family of forms of odd degrees at most $d$ in $s$ variables. We study the solutions to the system $f_1(\mathbf{x})=\ldots=f_R(\mathbf{x})=0$ of the form $x_i=y_ip_i$ with $|y_i|\leq Y_\mathcal{F}$…
We show the existence of weak solutions in the extended sense of the Cauchy problem for the cubic nonlinear Schr\"odinger equation in the modulation space $M_{p,q}^{s}(\mathbb R)$ where $1\leq q\leq2$, $2\leq p<\frac{10q'}{q'+6}$ and…
In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…
We consider a system of $R$ cubic forms in $n$ variables, with integer coefficients, which define a smooth complete intersection in projective space. Provided $n\geq 25R$, we prove an asymptotic formula for the number of integer points in…
In this paper we show that, for any fixed $1<c<967/805$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\varepsilon \end{equation*}…
Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.
The binary Goldbach conjecture asserts that every even integer greater than $4$ is the sum of two primes. In a preceding paper we have proved that there exists a positive integer $K_\alpha$ such that every even integer $x > p_k^2$ can be…
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…
In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…
Let $\sigma(n)$ be the sum of the positive divisors of $n$. A positive integer $n$ is said to be $2$-near perfect when $\sigma(n)=2n+d_1+d_2$, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We show that there are no odd…
Suppose that $c,d,\alpha,\beta$ are real numbers satisfying the inequalities $1<d<c<79/71$ and $1<\alpha<\beta<6^{1-d/c}$. In this paper, it is proved that, for sufficiently large real numbers $N_1$ and $N_2$ subject to $\alpha\leqslant…
We proved that any even number not less than 6 can be expressed as the sum of two old primes, $2n=p_i+p_j$
Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…
It is shown that if every odd integer $n > 5$ is the sum of three primes, then every even integer $n > 2$ is the sum of two primes. A conditional proof of Goldbach's conjecture, based on Cram\'er's conjecture, is presented. Theoretical and…
We investigate the number of representations of a large positive integer as the sum of two squares, two positive integral cubes, and two sixth powers, showing that the anticipated asymptotic formula fails for at most O((log X)^3) positive…
In this paper, we study a density version of the Waring-Goldbach problem. Suppose that A is a subset of the primes, and the lower density of A in the primes is larger than 1-1/2k. We prove that every sufficiently large natural number n…
Let $N$ be a sufficiently large real number. In this paper, it is proved that, for $1<c<\frac{1193}{889}$, the following Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c+p_4^c-N\big|<\log^{-1}N \end{equation*} is solvable in…
Erd\H{o}s asked whether there are infinitely many finite sets of distinct primes $p_1<\cdots<p_k$ and positive integers $m$ such that \begin{equation}\label{eq:erdos-original} \frac1{p_1}+\cdots+\frac1{p_k}=1-\frac1m. \end{equation} This is…