Outer Web | Explore

Explore >> Select a destination

You are here		juliawolffenotes.home.blog Terry Tao: can an approach used to prove almost all cases be extended to prove all cases? - Julia Wolffe's Notes
\|	\|	rhubbarb.wordpress.com Tools for Writing Mathematical Blog Posts \| Rob Hubbard's Blog	5.7 parsecs away Travel
\|	\|	My previous post was written with the help of a few very useful tools: LaTeX mathematical typesetting Gummi LaTeX editor Python programming language PyX Python / LaTeX graphics package my own PyPyX wrapper around PyX LaTeX2WP script for easy conversion from LaTeX to WordPress HTML	5.7 parsecs away Travel
\|	\|	algorithmsoup.wordpress.com My favorite example of: the probabilistic method - Algorithm Soup	4.2 parsecs away Travel
\|	\|	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...	4.2 parsecs away Travel
\|	\|	thehousecarpenter.wordpress.com Notes on proving the completeness theorem for propositional logic \| The House Carpenter	4.6 parsecs away Travel
\|	\|	NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I...	4.6 parsecs away Travel
\|	\|	thisfineplace.wordpress.com Thought for the Day - This Fine Place	14.1 parsecs away Travel
\|		Don't just escape from something; escape to something. Chris Guillebeau	14.1 parsecs away Travel