# Dating mathematicians

"An equation for me has no meaning," he once said, "unless it expresses a thought of God." The family home is now a museum.

When Ramanujan was a year and a half old, his mother gave birth to a son, Sadagopan, who died less than three months later.

The first says, "I'll have a beer." The second says, "I'll have half a beer." The third says, "I'll have a quarter of a beer." The barman pulls out just two beers. Know your limits." An infinite number of mathematicians walk into a bar. However, the chance that there are two bombs at one plane is 1/1000000.

The mathematicians are all like, "That's all you're giving us? So, I am much safer..." Source: Andrej and Elena Cherkaev Explanation: While this statistician is correct that the joint probability there are two bombs on a plane is 1/1,000,000, his bringing one on doesn't change the prior probability that there is still a 1/1,000 chance of his flight being the one with a random bomb.

His mother gave birth to two more children, in 18, both failing to reach their first birthdays.

His last letters to Hardy, written January 1920, show that he was still continuing to produce new mathematical ideas and theorems.

Ramanujan initially developed his own mathematical research in isolation; it was quickly recognized by Indian mathematicians. Recognizing the extraordinary work sent to him as samples, Hardy arranged travel for Ramanujan to Cambridge.

Seeking mathematicians who could better understand his work, in 1913 he began a postal partnership with the English mathematician G. In his notes, Ramanujan had produced groundbreaking new theorems, including some that Hardy stated had "defeated [him and his colleagues] completely", in addition to rediscovering recently proven but highly advanced results.

In December 1889, Ramanujan contracted smallpox, though he recovered, unlike 4,000 others who would die in a bad year in the Thanjavur district around this time.

He moved with his mother to her parents' house in Kanchipuram, near Madras (now Chennai).

If you have a pool of candidates that you haven’t seen and if your job is to pick the best candidate then it’s been mathematically proven that the best strategy to do is to reject the first 37% of the candidates regardless, so you just reject the first 37% of the candidates and then choose the next candidate that is better than all the candidates that you’ve seen before.