Computing Pi in Delphi — A collection of projects featuring both BBP and Chudnovsky algorithms for computing digits of Pi, powered by Rudy's Big Numbers Library.
Delphi Big Pi demonstrates high-precision computation of Pi using:
- BBP (Bailey–Borwein–Plouffe) — An integer based spigot algorythm that computes individual hexadecimal digits of Pi without computing preceding digits
- Chudnovsky — A a floating point based rapidly converging series for computing Pi to arbitrary precision
Both algorithms use RudysBigNumbers for arbitrary-precision arithmetic.
| Project | Description |
|---|---|
src\BigPiConsole |
Console application — computes and prints Pi digits |
src\BigPiFMX |
Displays Pi digits as they are computed on any platform |
Tests/BigPiTests |
DUnitX test suite — validates algorithm correctness |
Open BigPiGroup.groupproj in Delphi to work with all projects together.
- Delphi (tested with recent versions supporting generics and anonymous methods)
- Rudy's Big Numbers library (included at
lib/RudysBigNumbers)-
After cloning, initialize the submodule:
git submodule update --init
-
Or point the projects to an existing installation of Rudy's Big Numbers library.
Licensed under the GNU General Public License v3.0 (GPLv3).
Uses Rudy's Big Numbers Library (BSD 2-Clause).
Thanks to the late Rudy Velthuis for his Big Number Libraries, Tommi Prami, and everyone who helps maintain TurboPack.