Related papers: The prime counting function
It has been well known since Fermat's Little Theorem was first published that it is possible to determine that a number is composite without determining any of its nontrivial factors. It is natural to ask whether it is also possible to…
The division operation is important for many areas of data processing. Especially considering today's demand for hardware accelerators for machine learning algorithms, there is a high demand for an efficient calculation of the division…
The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…
In this paper we introduce the prime index function \begin{align}\iota(n)=(-1)^{\pi(n)},\nonumber \end{align} where $\pi(n)$ is the prime counting function. We study some elementary properties and theories associated with the partial sums…
We present an explicit formula for a weighted sum over the zeros of the Riemann zeta function. This weighted sum is evaluated in terms of a sum over the prime numbers, weighted with help of the Hermite polynomials. From the explicit formula…
Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
We derived the formulae of central differentiation for the finding of the first and second derivatives of functions given in discrete points, with the number of points being arbitrary. The obtained formulae for the derivative calculation do…
Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime…
Using some simple combinatorial arguments, we establish some new estimates for the prime counting function and its allied functions. In particular we show that \begin{align}\pi(x)=\Theta(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber…
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.
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…
Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions.
We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.
We present methods that provide all zeroes and extrema of a function that do not require differentiation. Using point process theory, we are able to describe the locations of zeroes or maxima, their number, as well as their distribution…
Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…
Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…
We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…
A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…
Obtained a new property of superposition of the generating functions ln(1/(1-F(x))), where F(x) - generating function with integer coefficients, which allows the construction a primality tests. The theorem which is based on compositions of…