## Submission + - Pi calculated to record 2.5 trillion digits (examiner.com) 6

Joshua writes:

*"Researchers from Japan have calculated Pi to over 2.5 trillion decimals using the T2K Open Supercomputer (which is currently ranked 47th in the world according to a June, 2009 report from Top500.org). This new number more than doubles the previous record of about 1.2 trillion decimals set in 2002 by another Japanese research team. Unfortunately, there still seems to be no pattern."*
## Stupid question... (Score:1)

I know this is going to sound pretty stupid, but I'll ask anyway.

What do they calculate pi based on?

I mean, yes, I know it is used in the ratios between circle circumferences and volumes as compared to their diameters/radii, but how do you "calculate" extremely precise values of pi? What numbers go into the calculation and how are those numbers derived?

Do you draw a really frikkin huge circle and measure the circumference and diameter in atomic distances, or what?

## Re: (Score:1)

PS: Just looked it up on Wikipedia, and the answer they provided (using an n-sided polygon that approximates a circle and then increasing n to increase the correlation between the polygon and a circle) makes sense for approximations. I wonder what they had to crank "n" to on this computer to get this answer, assuming they used this method?

## Re: (Score:3, Informative)

Do you draw a really frikkin huge circle and measure the circumference and diameter in atomic distances, or what?

Yes, this is exactly how it's done. The circle is now the size of the universe.

Of course not, it's computed using mathematical formulas.

What is interesting is that there are two basically different methods to compute Pi.

http://mathworld.wolfram.com/PiFormulas.html [wolfram.com]

The first one is primarily based on Ramanujan's method. It's iterative and has a quadratic development, that means that you need one computer, and at each iteration, the number of correct decimals doubles.

The second one is based on Bailey and Borwe

## Re: (Score:2)

In fact there's an interesting description of these algorithms on Fabrice Bellard's [bellard.org] site.

Extra geek points go to Fabrice as he is also the inventor of QEMU [nongnu.org].

## Re: (Score:1)

Computing very large numbers is done with the use of Fast Fourier Transform (FFT).

Small correction: multiplying very large numbers is done with the use of the FFT, addition/subtraction not. That's because multiplication is very similar to convolution (try to multiply to numbers on paper and you'll see its pretty much the same as convolution of the numbers represented as arrays of digits), and convolution in the time domain is equal to pointwise multiplication in the frequency domain. For numbers with more than a certain amount of digits going through the FFT is actually faster. Furtherm

## Galactic-to-solar-system precision (Score:1)