A possible proof for Riemann Hypothesis

3 points

10 years ago

I work with a professor,Dr. Kumar Eswaran, on several computer science problems especially in the neural network field. He is the quintessential prof who is always lost in thought and interested in solving unsolvable problems. So I was pleasantly surprised last week when he told me that he had found a proof for the Riemann Hypothesis.

The Professor was able to crack the Riemann Hypothesis because he used the properties of primes and analytic continuation and had a new way of handling slowly converging series and was able to use (at crucial point) concepts borrowed from Donald Knuth regarding random numbers and random sequences. Knuth had said that for any sequence to be truly random it has to be non-cyclic. The proof required to show that a sequence of +1's and -1's , obtained from the prime factorization of the infinite sequence of integers, had to be shown to be random and to asymptotically behave like the tosses of a coin.

Though I am good at computers and math, I am not an authority in math. So I thought I will put up the proof here and invite comments as Dr.Kumar does not know too much about Hackernews.

Links to proof:

https://arxiv.org/pdf/1609.06971v4.pdf

https://www.researchgate.net/publication/309205618_The_Dirichlet_Series_for_the_Liouville_Function_and_the_Riemann_Hypothesis

10 comments

10 comments