Explore >> Select a destination
|
You are here 
|
thehousecarpenter.wordpress.com | ||
| | | | |
mattbaker.blog
|
|
| | | | | On Pi Day 2016, I wrote inthis post about the remarkable fact, discovered by Euler, thatthe probability that two randomly chosen integers have no prime factors in common is $latex \frac{6}{\pi^2}$. The proof makes use of the famous identity $latex \sum_{n=1}^\infty \frac{1}{n^2} = \frac{\pi^2}{6}$, often referred to as the "Basel problem", which is also due... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | | | One of the most important theoretical results in linear programming is that every LP has a corresponding dual program. Where, exactly, this dual comes from can often seem mysterious. Several years ago I answered a question on a couple of Stack Exchange sites giving an intuitive explanation for where the dual comes from. Those posts... | |
| | | | |
qchu.wordpress.com
|
|
| | | | | This is a post I wanted to write some time ago; I've forgotten why, but it was short and cute enough to finish. Our starting point is the following observation: Theorem 1: Universal lossless compression is impossible. That is, there is no function which takes as input finite strings (over some fixed alphabet) and always... | |
| | | | |
curiousterran.wordpress.com
|
|
| | | Visit the post for more. | ||
