**Partitions: Exact Approximations**

… there is something strange going on with Primes

— Paul Erdös

Never mind the mock theta, Ramanujan’s gap, Namagiri dreams.

**formulas in that letter. So remarkable are some of his formulas that mathematicians have been studying Ramanujan’s notebooks of formulas for new mathematical insights to this day, more than a hundred years later.**

*remarkable*I beg to introduce myself to you as a clerk in the Accounts Department of the Port Trust Office at Madras… I have no University education but I have undergone the ordinary school course. After leaving school I have been employing the spare time at my disposal to work at Mathematics. I have not trodden through the conventional regular course which is followed in a University course, but I am striking out a new path for myself. I have made a special investigation of divergent series in general and the results I get are termed by the local mathematicians as “startling”.

*Primes*was not EXACTLY correct. So Ramanujan had to bend to Hardy and work on his proofs of some of his formulas, so when they tackled the function of

**Partitions P(n)**, Ramanujan with the help of Hardy got to point where they “cracked” Partitions (and could prove it). They developed a direct formula that computed the number of partitions pretty accurately, and at the limit (infinity) it was “perfect” — and, could by truncating the number for high partition number to an integer could guarantee to be exact: since the number of partitions of integers is an whole number (i.e., the real number series “formula” converges with an deceasing error rate). Together they “cracked” the problem where neither man could do it alone. Ramanujan supplied the “intuition” (the finding of the hidden pattern) and Hardy provided the rigor to explain why the pattern is true. The method they created, in this instance, was called the “circle method” — and it has been used ever since by numerous mathematicians for various other results.