ChatterBank0 min ago
P I To 31 Trillion Digits......
27 Answers
https:/ /www.bb c.co.uk /news/t echnolo gy-4752 4760
One thing that has always puzzled me, what is the calculation that they do to yield this number? We know it's irrational so there must be some sort of division sum they do that yields a non recurring quotient. Anyone?
One thing that has always puzzled me, what is the calculation that they do to yield this number? We know it's irrational so there must be some sort of division sum they do that yields a non recurring quotient. Anyone?
Answers
Best Answer
No best answer has yet been selected by ToraToraTora. Once a best answer has been selected, it will be shown here.
For more on marking an answer as the "Best Answer", please visit our FAQ.I should say that this is almost certainly *not* the series used in the present calculation, because, although it's relatively easy to set up, I think it's computationally a pain to get an accurate computation of pi quickly that way. But that is just one of thousands of formulas that can be used to compute pi numerically.
You only see a different result (and then only minimal) when you get beyond three decimal places - more than enough for everyday use. I understand some uses of pi may require more (but cannot imagine more than four or five places being necessary, but let's be generous and say ten may be needed). Like sanmac, I simply do not understand the enthusiasm for such a pointless exercise.
Yes, there have been some remarkable developments in computation techniques for pi.
I just checked quickly, and by my reckoning if you take the sum up to n=1000 you get a value pi = 3.1406, and n=10000 still only gets you to 3.1415. So yes, very slow. My pitiful laptop took 4.5 minutes to go to n = 1 million, and that got my only one more digit.
I think the one currently used is the Chudnovsky algorithm, which looks arbitrary to me to but is apparently not -- but is anyway much, much faster than my sum over inverse squares.
I just checked quickly, and by my reckoning if you take the sum up to n=1000 you get a value pi = 3.1406, and n=10000 still only gets you to 3.1415. So yes, very slow. My pitiful laptop took 4.5 minutes to go to n = 1 million, and that got my only one more digit.
I think the one currently used is the Chudnovsky algorithm, which looks arbitrary to me to but is apparently not -- but is anyway much, much faster than my sum over inverse squares.
I wonder if anyone has tried to work it out using Euler's identity
e^iπ + 1 = 0.
That's even more mind stretching than pi since it relates two important irrational numbers (Pi - roughly 3.142- and e- roughly 2.718) and an imaginary number (square root of -1)
When I retire I'll see whether I can rearrange it (maybe using the known series for pi and e) and work out the value of i. Simpler than resolving Brexit i reckon
e^iπ + 1 = 0.
That's even more mind stretching than pi since it relates two important irrational numbers (Pi - roughly 3.142- and e- roughly 2.718) and an imaginary number (square root of -1)
When I retire I'll see whether I can rearrange it (maybe using the known series for pi and e) and work out the value of i. Simpler than resolving Brexit i reckon
Related Questions
Sorry, we can't find any related questions. Try using the search bar at the top of the page to search for some keywords, or choose a topic and submit your own question.