Related papers: On some additive problems in number theory (v.3)

Let $\eta$ be a quadratic irrationality. The variant of a ternary problem of Goldbach involving primes such that $a<\{\eta p\}<b$, where $a$ and $b$ are arbitrary numbers of the interval $(0,1)$, solved in this paper.

With the uniform positions we prove theorems of Landau and Hardy-Littlwood type for Goldbach, Chen, Lemoine-Levy and other binary partitions of positive integers. We also pose some new conjectures.

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

We study an asymptotic formula for average orders of Goldbach representations of an integer as the sum of k primes. We extend the existing result for k=2 to a general k, for which we obtain a better error term. Moreover, we prove an…

We examine the problem of writing every sufficiently large even number as the sum of two primes and at most $K$ powers of 2. We outline an approach that only just falls short of improving the current bounds on $K$. Finally, we improve the…

In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins

We develop a unified density-based framework for primality, coprimality, and prime pairs, and introduce an intrinsic normalized model for prime gaps constrained by the Prime Number Theorem. Within this setting, a structural tension between…

In the present paper we prove that every sufficiently large odd integer $N$ can be represented in the form \begin{equation*} N=p_1+p_2+p_3\,, \end{equation*} where $p_1,p_2,p_3$ are primes, such that $p_1=x^2 + y^2 +1$, $p_2=[n^c]$.

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…

High-dimensional partial-differential equations (PDEs) arise in a number of fields of science and engineering, where they are used to describe the evolution of joint probability functions. Their examples include the Boltzmann and…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

We study the binary Goldbach problem with arithmetic weights attached to one of the variables.

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

In this paper we prove that the binary Goldbach conjecture for sufficiently large even integers would follow under the assumption that both the Elliott-Halberstam conjecture and a variant of the Elliott-Halberstam conjecture twisted by the…

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…

Prime numbers, whose properties are important subjects in mathematics, are also fundamental in computer science notably in IT security, Cryptocurrencies as Bitcoin and Blockchain, cryptography, Code theory notably Error detection codes,…

A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd…

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,…