Computer Science - Riemann Hypothesis and its Applications

Course Description

Riemann Hypothesis is one of the most important unresolved conjectures in mathematics. It connects the distribution of prime numbers with zeroes of Zeta function, defined on the complex plane. A number of algorithms in algebra and number theory rely on the correctness of Riemann Hypothesis or its generalizations.

This course will describe the connection between prime distributions and Zeta function leading to the Riemann Hypothesis proving Prime Number Theorem along the way. It will then investigate generalizations of Riemann Hypothesis and their applications to computer science problems. Faculty Prof. Manindra Agrawal IIT Kanpur, Courtesy NPTEL HRD

Course Objective

  1. Prime counting and other arithmetic functions
  2. Brief overview of complex analysis
  3. Zeta function definition and basic properties
  4. Riemann Hypothesis and its relationship with prime counting
  5. Prime Number Theorem
  6. Dirichlet L-functions and Extended Riemann Hypothesis
  7. Applications of Riemann and Extended Riemann Hypothesis
  8. Generalized Riemann Hypothesis, and its proof for functions fields, finite fields, and elliptic curves

Ask a Question

My Questions