The Riemann Hypothesis & P vs NP
Does every efficiently verifiable problem also have an efficiently solvable answer?
Quantum Computing & Complexity Masterclasses
Watch my latest deep-dives into analytic number theory, prime gaps, and how quantum computers threaten to rewrite the boundaries of polynomial time.
Sam Works on the Riemann Hypothesis
Exploring the zeros of the Zeta function and their oscillatory behaviors.
Further Quantum Explorations
Sam Works on the Riemann Hypothesis!
A deep dive into the math and implications of the hypothesis.
Can Quantum Computers Solve P vs NP?
Exploring how quantum states interact with classic complexity theory.
Can Quantum Computers Solve P vs NP?
A breakdown of computational feasibility and quantum logic gates.
The Riemann Zeta Function
Analytic continuation and functional equation connect the behavior of primes to complex analysis.
\[\zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}\]
All non-trivial zeros of \(\zeta(s)\) have real part \(\frac{1}{2}\).