Related papers: Counting Primes Rationally And Irrationally

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 present an elementary proof of the irrationality of $\zeta(5)$ based upon the Dirichlet's approximation theorem and the Prime Number Theorem.

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…

We prove the new upper bound 5.095412 for the irrationality exponent of $\zeta(2)=\pi^2/6$; the earlier record bound 5.441243 was established in 1996 by G. Rhin and C. Viola.

Standard prime-number counting functions, such as $\psi(x)$, $\theta(x)$, and $\pi(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $\pi_r(x) =…

The $2 q$-th pseudomoment $\Psi_{2q,\alpha}(x)$ of the $\alpha$-th power of the Riemann zeta function is defined to be the $2 q$-th moment of the partial sum up to $x$ of $\zeta^\alpha$ on the critical line. Using probabilistic methods of…

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

We obtain lower bounds of the correct order of magnitude for the 2k-th moment of the Riemann zeta function for all k > 1. Previously such lower bounds were known only for rational values of k, with the bounds depending on the height of the…

We discuss the best methods available for computing the gamma function $\Gamma(z)$ in arbitrary-precision arithmetic with rigorous error bounds. We address different cases: rational, algebraic, real or complex arguments; large or small…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

We introduce a zeta function counting imaginary quadratic number fields by their class numbers. It is proved that such a function is rational depending only on the eight roots of unity of degrees $1$ and $2$. As a corollary, one gets a…

New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…

Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…

This article provides a proof that the Ramanujan's Inequality given by, $$\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$$ holds unconditionally for every $x\geq \exp(43.5102147)$. In case for an alternate proof of the result stated…

We use a variant of Salikhov's ingenious proof that the irrationality measure of $\pi$ is at most $7.606308\dots$ to prove that, in fact, it is at most $7.103205334137\dots$. Accompanying Maple package: While this article has a fully…

We provide a lower bound for the dimension of the vector space spanned by 1 and by the values of the Riemann Zeta function at the first odd integers. As a consequence, the Zeta function takes infinitely many irrational values at odd…

Let $S(t) = \frac{1}{\pi}\Im \log\zeta\left(\frac{1}{2}+it\right)$. We prove an unconditional lower bound on the measure of the sets $\{t\in [T,2T] \colon S(t) \geq V\}$ for $\sqrt{\log\log T} \leq V \ll \left(\frac{\log T}{\log \log…

In this article, we show that $$ \left| N (T) - \frac{T}{ 2 \pi} \log \left( \frac{T}{2\pi e}\right) \right| \le 0.1038 \log T + 0.2573 \log\log T + 9.3675 $$ where $N(T)$ denotes the number of non-trivial zeros $\rho$, with $0<\Im(\rho)…

This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…

The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta…