Simon Plouffe

Simon Plouffe
Name	Simon Plouffe
Birth date	1956
Nationality	Canadian
Fields	Mathematics, Computer science, Number theory
Known for	BBP formula

Simon Plouffe is a Canadian mathematician and computer scientist noted for contributions to experimental mathematics, computational number theory, and digit extraction algorithms. He is best known for co-discovering a formula for the binary and hexadecimal digit extraction of pi and for extensive work on computational databases of constants and integer sequences. His work intersects with researchers and institutions across Canada, United States, and Europe and has influenced projects in algorithmic computation, symbolic computation, and online mathematical resources.

Early life and education

Plouffe was born in Quebec and raised in a milieu connected to McGill University and the broader Canadian academic community; his early schooling coincided with developments at institutions such as Université de Montréal and Concordia University. He pursued formal studies that connected him to computational environments like CDC 7600 and Cray Research machines used at centers including Université du Québec and national laboratories affiliated with NSERC. During his formative years he encountered figures and programs associated with William Rowan Hamilton-related algebraic traditions, early digital computation at Bell Labs, and numerical projects similar to efforts at Los Alamos National Laboratory and Lawrence Berkeley National Laboratory.

Career and contributions

Plouffe's career spans academic, industrial, and independent research roles that intersect with projects at IBM, Microsoft Research, and collaborative efforts with mathematicians at Montreal Institute for Learning Algorithms-adjacent groups. He collaborated with and influenced contemporaries such as David H. Bailey, Peter Borwein, Richard Brent, Jonathan Borwein, and researchers associated with The On-Line Encyclopedia of Integer Sequences and NIST Digital Library of Mathematical Functions. Plouffe participated in computing initiatives that relate to algorithms developed by John von Neumann, Donald Knuth, Alan Turing, and computational paradigms advanced at INRIA and ETH Zurich.

Bailey–Borwein–Plouffe formula and digit extraction

Plouffe is co-credited with the discovery of the Bailey–Borwein–Plouffe formula, commonly abbreviated as the BBP formula, developed jointly with David H. Bailey and Peter Borwein. The BBP formula provides a spigot algorithm enabling the extraction of base-16 and base-2 digits of pi beginning at an arbitrary position without computing preceding digits, a capability connected to earlier work by Srinivasa Ramanujan, Fabrice Bellard, and algorithms inspired by ideas from Richard Brent and H. R. P. Ferguson. The formula sparked investigations linking digit extraction to notions studied by Carl Friedrich Gauss-inspired modular arithmetic, Ivan Niven-style irrationality proofs, and later analyses by researchers at MIT, Princeton University, and University of Cambridge. The BBP discovery led to computational verifications executed on machines similar to those at Google and supercomputing centers such as Oak Ridge National Laboratory and Argonne National Laboratory.

Other mathematical and computational work

Beyond the BBP formula, Plouffe contributed to the compilation and identification of mathematical constants and integer sequences, work connected to projects like The On-Line Encyclopedia of Integer Sequences and databases maintained at NIST and Wolfram Research. His efforts relate to algorithmic techniques advanced by G. H. Hardy, J. E. Littlewood, and modern experimental communities at University of Illinois Urbana-Champaign and University of Waterloo. Plouffe explored computational searches for closed forms analogous to pursuits by E. T. Bell and modern symbolic computation systems such as Mathematica, Maple, SageMath, and libraries developed at GitHub. His analyses have influenced investigations into normality of constants studied by Émile Borel and statistical properties examined by researchers at Stanford University and Harvard University.

Publications and software projects

Plouffe authored articles and contributed to software tools and datasets distributed among repositories used by communities around arXiv, Elsevier, and conference proceedings of ISSAC and ACM symposia. He produced compilations of constants and tables analogous to classical works by D. H. Lehmer and modern compendia like those from CRC Press and Cambridge University Press. His datasets and code influenced implementations in environments maintained by GNU Project and collaborative platforms such as SourceForge and Bitbucket. Publications connected to his name have been cited alongside work from Jonathan Borwein, David Bailey, Peter Borwein, Fabrice Bellard, and contributors to The On-Line Encyclopedia of Integer Sequences.

Awards and recognition

Plouffe's discovery of the BBP formula and related computational achievements earned recognition within communities linked to SIAM, AMS, and organizations that sponsor prizes in computational mathematics, with his work routinely cited in contexts alongside laureates from institutions such as Royal Society fellows and recipients of honors like the Turing Award and Fields Medal for related breakthroughs. His contributions remain part of curricula and historical accounts at universities including McGill University, University of Toronto, and Université de Montréal and are commemorated through citations in textbooks by authors from Princeton University Press and Springer Verlag.

Category:Canadian mathematicians Category:Number theorists Category:Computer scientists