The Riemann ζ function plays a significant role in number theory and is defined by ζ(s)=∞∑n=11ns for σ>1 and s=σ+it

The Riemann hypothesis asserts that all the non-trivial zeroes of the ζ function lie on the line Re(s)=12.

My question is:

Why are we interested in the zeroes of the ζ function? Does it give any information about something?

What is the use of writing ζ(s)=∏p(1−1ps)−1

**Answer**

**Short answer:** Understanding the distribution of the prime numbers is directly related to understanding the zeros of the Riemann Zeta Function.**

**Long Answer:** The prime counting function is defined as π(x)=∑p≤x1, which counts the number of primes less than x. Usually we consider its weighted modification ψ(x)=∑pm≤xlogp where we are also counting the prime powers. It is not hard to show that π(x)=ψ(x)logx(1+O(1logx)), which means that these two functions differ by about a factor of logx.

The prime number theorem states that ψ(x)∼x, but this is quite hard to show. It was first conjectured by Legendre in 1797, but took almost 100 years to prove, finally being resolved in 1896 by Hadamard and de la Vallée Poussin. In 1859 Riemann outlined a proof, and gave a remarkable identity which changed how people thought about counting primes. He showed that (more or less) ψ(x)=x−∑ρ:ζ(ρ)=0xρρ−ζ′(0)ζ(0), where the sum is taken over all the zeros of the zeta function. ++

Notice that this is *an equality.* The left hand side is a step function, and on the right hand side, somehow, the zeros of the zeta function *conspire at exactly the prime numbers* to make that sum jump. (It is an infinite series whose convergence is not uniform) If you remember only 1 thing from this answer, make it the above explicit formula.

**An equivalence to RH:** Current methods allow us to prove that ψ(x)=x+O(xe−c√logx). This error term decreases faster then x(logx)A for any A, but increases faster then x1−δ for any small δ>0. In particular, proving that the error term was of the form O(x1−δ) for some δ>0 would be an enormous breakthrough. The Riemann Hypothesis is equivalent to showing the error term is like square root x, that is proving the statement ψ(x)=x+O(x12log2x). In other words, the Riemann Hypothesis is equivalent to improving the error term when counting the prime numbers.

**Remark:** In your question you incorrectly state the Riemann Hypothesis, which says that **all** zeros have real part 12. The fact that infinitely many zeros lie on the line was shown by Hardy in 1917, and in 1942 Selberg showed that a positive proportion lie on the line. In 1974 Levinson showed that this proportion was at least 13, and Conrey 1989 improved this to 25.

** Of course, there may be some people who are interested in the zeros of the zeta function for other reasons. Historically the prime numbers are what first motivated the study of the zeros.

++: Usually the trivial zeros will be separated out of the sum, but I do not make this distinction here. Also, Riemann’s original paper states things in terms of Π(x) and li(x), the Riemann pi function and logarithmic integral, rather then ψ(x). This is a very slight difference, and I use ψ(x) above because it is easier and cleaner to do so.

**See also:** Why is ζ(1+it)≠0 equivalent to the prime number theorem?

**Attribution***Source : Link , Question Author : Karna , Answer Author : Eric Naslund*