Explore >> Select a destination
|
You are here 
|
ilaba.wordpress.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... | |
| | | | |
terrytao.wordpress.com
|
|
| | | | | Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can | |
| | | | |
awwalker.com
|
|
| | | | | Just how good are polynomials at producing primes? Do there exist polynomials that produce primes for arbitrarily many consecutive inputs? In this post, I'll give a brief overview of what we expect to be able to prove, and show how interpolating polynomials can produce record-breaking prime-generators. (And then break a record, because why not?) | |
| | | | |
chava61photography.photo.blog
|
|
| | | Visit the post for more. | ||
