Explore >> Select a destination
|
You are here 
|
xorshammer.com | ||
| | | | |
rjlipton.com
|
|
| | | | | Can they inform computational complexity theory? Bill Gasarch and Christian Elsholtz both like primes and jokes and graphs and ways of sharing baked goods. Bill is a Professor of Computer Science at the University of Maryland; Elsholtz is an Associate Professor of Mathematics at T.U. Graz in Austria. They recently independently came up with a... | |
| | | | |
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... | |
| | | | |
polymathprojects.org
|
|
| | | | | (From a post "the music of the primes" byMarcus du Sautoy.) A new polymath proposal over Terry Tao's blog who wrote: "Building on the interest expressed in the comments tothis previous post, I am now formally proposing to initiate a "Polymath project" on the topic of obtaining new upper bounds on thede Bruijn-Newman constant.... | |
| | | | |
polymathically.wordpress.com
|
|
| | | This week's challenge calls for something warm, and the afternoon sun here in the Bay Area is definitely a welcome source of heat. The recent rain has been rather kind to the countryside as well... | ||
