Srinivasa Ramanujan

⚡ Key Takeaways

Srinivasa Ramanujan (1887–1920) was a self-taught Indian mathematician whose intuitive, almost mystical mastery of number theory, infinite series, continued fractions, and modular forms produced thousands of profound results — many proven only decades later. Key contribution: revolutionary formulas for partitions, infinite series for $\pi$ , mock theta functions, and the Ramanujan–Hardy collaboration. Where it applies: number theory, analysis, combinatorics, modern physics (string theory, black holes), and computational mathematics. Who/when: flourished 1903–1920, with his most famous work at Cambridge (1914–1919) alongside G. H. Hardy.

💡 The Core Insight

Ramanujan's genius lay in pattern recognition of staggering depth: he could perceive hidden relationships between numbers, series, and functions that no systematic method would reveal, then express them as exact identities. Where most mathematicians proceed by logical deduction step-by-step, Ramanujan seemed to see the final result whole, as if reading it off a hidden structure. His work shows that intuition, when extraordinarily disciplined, can leap to truths that formal proof only later catches up to.

DefinitionPartition Function

The partition function $p(n)$ counts the number of ways of writing a positive integer $n$ as a sum of positive integers, ignoring order. For example, $p(4) = 5$ because $4 = 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1$ .

$n$ — the integer being partitioned
$p(n)$ — the number of distinct unordered partitions
By convention $p(0) = 1$ .

TheoremRamanujan's Congruences

Ramanujan discovered remarkable divisibility patterns in $p(n)$ :

1

\quad p(5k+4) \equiv 0 \pmod 5

Derivation hint: Observed empirically from tables of $p(n)$ , then proven using the generating function and properties of modular forms; the residues of $p(n)$ mod 5 cycle with period tied to the pentagonal structure.

2

\quad p(7k+5) \equiv 0 \pmod 7

Derivation hint: Analogous to [1]; arises from the behaviour of the Dedekind eta function under modular transformations modulo 7.

3

\quad p(11k+6) \equiv 0 \pmod{11}

Derivation hint: The deepest of the three; relates to the action of Hecke operators on the partition generating function. Here $k = 0, 1, 2, \ldots$ Every symbol: $p$ is the partition function, $k$ ranges over non-negative integers, and $\equiv 0 \pmod m$ means divisible by $m$ .

TheoremHardy–Ramanujan Asymptotic Formula

The partition function grows according to:

4

\quad p(n) \sim \frac{1}{4n\sqrt{3}}\, \exp\!\left(\pi\sqrt{\tfrac{2n}{3}}\right)

Derivation hint: Obtained via the circle method, analysing the generating function $\sum p(n)q^n = \prod_{k\ge1}(1-q^k)^{-1}$ near roots of unity on the unit circle in the complex plane.

$n$ — large integer
$\sim$ — "asymptotically equal", the ratio tends to 1 as $n\to\infty$
$\exp$ — the exponential function

TheoremRamanujan's Series for

\pi

5

\quad \frac{1}{\pi} = \frac{2\sqrt{2}}{9801}\sum_{k=0}^{\infty}\frac{(4k)!\,(1103 + 26390k)}{(k!)^4\, 396^{4k}}

Derivation hint: Built from the theory of modular equations and singular values of elliptic integrals; each successive term adds roughly 8 correct decimal digits of $\pi$ . This series converges astonishingly fast and underlies modern record-breaking computations of $\pi$ .

ProofSketch: Generating Function for Partitions

The foundation of partition theory is the generating function, which Ramanujan exploited masterfully. 1. Set up the product. Each integer $j$ may appear $0, 1, 2, \ldots$ times in a partition. The choices for part $j$ contribute the factor $1 + q^j + q^{2j} + \cdots = \dfrac{1}{1-q^j}$ . 2. Multiply over all parts. Taking the product over all $j \ge 1$ :

6

\quad \sum_{n=0}^{\infty} p(n)\, q^n = \prod_{j=1}^{\infty}\frac{1}{1-q^j}

Derivation hint: Expand each geometric factor and collect terms; the coefficient of $q^n$ counts all ways to build $n$ from parts, which is exactly $p(n)$ . 3. Connect to modular forms. The denominator $\prod(1-q^j)$ is essentially the Dedekind eta function $\eta(\tau)$ (with $q = e^{2\pi i \tau}$ ). This function transforms beautifully under $\tau \mapsto -1/\tau$ and $\tau \mapsto \tau + 1$ . 4. Extract congruences. The modular transformation properties impose divisibility constraints on the coefficients $p(n)$ , yielding equations [1]–[3]. Ramanujan saw these patterns empirically; the modular framework explains why. 5. Estimate asymptotics. Near the point $q = 1$ (i.e. $\tau \to 0$ ), the product behaves like $\exp(\pi^2/(6(1-q)))$ -type growth; the circle method (Hardy–Ramanujan) integrates this dominant contribution to produce [4]. $\blacksquare$

∎

Figure

Growth of the partition function

p(n)

compared with the Hardy–Ramanujan asymptotic estimate

mathematician · Srinivasa Ramanujan | 1887–1920

Born in Erode and raised in Kumbakonam, Tamil Nadu, Ramanujan was a Brahmin from a poor family. He encountered G. S. Carr's A Synopsis of Elementary Results in Pure and Applied Mathematics around age 16 — a terse list of some 5,000 theorems with little proof — and it shaped his entire style: stating results as bare facts. He failed his college exams (neglecting every subject but mathematics) and worked as a clerk while filling notebooks with discoveries. In 1913 he wrote to G. H. Hardy at Cambridge; Hardy, recognising genius, brought him to England in 1914. There Ramanujan was elected a Fellow of the Royal Society (1918) — among the youngest ever — and a Fellow of Trinity College. Chronically ill and homesick, he returned to India in 1919 and died at 32 in 1920. He attributed many discoveries to the goddess Namagiri, who he said revealed formulas in dreams.

🧠 Intuition

Think of Ramanujan as a master who could hear the hidden music of numbers. Where others laboriously calculate, he heard the melody and wrote down the score. The partition function feels chaotic — there is no simple formula for $p(n)$ — yet Ramanujan spotted that $p(4), p(9), p(14), \ldots$ are all divisible by 5, an order hiding in apparent randomness. His $\pi$ formula is similarly counter-intuitive: it converges so fast that just one term already gives $\pi$ accurate to six decimals. The lesson is that deep regularity often lurks beneath surface chaos, and a sufficiently trained intuition can perceive it before any proof exists.

ExampleComputing

p(6)

by hand

Given: Find the number of partitions of $n = 6$ .

Steps: List all unordered sums:

$6$
$5+1$
$4+2$ , $4+1+1$
$3+3$ , $3+2+1$ , $3+1+1+1$
$2+2+2$ , $2+2+1+1$ , $2+1+1+1+1$
$1+1+1+1+1+1$

Counting: $1 + 1 + 2 + 3 + 3 + 1 = 11$ .

Check against congruence [1]: $6$ is not of the form $5k+4$ , so no divisibility-by-5 is predicted — consistent, since $11$ is not divisible by 5.

\boxed{p(6) = 11}

ExampleVerifying a Ramanujan congruence

Given: Check [1], $p(5k+4)\equiv 0 \pmod 5$ , for $k=0$ and $k=1$ .

Steps:

For $k=0$ : $5(0)+4 = 4$ , and $p(4) = 5$ . Since $5 \div 5 = 1$ , indeed $5 \equiv 0 \pmod 5$ . ✓
For $k=1$ : $5(1)+4 = 9$ , and $p(9) = 30$ . Since $30 = 5\times 6$ , indeed $30 \equiv 0 \pmod 5$ . ✓
For $k=2$ : $5(2)+4 = 14$ , and $p(14) = 135 = 5\times 27$ . ✓

Answer: Every tested value confirms the congruence.

\boxed{p(4)=5,\; p(9)=30,\; p(14)=135 \text{ — all divisible by } 5}

⚠️ Common mistake

"Ramanujan worked entirely without proof, so his results were just lucky guesses." This is false and unfair. His results were stated without written proof, but he certainly had reasoning behind them — much of it never recorded. Crucially, his accuracy rate was extraordinary; of his thousands of claims, the vast majority proved correct. A handful were wrong (e.g. an early formula for the number of primes below $x$ had errors), showing he was human, not infallible. But "no proof" does not mean "no understanding".

⚠️ Common mistake

"The 1729 'taxicab' story means Ramanujan just memorised special numbers." The famous incident — Hardy mentioned arriving in cab number 1729, "a rather dull number," and Ramanujan instantly replied it was the smallest number expressible as a sum of two cubes in two different ways ( $1729 = 1^3 + 12^3 = 9^3 + 10^3$ ) — illustrates not memorisation but an intimate, structural familiarity with numbers' arithmetic properties.

Counterexample

One might guess that every arithmetic-progression congruence works, e.g. that $p(an+b)$ is divisible by some prime for nicely chosen $a,b$ . Not so. Ramanujan's congruences for the primes 5, 7, 11 are essentially the only "simple" ones of their kind. For example, there is no congruence $p(3k+r)\equiv 0 \pmod 3$ valid for all $k$ : $p(0)=1$ , $p(3)=3$ , $p(6)=11$ , $p(9)=30$ are not all divisible by 3. The special status of 5, 7, 11 reflects deep, non-obvious structure — that is precisely why their discovery was remarkable.

connection

Ramanujan's work threads through much of modern mathematics. His partition congruences are explained by the theory of Modular Forms, objects with rich symmetry under transformations of the complex upper half-plane. His series for $\pi$ rest on Elliptic Integrals and modular equations. The asymptotic formula [4] required the Circle Method of analytic number theory. His mysterious "mock theta functions" found their proper home in Sander Zwegers' 2002 theory of Harmonic Maass Forms. And the Ramanujan tau function $\tau(n)$ , with its conjectured bounds, was proven only via Pierre Deligne's work on the Weil Conjectures (1974).

🔬 Where this appears

⏳ History

- 1887 — Born 22 December in Erode, Madras Presidency, British India.

- c. 1903 — Obtains G. S. Carr's Synopsis; begins independent research, soon surpassing the book.

- 1909–1912 — Marries, struggles financially, works as a clerk at the Madras Port Trust; fills his famous notebooks.

- 1913 — Writes to G. H. Hardy in Cambridge, enclosing pages of astonishing formulas. Hardy and Littlewood recognise true genius.

- 1914 — Sails to England; begins his celebrated collaboration with Hardy at Trinity College, Cambridge.

- 1916 — Earns a research degree; publishes the major paper on highly composite numbers.

- 1917–1918 — Falls seriously ill (long thought to be tuberculosis, possibly hepatic amoebiasis). Elected Fellow of the Royal Society (1918) and Fellow of Trinity College.

- 1919 — Returns to India in declining health.

- 1920 — Dies on 26 April, aged 32, at Kumbakonam, leaving the "Lost Notebook" of final discoveries.

- 1976 — George Andrews rediscovers the "Lost Notebook," sparking decades of new research.

- 2002 — Zwegers explains mock theta functions via harmonic Maass forms.

open-problem

Many threads from Ramanujan's work remain active research. The full structure of mock modular forms continues to be explored, with applications to physics still unfolding. Questions about the exact density and form of partition congruences for arbitrary primes were greatly advanced by Ken Ono and collaborators around 2000 (showing congruences exist for every prime $\ge 5$ ), yet a complete, simple characterisation remains elusive. The Lost Notebook still yields surprises, and some of Ramanujan's identities are understood case-by-case rather than via a single unifying principle. The deeper question — how he arrived at results without modern machinery — is a matter of perpetual fascination and, in a sense, an open problem in the history and psychology of mathematics.

Formal Statement of Key Results

Why It Holds / Derivation Sketch

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also