/explore
|
You are here 
|
xenaproject.wordpress.com | ||
| | | | |
anuragbishnoi.wordpress.com
|
|
| | | | | The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge... | |
| | | | |
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... | |
| | | | |
jiggerwit.wordpress.com
|
|
| | | | | What follows are the opening paragraphs of a pdf document giving an argument for controlled natural languages in mathematics. At the recent Big Proof 2 conference in Edinburgh, I realized that a case must be made for developing a controlled natural language for mathematics. There is little consensus on this issue, and mathematicians and computer... | |
| | | | |
cuoichutdi.wordpress.com
|
|
| | | Liverpool v?a vô ?ch Premier League, ?i?u này t?o nên m?t th?ng kê thú v?: s? cúp vô ?ch c?a các ?i bóng t?o thành m?t dãy s? Fibonacci. ?i?u này là ng?u nhiên hay có m?t cách lí gi?i toán h?c ?n sau nó? Tôi biên bài báo ng?n v? dãy Fibonacci c?ng nh?... | ||
