HackerPapers

arXiv:1609.06971math.GM

The Dirichlet Series for the Liouville Function and the Riemann Hypothesis

K. Eswaran

Abstract

This paper investigates the analytic properties of the Liouville function's Dirichlet series that obtains from the function F(s)= zeta(2s)/zeta(s), where s is a complex variable and zeta(s) is the Riemann zeta function. The paper employs a novel method of summing the series by casting it as an infinite number of sums over sub-series that exhibit a certain symmetry and rapid convergence. In this procedure, which heavily invokes the prime factorization theorem, each sub-series has the property that it oscillates in a predictable fashion, rendering the analytic properties of the Dirichlet series determinable. With this method, the paper demonstrates that, for every integer with an even number of primes in its factorization, there is another integer that has an odd number of primes (multiplicity counted) in its factorization. Furthermore, by showing that a sufficient condition derived by Littlewood (1912) is satisfied, the paper demonstrates that the function F(s) is analytic over the two half-planes Re(s) > 1/2 and Re(s)<1/2. This establishes that the nontrivial zeros of the Riemann zeta function can only occur on the critical line Re(s)=1/2.

arXiv comments
40 pages, 1 figure. In this Version, some typos have been removed and the Appendix 5 is slightly modified and a new Appendix 6 has been added
Journal reference
DOI
Subjects
math.GMGeneral Mathematics

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Apr 2019 to May 2019. Found in 1 HN submission from Nov 2016 to Nov 2016. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

    • I have looked at Eswaran's paper that purports to prove RH and I'm pretty sure it's all wrong. (Currently-latest version of paper is here: https://arxiv.org/pdf/1609.06971v10.pdf) The basic idea is to prove that a certain function L(N) doesn't grow too quickly. It's true that…

      gjm11View on HNParent context

Submitted to Hacker News

  • A possible proof for Riemann Hypothesis

    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…

Connected through shared HN threads, not inferred similarity or a recommendation.