Explore >> Select a destination
|
You are here 
|
qchu.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... | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | Given two integers $latex n$ and $latex k$, where $latex k$ is non-negative, an ordered $latex k$-partition of $latex n$ is a $latex k$-tuple $latex (m_1, \dotsc, m_k)$ of positive integers such that $latex \displaystyle m_1 + \dotsb + m_k = n. $ For example, the ordered 3-partitions of 5 are $latex (1, 1, 3)$,... | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... | |
| | | | |
chava61photography.photo.blog
|
|
| | | Visit the post for more. | ||
