Srinivasa Ramanujan

Srinivasa Ramanujan (ˈsriːnᵻvɑːsə_rɑːˈmɑːnʊdʒən ; born Srinivasa Ramanujan Aiyangar, sriːniʋaːsa ɾaːmaːnud͡ʑan ajːaŋgar; 22 December 1887 26 April 1920) was an Indian mathematician. Though he had almost no formal training in pure mathematics, he made substantial contributions to mathematical analysis, number theory, infinite series, and continued fractions, including solutions to mathematical problems then considered unsolvable. Ramanujan initially developed his own mathematical research in isolation. According to Hans Eysenck, "he tried to interest the leading professional mathematicians in his work, but failed for the most part. What he had to show them was too novel, too unfamiliar, and additionally presented in unusual ways; they could not be bothered". Seeking mathematicians who could better understand his work, in 1913 he began a postal correspondence with the English mathematician G. H. Hardy at the University of Cambridge, England. Recognising Ramanujan's work as extraordinary, Hardy arranged for him to travel to Cambridge. In his notes, Hardy commented that Ramanujan had produced groundbreaking new theorems, including some that "defeated me completely; I had never seen anything in the least like them before", and some recently proven but highly advanced results. During his short life, Ramanujan independently compiled nearly 3,900 results (mostly identities and equations). Many were completely novel; his original and highly unconventional results, such as the Ramanujan prime, the Ramanujan theta function, partition formulae and mock theta functions, have opened entire new areas of work and inspired a vast amount of further research. Of his thousands of results, all but a dozen or two have now been proven correct. The Ramanujan Journal, a scientific journal, was established to publish work in all areas of mathematics influenced by Ramanujan, and his notebooks—containing summaries of his published and unpublished results—have been analysed and studied for decades since his death as a source of new mathematical ideas.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (1)

Related concepts (37)

Related lectures (4)

Experiments with the Markoff Surface

Matthew De Courcy-Ireland, Sandy Lee

We confirm, for the primes up to 3000, the conjecture of Bourgain-Gamburd-Sarnak and Baragar on strong approximation for the Markoff surface modulo primes. For primes congruent to 3 modulo 4, we find

TAYLOR & FRANCIS INC2020

Srinivasa Ramanujan

Partition function (number theory)

In number theory, the partition function p(n) represents the number of possible partitions of a non-negative integer n. For instance, p(4) = 5 because the integer 4 has the five partitions 1 + 1 + 1 + 1, 1 + 1 + 2, 1 + 3, 2 + 2, and 4. No closed-form expression for the partition function is known, but it has both asymptotic expansions that accurately approximate it and recurrence relations by which it can be calculated exactly. It grows as an exponential function of the square root of its argument.

Partition (number theory)

In number theory and combinatorics, a partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.) For example, 4 can be partitioned in five distinct ways: 4 3 + 1 2 + 2 2 + 1 + 1 1 + 1 + 1 + 1 The only partition of zero is the empty sum, having no parts.

Setting up arithmetic MATH-260(b): Discrete mathematics

Explores defining arithmetic operations through counting, with insights on cardinal numbers, Cantor's work, and Sudoku.

Isogeny Graphs: Eigenvalues and Cryptography

Explores isogeny graphs of supersingular elliptic curves, showing optimal mixing times for random walks and applications to cryptography.

Embedding in Function Spaces MATH-502: Distribution and interpolation spaces

Explores embedding in function spaces, including elliptic equations, Hölder inequality, Lorentz space, and Hardy-Young inequality.