Related papers: A note on an average additive problem with prime n…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
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…
While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…
If the prime numbers are pseudo-randomly distributed, then analogy with quantum systems suggests that counting primes might be modeled by a non-homogeneous Poisson process. Consequently, postulating underlying gamma statistics, more-or-less…
We give an exposition of some connections between Fourier optimization problems and problems in number theory. In particular, we present some recent conditional bounds under the generalized Riemann hypothesis, achieved via a Fourier…
We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…
We investigate the behaviour of a certain additive function depending on prime divisors of specific integers lying in large gaps between consecutive primes. The result is obtained by a combination of results and ideas related to large gaps…
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…
We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…
For $i\in \{1,2,3\}$, let $E_i(x)$ denote the error term in each of the three theorems of Mertens on the asymptotic distribution of prime numbers. We show that for $i\in \{1,2\}$ the Riemann hypothesis is equivalent to the condition…
In this paper we study multiple ergodic averages for "good" variable polynomials. In particular, under an additional assumption, we show that these averages converge to the expected limit, making progress related to an open problem posted…
We evaluate friable averages of arithmetic functions whose Dirichlet series is analytically close to some complex power of the Riemann zeta function. We obtain asymptotic expansions resembling those provided by the Selberg-Delange method in…
Assuming the validity of Riemann Hypothesis (RH), we derive the explicit bilateral estimates ("narrow passage") of the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals. These results are reversable,…
We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…
A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…
We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.
We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{\alpha,\beta}$, where $\alpha>1$ is irrational and of finite type.
We describe a generalization of the large sieve to situations where the underlying groups are nonabelian, and give several applications to the arithmetic of abelian varieties. In our applications, we sieve the set of primes via the system…
For n>1, let G(n)=\sigma(n)/(n log log n), where \sigma(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) \ge \max(G(N/p),G(aN)), for all prime…