Related papers: Extreme values of the Dedekind $\Psi$ function
In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…
We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least.…
Let $p_n$ be the $n$th prime, and consider the sequence $s_n = (2\cdot3\cdots p_n)^{1/n} = (p_n\#)^{1/n}$, the geometric mean of the first $n$ primes. We give a short proof that $p_n/s_n \to e$, a result conjectured by Vrba (2010) and…
Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…
We show that if one of various cycle types occurs in the permutation action of a finite group on the cosets of a given subgroup, then every almost conjugate subgroup is conjugate. As a number theoretic application, corresponding…
The research shows that Riemann proved that all of zeros of Riemann's zeta function are on $\sigma=1/2$ based on the functional equation \begin{align*} \pi^{-\frac{s}{2}}\Gamma \left( \frac{s}{2} \right) \zeta(s)&={\frac{1}{s(s-1)} +…
The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…
For any natural number $n$, let $X'_n$ be the set of primitive Dirichlet characters modulo $n$. We show that if the Riemann hypothesis is true, then the inequality $|X'_{2n_k}|\le C_2 e^{-\gamma} \phi(2n_k)/\log\log(2n_k)$ holds for all…
We investigate the values of the Riemann zeta function at odd integers and the Dirichlet beta function at even integers, by collecting several distinct analytic frameworks converging to these values, thus providing a unifying perspective.…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
It is proved that $$\int_{T}^{2T} \left|\frac{\zeta\left(\frac{1}{2}+{\rm i} t\right)}{\zeta\left(1+2{\rm i} t\right)}\right|^2 {\rm d} t = \frac{1}{\zeta(2)} T \log T + \left( \frac{\log \frac{2}{\pi} + 2\gamma -1 }{\zeta(2)} -4…
A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…
Let consider the Pauli group $\mathcal{P}_q=<X,Z>$ with unitary quantum generators $X$ (shift) and $Z$ (clock) acting on the vectors of the $q$-dimensional Hilbert space via $X|s> =|s+1>$ and $Z|s> =\omega^s |s>$, with…
It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…
We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.
We prove the following result: Let $N \geq 2$ and assume the Riemann Hypothesis (RH) holds. Then \[ \sum_{n=1}^{N} R(n) =\frac{N^{2}}{2} -2 \sum_{\rho} \frac{N^{\rho + 1}}{\rho (\rho + 1)} + O(N \log^{3}N), \] where $\rho=1/2+i\gamma$ runs…
Some rapidly convergent formulae for special values of the Riemann zeta function are given. We obtain a generating function formula for zeta(4n+3) which generalizes Apery's series for zeta(3), and appears to give the best possible series…
Let $s(m,n)$ denote the classical \DED sum, where $n$ is a positive integer and $m\in\{0,1,\ldots, n-1\}$, $(m,n)=1$. For a given positive integer $k$, we describe a set of at most $k^2$ numbers $m$ for which $s(m,n)$ may be $\ge s(k,n)$,…
We define $\overline{\psi}$ to be the multiplicative arithemtic function that satisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), & \mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for all primes $p$…
Let $\sigma,t\in{\mathbb{R}}$, $s=\sigma+\mathrm{{i}}t$, $\Gamma (s)$ be the Gamma function, $\zeta(s)$ be the Riemann zeta function and $\xi(s):=s(s-1)\pi ^{-s/2}\Gamma(s/2)\zeta(s)$ be the complete Riemann zeta function. We show that…