Riemann hypothesis
One of the unsolved Millennium Prize Problems related to the distribution of prime numbers, particularly how they behave multiplicatively as randomly as possible.
Common Themes
Videos Mentioning Riemann hypothesis
The Books Cal Newport Read in April 2022 | Deep Questions Podcast
Cal Newport
A significant unsolved problem in mathematics that Cal Newport inquired about during the discussion of number theory conjectures.
Ep. 194: Doing Less, Building Discipline, and the Books Cal Newport Read in April | Deep Questions
Cal Newport
A major unsolved problem in pure mathematics, mentioned in the context of famous conjectures.
Donald Knuth: Programming, Algorithms, Hard Problems & the Game of Life | Lex Fridman Podcast #219
Lex Fridman
A conjecture about the distribution of the zeros of the Riemann zeta function, which Knuth states he is more interested in than the question of whether machines can think.
Wojciech Zaremba: OpenAI Codex, GPT-3, Robotics, and the Future of AI | Lex Fridman Podcast #215
Lex Fridman
A famous unsolved problem in mathematics, suggested as an impressive benchmark for machine intelligence.
Grant Sanderson: Math, Manim, Neural Networks & Teaching with 3Blue1Brown | Lex Fridman Podcast #118
Lex Fridman
One of the Clay Millennium Problems, a famous unsolved problem in mathematics.
Jitendra Malik: Computer Vision | Lex Fridman Podcast #110
Lex Fridman
A famous unsolved problem in mathematics, mentioned as an example of a Hilbert problem.
Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI | Lex Fridman Podcast #472
Lex Fridman
One of the unsolved Millennium Prize Problems related to the distribution of prime numbers, particularly how they behave multiplicatively as randomly as possible.
Luís and João Batalha: Fermat's Library and the Art of Studying Papers | Lex Fridman Podcast #209
Lex Fridman
A conjecture about the distribution of the zeros of the Riemann zeta function, mentioned as an interesting unsolved mathematical problem that has not yet been annotated on Fermat's Library.
Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130
Lex Fridman
One of the Millennium Prize Problems, mentioned as an example of a hard problem that could be solved by a fast algorithm if P=NP.