Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
541 views

Prime number theorem via the explicit formula

Can the prime number theorem be obtained from the explicit formula, $\psi(x)=x-\sum_{\zeta(\rho)=0}\frac{x^\rho}{\rho}+O(1)$? Here, $\psi(x)=\sum_{k=1}^\infty\sum_{p^k<x}\log p$
Mustafa Said's user avatar
  • 3,699
1 vote
1 answer
122 views

Best possible unconditional partial sum estimate of $\sum_{p\leq x}\frac{\ln(p)}{({p})^{n/2}}$:

Consider the following partial sum: $$S(x,n)=\sum_{p\leq x}\frac{\ln(p)}{({p})^{n/2}}$$ Here p runs through primes and $n$ is constant What is the best possible unconditional( using best known version ...
Zaza's user avatar
  • 149
2 votes
1 answer
300 views

Averages of Möbius function in arithmetic progressions

It is mentioned in multiple occasions here that the bound $$ \mathop{\sum_{n=1}^{N}}_{n\equiv a\mod l} \mu(n) = o(N) $$ is equivalent to the prime number theorem in arithmetic progressions. But I am ...
Krishnarjun's user avatar
2 votes
1 answer
138 views

Is $\lim_{s \rightarrow 1} E(f(X_s)) = \lim_{N \rightarrow \infty} \frac{1}{N} \sum_{k=1}^N f(k)$?

Let $s>1$ be a real number. We look at the zeta probability function / Zipf probability function defined as: $$P(X = n) = \frac{1}{n^s \zeta(s)}$$ Suppose $f: \mathbb{N} \rightarrow \mathbb{R}$ is ...
mathoverflowUser's user avatar
11 votes
4 answers
707 views

Deriving an asymptotic for $\pi(x)$ directly from $\log \zeta(s)$?

Denote by $\pi(x)$ the number of primes $p\leq x$. We generally give approximations for $\pi(x)$ by first approximating $\psi(x) = \sum_{n\leq x} \Lambda(n)$. Part of the reason is presumably that, if ...
H A Helfgott's user avatar
  • 20.2k
2 votes
0 answers
311 views

Proving that the Riemann zeta function is zero free on Re=1 using the prime number theorem

Is $\frac{-\zeta'(s)}{\zeta(s)}+\frac{-s}{s-1}$ an analytic continuation, holomorphic for $Re\ s > 0,\ s\neq 1$, of $f(s)=s\int_{1}^{\infty}\frac{\psi(x)-x}{x^{s+1}}\mathrm{d}x$? If so: Let $s_{0}$ ...
Juu's user avatar
  • 129
-1 votes
1 answer
175 views

Any simplification of this inequality if it is true? :For $t\geq 1.22$: $|\zeta(0.5+it)|\leq 0.5 \frac{|\Gamma(0.5+it)|}{|\Gamma(-0.5+it)|}$

When I tried to give bounds for $\zeta(0.5+it)$ using some transformations over Gamma function using the function $f(x)=\exp(-n x)$ over the range $(0,+\infty)$ , For $ Re(s)=\frac12 $ and $t >0$ ...
zeraoulia rafik's user avatar
5 votes
0 answers
137 views

Is finding positive integer solutions of $\zeta(a/b) = c$ equivalent to deciding the rationality of $\gamma$?

This question requires little bit of explanation of the background hence it is a bit lengthy. Note: The question was initially posted in MSE but did not get answers hence posting in MO. For every ...
Nilotpal Kanti Sinha's user avatar
50 votes
5 answers
3k views

Motivated account of the prime number theorem and related topics

Though my own research interests (described below) are pretty far from analytic number theory, I have always wanted to understand the prime number theorem and related topics. In particular, I often ...
Sarah's user avatar
  • 482
1 vote
1 answer
235 views

Counting prime powers $p^{\frac{k}{t}} \left( t \in \mathbb{R}{+}, k \in \mathbb{N} \right)$ by changing $\rho$'s in $\psi(x)$?

With $\rho=\beta+ \gamma \,i$ being a non-trivial zero of $\zeta(s)$, the logarithmic prime counting function is: $$\psi(x) = x - \log(2\pi) - \frac12 \log\left(1- \frac{1}{x^2}\right) - \sum_{\rho}...
Agno's user avatar
  • 4,169
10 votes
0 answers
739 views

Implications of divergence of $1/\zeta(s) $ at 1/2

$1/\zeta(s)=\sum_{n>0}\frac{\mu(n)}{n^s}$ where $\mu$ is the Moebius function. This series is known to converge for $s\ge 1$ and diverge for $s\le 1/2$. Its convergence is unknown if $1/2< s&...
Koushik's user avatar
  • 2,106