5 Trillion Digits of Pi — a New World Record
KPexEA writes "Alexander J. Yee & Shigeru Kondo claim to have calculated the number pi to 5 trillion places, on a single desktop and in record time. The main computation took 90 days on Shigeru Kondo's desktop. Verification was done using two separate computers. The program that was used for the main computation is y-cruncher v0.5.4.9138 Alpha." Looks like the chart of computer-era approximations of Pi here might need an update.
If you want to prove that all the digits are correct, you only have to check a few things:
1. There is a sound mathematical proof that the algorithm used in fact does generate the digits of pi, and
2. The algorithm was coded correctly. This should be even easier to check, though likely more tedious.
Now, what it's good for is a little harder. There is no physical application for such a highly accurate value of pi (39 digits should be sufficient to calculate the circumference of the known universe given its radius to within the diameter of a hydrogen atom). However, large numbers of digits of pi are useful as arguments in number theory, statistics, and information theory. For instance, there is no real proof that pi is a normal number, but as more digits of pi are found and the statistical properties of the digits are analyzed and shown to be consistent with the definition of normal numbers, that makes the conjecture that pi is actually normal a little closer to being true (see experimental mathematics).
Qu'on me donne six lignes écrites de la main du plus honnête homme, j'y trouverai de quoi le faire pendre.
Yes, we do. Mathematical algorithms, i.e., equations on paper.
Absolutely not. The algorithms have to run on practical, exists-on-the-Earth-today computers. Try to multiply two, million-digit numbers together on your laptop and you'll see what I mean. These achievements are all about computational optimizations. RTFA -- especially the sections entitled "Arithmetic Algorithms" and "Maximizing Scalability." Even the algorithm used for multiplication changes (dynamically!) during the program's execution, based on the size of the operands.
Not even close. The computations are so long, and so intense, that errors caused by hardware imperfections can be expected, so error detection and correction algorithms have to be added. If "I left my pi calculating program running longer than the last guy" it would not produce the correct result -- even if the data structures and algorithms it used were up to the task.
In a word, yes. Could you do it? It's a very, very difficult technical feat, one that required hardware powers and software abilities far beyond those of mortal men. Besides, you're worried about newsworthiness when the two previous /. articles are on wall-climbing robots and the popularity of video game arcades in New York?
This isn't about needing pi to 5 trillion digits. This is about learning how to do large computations faster. Like, improving the state of the art.
"Taken aback "Really, why?"
-"We have proof, when PI is expended out to (some number), there is a message"..."
Duh.
http://everything2.com/title/Converting+Pi+to+binary%253A+Don%2527t+do+it%2521