Another needull on Ramanujan. Ramanujan is an Indian mathematician who continues to fascinate me endlessly.

Using a long and complicated argument, we finally found a way to show that the truth of the generalized Riemann hypothesis implies that every odd number greater than 2719 can be written as *x*^{2} + *y*^{2} + 10*z*^{2} for some integers *x*, *y*, and* z*. The fact that almost every mathematician believes in the truth of the generalized Riemann hypothesis and the fact that every odd number greater than 2719 up to a very large number can be represented by Ramanujan’s quadratic form convinced us that we had found the law. But although the law is simple enough to state, it thus far defies a definitive proof. To be sure, if someone manages to prove the generalized Riemann hypothesis, then our conditional proof will at once become a genuine proof. But the generalized Riemann hypothesis is arguably one of the most difficult open problems in mathematics. So Ramanujan was right that the odd numbers do not obey a simple law, in the sense that they are constrained by one of the most difficult unsolved problems in mathematics.

I had no idea that I would see the number 2719 again ten years later, etched on a wall in the very spot where Ramanujan performed some of his first calculations.

The complete article

Ken Ono — IAS

Image source

### Like this:

Like Loading...

Please, can you tell me if the following numbers are multiple of 132? 22081374992701950398847674830857600, 220381378415074546123953914908618547085974856000, 599868742615440724911356453304513631101279740967209774643120000

I will check if it is divisible by 2,3&11. So even, sum of digits multiple of 3 and difference of sum of alternate digits divisible by 11 or is 0

Thanks a lot!