Related papers: On some additive problems in number theory (v.3)
This is a survey of the diversity of problems in additive number theory. Equity requires the consideration of less currently popular problems, and suggests their inclusion in the additive canon. Of particular interest are problems about the…
We make two algorithms that generate all prime numbers up to a given limit, they are a development of sieve of Eratosthenes algorithm, we use two formulas to achieve this development, where all the multiples of prime number 2 are eliminated…
In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…
A classification of twin primes implies special twin primes. When applied to triplets, it yields exceptional prime number triplets. These generalize yielding exceptional prime number multiplets.
This note highlights an interesting connection between Euler sums of even weight and prime numbers.
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
We extend known results on the number of solutions to a linear equation in at least three prime numbers when the primes involved are required to lie in specified Chebotarev classes. We prove asymptotic results similar to previous ones only…
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…
We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box $[-X,X]^4$ that satisfy the determinant equation $x_1x_2-x_3x_4=r$ for $r \neq 0$ with two of entries to be…
Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.
We discuss a structural approach to subset-sum problems in additive combinatorics. The core of this approach are Freiman-type structural theorems, many of which will be presented through the paper. These results have applications in various…
We give an analytic version of the injectivity theorem by using multiplier ideal sheaves, and prove some extension theorems for the adjoint bundle of dlt pairs. Moreover, by combining techniques of the minimal model program, we obtain some…
We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all…
For two odd primes $p$ and $q$ such that $p<q$, let $A(p,q):=(a_k)_{k=1}^{\infty}$ be the arithmetic progression whose $k$th term is given by $a_k=(k-1)(q-p)+p$ (i.e., with $a_1=p$ and $a_2=q$). Here we conjecture that for every positive…
Ova-angular rotations of a prime number are characterized, constructed using the Dirichlet theorem. The geometric properties arising from this theory are analyzed and some applications are presented, including Goldbach's conjecture, the…
Mixtures of hard hyperspheres in odd space dimensionalities are studied with an analytical approximation method. This technique is based on the so-called Rational Function Approximation and provides a procedure for evaluating equations of…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
A new Active Flux method for the multi-dimensional Euler equations is based on an additive operator splitting into acoustics and advection. The acoustic operator is solved in a locally linearized manner by using the exact evolution…
Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in…
The prime detecting function (PDF) approach can be effective instrument in the investigation of numbers. The PDF is constructed by recurrence sequence - each successive prime adds a sieving factor in the form of PDF. With built-in prime…