/explore
|
You are here 
|
www.3blue1brown.com | ||
| | | | |
mikespivey.wordpress.com
|
|
| | | | | The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... | |
| | | | |
www.kuniga.me
|
|
| | | | | NP-Incompleteness: | |
| | | | |
thatsmaths.com
|
|
| | | | | The Riemann Hypothesis Perhaps the greatest unsolved problem in mathematics is to explain the distribution of the prime numbers. The overall ``thinning out'' of the primes less than some number $latex {N}&fg=000000$, as $latex {N}&fg=000000$ increases, is well understood, and is demonstrated by the Prime Number Theorem (PNT). In its simplest form, PNT states that... | |
| | | | |
lucatrevisan.wordpress.com
|
|
| | | (This is the sixth in a series of posts on online optimization techniques and their ``applications'' to complexity theory, combinatorics and pseudorandomness. The plan for this series of posts is to alternate one post explaining a result from the theory of online convex optimization and one post explaining an ``application.'' The first two posts were... | ||
