In the previous post we described a fairly straightforward argument, using generating functions and the saddle-point bound, for giving an upper bound $latex \displaystyle p(n) \le \exp \left( \pi \…| Annoying Precision
(Part I of this post is here) 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…| Annoying Precision