E. A Memo Operator — Partition Function | Index << >> |
![]() |
A notable paper [Ramanujan] wrote with Hardy concerns the partition function (PartitionsP in the Wolfram Language) that counts the number of ways an integer can be written as a sum of positive integers. In Ramanujan’s day, computing the exact value of PartitionsP[200] was a big deal — and the climax of his paper. But now, thanks to Ramanujan’s method, it’s instantaneous: In[1]:= PartitionsP[200] Out[1]= 3 972 999 029 388 — Stephen Wolfram, Who Was Ramanujan? |