Рет қаралды 122,605
For record-breaking π (pi) computations, the Chudnovsky algorithm is used. In this video, I go over what affects the performance of algorithms for π computation. Then, how to apply "binary splitting" to the Chudnovsky algorithm. Then, implementing the Chudnovsky algorithm in Python. Then, why is π calculated to many digits. I may go a little quick at times, so I encourage you to pause the video to verify an understanding of each step.
00:00 Intro
00:11 What makes a formula better to calculate π?
03:26 Optimizing the Chudnovsky algorithm
12:00 Implementing the Chudnovsky algorithm in Python
13:57 What's the point of calculating π to many digits?
14:43 Outro
This video is for the #SoME3
References and further reading:
I need to wait for verification to put links in the description.