Related papers: Chen's primes and ternary Goldbach problem

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

Some interesting chaos phenomena have been found in the difference of prime numbers. Here we discuss a theme about the sum of two prime numbers, Goldbach conjecture. This conjecture states that any even number could be expressed as the sum…

In this paper, we investigate exceptional sets in the Waring-Goldbach problem for unlike powers. For example, estimates are obtained for sufficiently large integers below a parameter subject to the necessary local conditions that do not…

Let $\lambda$ be the Liouville function. Assuming the Generalised Riemann Hypothesis for Dirichlet $L$-functions (GRH), we show that for every sufficiently large even integer $N$ there are $a,b \geq 1$ such that $$ a+b = N \text{ and }…

A prime number $p$ is called a Schenker prime if there exists such $n\in\mathbb{N}_+$ that $p\nmid n$ and $p\mid a_n$, where $a_n = \sum_{j=0}^{n}\frac{n!}{j!}n^j$ is so-called Schenker sum. T. Amdeberhan, D. Callan and V. Moll formulated…

We prove that there are infinitely many solutions of $$ |\lambda_0+\lambda_1p+\lambda_2P_r|<p^{-\tau}, $$ where $r=3,$ $\tau=\frac1{118}$, and $\lambda_0$ is an arbitrary real number and $\lambda_1,\lambda_2\in\BR$ with $\lambda_2\neq0$ and…

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We select a partition from the set $\Sigma_{2n}$ uniformly at random. Let $2G_n$ be the number partitioned by…

In this article we study in depth the Dirichlet theorem, which states that if a, b are relative prime integers, the sequence p = an + b contains infinite prime numbers, we simplify and generalize this theorem, we enunciate some special…

Let $1 < c < 24/19$. We show that the number of integers $n \le N$ that cannot be written as $[p_1^c] + [p_2^c]$ ($p_1$, $p_2$ primes) is $O(N^{1-\sigma+\varepsilon})$. Here $\sigma$ is a positive function of $c$ (given explicitly) and…

If $a>b$ and $n>1$ are positive integers and $a$ and $b$ are relatively prime integers, then a large Zsigmondy prime for $(a,b,n)$ is a prime $p$ such that $p \,|\, a^n-b^n$ but $p \,\nmid \, a^m-b^m$ for $1 \leq m < n$ and either $p^2 \, |…

We show that the Gaussian primes $P[i] \subseteq \Z[i]$ contain infinitely constellations of any prescribed shape and orientation. More precisely, given any distinct Gaussian integers $v_0,...,v_{k-1}$, we show that there are infinitely…

In this note we use recent developments in sieve theory to highlight the interplay between Goldbach and de Polignac numbers. Assuming that the primes have level of distribution greater than $1/2$, we show that at least one of two nice…

In this paper, we partially solve an open problem, due to J.C. Molluzzo in 1976, on the existence of balanced Steinhaus triangles modulo a positive integer $n$, that are Steinhaus triangles containing all the elements of…

Improving on a theorem of Heath-Brown, we show that if $X$ is sufficiently large then a positive proportion of the values $\{n^3+2:n\in (X,2X]\}$ have a prime factor larger than $X^{1+10^{-52}}$.

Let $k\ge 2$ and $a_1, a_2, \cdots, a_k$ be positive integers with \[ \gcd(a_1, a_2, \cdots, a_k)=1. \] It is proved that there exists a positive integer $G_{a_1, a_2, \cdots, a_k}$ such that every integer $n$ strictly greater than it can…

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the…

Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as…