Related papers: An Exact Exprsssion of Pi(x)

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

The explicit evaluation of the partition function in the Schwarzian theory is presented.

Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…

We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.

In [3], we have introduced a probability measure to study the power and exponential sums for a certain coding system. The distribution function of the probability measure gives explicit formulas for the power and exponential sums.…

This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

A new set of formulas for primes is presented. These formulas are more efficient and grow much slower than the two known formulas of Mills and Wright. 3 new formulas are explained.

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

In this article, an exact series expansion for the Dottie number (solution of the equation $\cos(x) = x$) is presented. Its derivation consists in combining the Kaplan representation of the Dottie number as a series in odd powers of $\pi$,…

Simple divisibility rules are given for the 1st 1000 prime numbers.

In this note, we approximate the average of prime powers in the decomposition of $n!$ into prime numbers.

The Lambert W function, implicitly defined by W(x) exp{W(x)}=x, is a "new" special function that has recently been the subject of an extended upsurge in interest and applications. In this note, I point out that the Lambert W function can…

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…

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

The exact lower bound on the probability of the occurrence of exactly one of $n$ random events each of probability $p$ is obtained.

We explicitly describe an expansion of $e^{A+B}$ as an infinite sum of the products of $B$ multiplied by the exponential function of $A$. This is the explicit description of the Zassenhaus formula. We also express the…

Using a pointwise version of Fej\'{e}r's theorem about Fourier series, we obtain two formulae related to the series representations of positive integral powers of $\pi$. We also check the correctness of our formulae by the applications of…

Let $E_0,\ldots,E_n$ be a partition of the set of prime numbers, and define $E_j(x) := \sum_{p \in E_j \atop p \leq x} \frac{1}{p}$. Define $\pi(x;\mathbf{E},\mathbf{k})$ to be the number of integers $n \leq x$ with $k_j$ prime factors in…