|
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... | |
| | | | |
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... | |
| | | | |
clutterreport.wordpress.com
|
|
| | | attempting to clean up my living and workspace | ||