Related papers: Approximating the Prime Counting Function via an O…
We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…
We will derive a function that eliminates any sequence of equidistant numbers from the integer numbers, then we will derive its inverse. Then we will use the Sequence elimination function to eliminate the multiples of the prime numbers from…
Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…
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 investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…
We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…
Using elementary methods we find surprising connections between the values of the Riemann Zeta Function over integers and the fractional parts of rational powers, and a connection between the Riemann Zeta Function and the Prime Zeta…
This article provides a proof of the famous \textit{Prime Number Theorem} by establishing an analogous statement of the same in terms of the second \textit{Chebyshev Function} $\psi(x)$. We shall be extensively using complex analytic…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…
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 introduce a new set of prime numbers functions including an exact Generating Function and a Discriminating Function of Prime Numbers neither based on prime number tables nor on algorithms. Instead these functions are defined in terms of…
We survey the classical results on the prime number theorem
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.
The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related $k$-tuple analogs of the first and second Chebyshev functions are then defined.
Formula for the nth prime using elementary arithmetical functions based in a previous formula changing the characteristic function of prime numbers.
An elementary method for computing various prime sequences using the sequence of Farey sequences is described.
Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
In this short note, we establish an operator theoretic version of the Wiener-Ikehara tauberian theorem, and point out how this leads to a new proof of the Prime number theorem that should be accessible to anyone with a basic knowledge of…