Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions about the famous conjecture from Riemann saying that the non-trivial zeroes of the Riemann Zeta function all lie on the so-called critical line $\Re(s)=\dfrac{1}{2}$, its various generalizations and the different approaches towards its solution.
5
votes
Analogues of the Riemann zeta function that are more computationally tractable?
Let $p_k$ be the $k$-th prime number, and pick a sequence of primes $q_k$, such that $q_k\sim p_k^{3/2}$. Let $G$ be the arithmetic semigroup consisting of all integers not divisible by one of the $q_ …
4
votes
Accepted
Numbers related to the Riemann hypothesis
Proving such results falls into three parts. First you take an effective version of the prime number theorem, which implies all your desired bound for sufficient. Second you write a computer program ( …