/explore
|
You are here 
|
xorshammer.com | ||
| | | | |
algorithmsoup.wordpress.com
The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... |
|
| | | | | ||
| | | | |
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.... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
linsdoodles.wordpress.com
For XingfuMama's Pull up a seat Photo Challenge |
|
| | | |||
