Related papers: Primes in short intervals: Heuristics and calculat…
An interesting open conjecture asks whether it is possible to walk to infinity along primes, where each term in the sequence has one digit more than the previous. We present different greedy models for prime walks to predict the long-time…
The prime counting function inequality $\pi(x+y) < \pi(x)+\pi(y)$, which is known as Hardy-Littlewood conjecture, has been established for a variety of cases such as $ \delta x \leq y \leq x$, where $0< \delta \leq 1$, and $x \leq y\leq x…
We give an explicit form of Ingham's Theorem on primes in the short intervals, and show that there is at least one prime between every two consecutive cubes $x\sp{3}$ and $(x+1)\sp{3}$ if $\log\log x\ge 15$.
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…
Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example,…
We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…
We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…
Under long memory, the limit theorems for normalized sums of random variables typically involve a positive integer called "Hermite rank". There is a different limit for each Hermite rank. From a statistical point of view, however, we argue…
In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
In 1976, Gallagher showed that the Hardy--Littlewood conjectures on prime $k$-tuples imply that the distribution of primes in log-size intervals is Poissonian. He did so by computing average values of the singular series constants over…
We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…
In this paper we establish a number of new estimates concerning the prime counting function \pi(x), which improve the estimates proved in the literature. As an application, we deduce a new result concerning the existence of prime numbers in…
We adopt a physically motivated empirical approach to the characterisation of the distributions of twin and triplet primes within the set of primes, rather than in the set of all natural numbers. Remarkably, the occurrences of twins or…
Today, prime numbers attained exceptional situation in the area of numbers theory and cryptography. As we know, the trend for accessing to the largest prime numbers due to using Mersenne theorem, although resulted in vast development of…
We study Gaussian primes lying in narrow sectors, and show that almost all such sectors contain the expected number of primes, if the sectors are not too narrow.
We study the surprising discrepancy between the number of primes corresponding, respectively, to the two letters of an infinite word engendered by one of the simplest Lindenmayer systems. We formulate a conjecture concerning the rate of…
We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…
All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…
Learning interpretable models has become a major focus of machine learning research, given the increasing prominence of machine learning in socially important decision-making. Among interpretable models, rule lists are among the best-known…
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…