Related papers: The prime counting function
We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…
In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.
It is shown that the Mean Value Theorem for arithmetic functions, and simple properties of the zeta function are sufficient to assemble proofs of the Prime Number Theorem, and Dirichlet Theorem. These are among the simplest proofs of the…
In this paper, we analyze properties of prime number sequences produced by the alternating sum of higher-order subsequences of the primes. We also introduce a new sieve which will generate these prime number sequences via the systematic…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Statistical distribution of the primes in an arithmetic progression is considered. The estimation of prime numbers is given and combinatorial methods are used to calculate the twin primes on the available interval. The distribution and…
This paper considers the topic of finding prior distributions when a major component of the statistical model depends on a nonlinear function. Using results on how to construct uniform distributions in general metric spaces, we propose a…
For a natural number n, let M(n) denote the maximum exponent of any prime power dividing n, and let m(n) denote the minimum exponent of any prime power dividing n. We study the second moments of these arithmetic functions and establish…
This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…
We consider the sum of the reciprocals of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an asymptotic expansion in the first case and an asymptotic formula involving an implicit parameter in the…
Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…
Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…
We conjecture average counting functions for prime $k$-tuples based on a gamma distribution hypothesis for prime powers. The conjecture is closely related to the Hardy-Littlewood conjecture for $k$-tuples but yields better estimates.…
By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…
Four functions counting the number of subsets of $\{1, 2, ..., n\}$ having particular properties are defined by Nathanson and generalized by many authors. They derive explicit formulas for all four functions. In this paper, we point out…
We consider a prior for nonparametric Bayesian estimation which uses finite random series with a random number of terms. The prior is constructed through distributions on the number of basis functions and the associated coefficients. We…
In this paper, we study the sum of the divisor function over sets with digit restrictions.
We give an informal survey of the historical development of computations related to prime number distribution and zeros of the Riemann zeta function.