Explore >> Select a destination
|
You are here 
|
thehousecarpenter.wordpress.com | ||
| | | | |
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... | |
| | | | |
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... | |
| | | | |
xorshammer.com
|
|
| | | | | Mathematical logic has a categorization of sentences in terms of increasing complexity called the Arithmetic Hierarchy. This hierarchy defines sets of sentences $latex \Pi_i$ and $latex \Sigma_i$ for all nonnegative integers $latex i$. The definition is as follows: $latex \Pi_0$ and $latex \Sigma_0$ are both equal to the set of sentences $latex P$ such that... | |
| | | | |
acko.net
|
|
| | | Exploring the outer limits: on the nature of infinity, continuity and convergence. | ||
