Today is the 130th birthday of Srinivasa Ramanujam Iyengar.

I will discuss the easiest-to-follow work of Ramanujam, from G. H. Hardy’s *Ramanujan: Twelve lectures on subjects suggested by his life and work*.

A partition of is a division of into any number of positive integral parts. Thus, the sum of digits of 130 = 1+3+0=4 has 5 partitions:

The order in which the partitions are arranged is irrelevant, so we may think of them, as arranged in descending order. We denote the number of partitons of by ; thus . Also, by convention, we define .

Very little was known about the arithmetical properties of ; when Ramanujam started his investigations. Though we still don’t know when is even or odd, there has been a lot of progress in this domain of research. For an overview, see the first section of Ken Ono’s “Distribution of the partition function modulo m” (it’s 17-year-old paper…)

Ramanujam was the first, and up to his death, the only, mathematician to discover the arithmetical properties of . His theorems were discovered by observing Percy MacMahon‘s table of for the first 200 values of . Ramanujan observed that the table indicated certain simple congruence properties of . In particular, the numbers of the partitions of numbers and are divisible by 5, 7 and 11 respectively, i.e.

Hence, for example, for (Chinese way of calculating age) . And we can verify this using SageMath:

Now, to check its divisibility by 7, take the last digit of the number you’re testing and double it. Then, subtract this number from the rest of the remaining digits. If this new number is either 0 or if it’s a number that’s divisible by 7, then the original number is divisible by seven. [Derive it yourself!]

This process is lengthy but it converts the process of division by a simpler operation of subtraction.

Here, we have:

.

*If you know how SageMath calculates the number of partitions, please let me know in the comments below.*