All Questions
18 questions
12
votes
2
answers
1k
views
Prime differences and zero multiplicity
Concerning gaps between consecutive primes, Paul Erdős conjectured that:
$$\sum_{p_n < x} (p_n -p_{n-1})^2 = O(x \log x)$$
Let's call this hypothesis EH. Assuming the Riemann hypothesis (RH), ...
2
votes
1
answer
740
views
Does the Riemann hypothesis predict a bound for this prime-counting function?
Does the Riemann hypothesis predict an upper bound for
$$\left|f(x)-\left(\operatorname{li}(x)-\frac{x}{\log x} \right)\right|,\quad x\ge 2\tag{1}$$
where
$$f(x)=\sum\limits_{n=2}^x \frac{\Lambda(n)}{\...
1
vote
1
answer
286
views
GRH and the Euler product
Let $L(\chi, s)$ be the Dirichlet L-Function of a primitive character $\chi$. I believe, if I’m not mistaken, the convergence of the Euler product of $L(\chi, s)$ in the critical strip is known to be ...
5
votes
2
answers
1k
views
A question regarding Cramér's proof on prime gaps under the Riemann Hypothesis
Let $p_n$ be the $n$th prime. Assuming the Riemann hypothesis, Harald Cramér proves that $p_n-p_{n-1}\le C(\sqrt p_n \log p_n)$ for sufficiently large $n$. Is there a value known for the constant $C$ ...
0
votes
1
answer
249
views
How differently would we model the distribution of primes if prime gap is larger?
Cramer's conjecture based on his random model provides prime gaps are bound by $O(\log^2p_n)$ where the gap is between $(n+1)$th and $n$th prime.
How differently would primes be modeled if gaps of $O(...
0
votes
0
answers
185
views
On the asymptotics of the Chebyshev psi function
Denote by $\psi(x)$ the Chebyshev psi function over prime powers. Assuming the RH, it can be shown via the Riemann explicit formula that
$$\psi(x)-x \ll √x |\sum_{|\gamma| < T} \frac{1}{\rho} | +...
2
votes
0
answers
537
views
Explicit formula for $n$th prime in terms of Riemann zeros:
We all know there exists an explicit Formula for prime counting function in terms of Riemann zeros.
I'm wondering if similar formula exists for $n$th prime in terms of Riemann zeros?
Or any other ...
4
votes
0
answers
884
views
Has any professional mathematician ever attempted to solve the Riemann hypothesis using only number theory? [closed]
I have often heard people saying that ''all attempts at solving the Riemann hypothesis using number theory have failed.'' But in the literature, i cannot find any failed ''purely number-theoretic'' ...
2
votes
0
answers
158
views
On the connection between $\pi(x)-Li(x)$ and $\theta(x)-x$
Let $\pi(x)$ be the number of primes $p$ not exceeding $x, \theta(x) = \sum_{p\leq x} \log p$ and $Li(x)$ be the logarithmic integral.
Is it true that
$$\pi(x)-Li(x) = \theta(x) - x + O(x^{1/2}\log^{...
4
votes
2
answers
2k
views
Chebyshev's bias-conjecture and the Riemann Hypothesis
Chebyshev's bias-conjecture that says "there are more primes of the form 4k + 3 than of the form 4k + 1" and the Riemann Hypothesis are equivalent? That means, one implies the other (if and only if)?
3
votes
1
answer
276
views
Almost-Primes in Short Intervals
Let $S$ be the set of integers which are a product of $k$ distinct primes, $k$ a fixed positive integer (the condition that the primes are distinct is not crucial). Landau used the Prime Number ...
14
votes
2
answers
739
views
How many zeta zeros are needed to accurately calculate five digits for π(1000000), where π(x) is the prime counting function?
John Derbyshire in his book PRIME OBSESSION says on page 343:
"I’ll round off with a complete calculation of $\pi(1,000,000)$, the
number of primes up to one million, using Riemann’s formula -- ...
0
votes
0
answers
112
views
Explicit formula for k-central numbers
Given a positive integer $ n $ and assuming Goldbach's conjecture, let $r_{0}(n)$ denote the smallest non negative integer $r$ such that both $n-r$ and $n+r$ are primes. Let $k_{0}(n)$ denote 'the ...
0
votes
2
answers
669
views
Does theta(n)<n for all n imply the Riemann Hypothesis and/or vice versa?
I know that better and better bounds of the Chebyshev Theta and Psi functions are implied by knowing that the first (insert large number here) zeta zeroes lie on the Critical Line. These bounds, ...
4
votes
0
answers
624
views
Is there a hidden symmetry in the prime numbers distribution?
Under Goldbach's conjecture, let's consider once again the map $r_0\colon n\mapsto r_{0}(n)$ such that $r_{0}(n)$ is the smallest non negative integer $r$ such that both $n-r$ and $n+r$ are prime.
Let'...
2
votes
1
answer
377
views
Prime Number Theorem on APs under various conjectures
I'm trying to find the best asymptotic expansions for $\pi(x; a, q)$ in various states:
Unconditionally we have
\begin{equation}
\pi(x; a, q) = \frac{\operatorname{li(x)}}{\phi(q)} + O\left(x \...
7
votes
1
answer
1k
views
Heuristic for Montgomery's conjecture
This is my third question on this site regarding Montgomery's conjecture -- and I apologize
if this is too much -- but I am still not understanding well why this conjecture is believed to be true.
...
4
votes
1
answer
489
views
Estimate on the prime-counting function $\psi(x)$.
There is an elementary statement that I believe I have read somewhere, but I can't remember where. I'd like to know if the statement is correct (in which case it is surely standard) and if so, where I ...