Number Theory


Recognizing Numerical Constants

Authors: Simon Plouffe, David H. Bailey

The advent of inexpensive, high-performance computers and new efficient algorithms have made possible the automatic recognition of numerically computed constants. In other words, techniques now exist for determining, within certain limits, whether a computed real or complex number can be written as a simple expression involving the classical constants of mathematics. These techniques will be illustrated by discussing the recognition of Euler sum constants, and also the discovery of new formulas for π and other constants, formulas that permit individual digits to be extracted from their expansions.

Comments: 17 Pages. Published in 1996

Download: PDF

Submission history

[v1] 2014-09-12 10:33:03

Unique-IP document downloads: 91 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus