/explore
|
You are here 
|
polymathprojects.org | ||
| | | | |
mattbaker.blog
In my last blog post, I discussed a simple proof of the fact that pi is irrational. That pi is in fact transcendental was first proved in 1882 by Ferdinand von Lindemann, who showed that if $latex \alpha$ is a nonzero complex number and $latex e^\alpha$ is algebraic, then $latex \alpha$ must be transcendental. Since... |
|
| | | | | ||
| | | | |
lucatrevisan.wordpress.com
I am writing a short survey on connections between additive combinatorics and computer science for SIGACT News and I have been wondering about the "history" of the connections. (I will be writing as little as possible about history in the SIGACT article, because I don't have the time to research it carefully, but if readers... |
|
| | | | | ||
| | | | |
qchu.wordpress.com
(Part I of this post ishere) Let $latex p(n)$ denote the partition function, which describes the number of ways to write $latex n$ as a sum of positive integers, ignoring order. In 1918 Hardy and Ramanujan proved that $latex p(n)$ is given asymptotically by $latex \displaystyle p(n) \approx \frac{1}{4n \sqrt{3}} \exp \left( \pi \sqrt{ \frac{2n}{3}... |
|
| | | | | ||
| | | | |
blog.computationalcomplexity.org
March Edition For our next favorite theorem, we look at the surprising power of provers who share entangled bits. If you can prove something... |
|
| | | |||
