/explore
|
You are here 
|
theoremoftheweek.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... | |
| | | | |
divisbyzero.com
|
|
| | | | | The study of cardinalities of infinite sets is one of the most intriguing areas of mathematics that an undergraduate mathematics major will encounter. It never fails to bring crooked smiles of joy, disbelief, confusion and wonder to their faces. The results are beautiful, deep, and unexpected. Recall that two sets have the same cardinality if... | |
| | | | |
kpknudson.com
|
|
| | | | | [AI summary] A mathematician connects Franz Kafka's theme of 'non-arrival' and infinite paradoxes to Georg Cantor's work on different levels of transfinite infinity and the diagonalization argument. | |
| | | | |
kristalcantwell.wordpress.com
|
|
| | | Mini-polymath 4 has started. It is based on question 3 of the IMO. The research thread is here. There is a wiki here. | ||
