Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Numerical results on the transcendence of constants involving $ \pi,e$, and Euler's constant

Author: David H. Bailey
Journal: Math. Comp. 50 (1988), 275-281
MSC: Primary 11J81; Secondary 11Y60
MathSciNet review: 917835
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Let $ x = ({x_1},{x_2}, \ldots ,{x_n})$ be a vector of real numbers. x is said to possess an integer relation if there exist integers $ {a_i}$ such that $ {a_1}{x_1} + {a_2}{x_2} + \cdots + {a_n}{x_n} = 0$. Recently, Ferguson and Forcade discovered practical algorithms [7], [8], [9] which, for any n, either find a relation if one exists or else establish bounds within which no relation can exist. One obvious application of these algorithms is to determine whether or not a given computed real number satisfies any algebraic equation with integer coefficients (where the sizes of the coefficients are within some bound).

The recursive form of the Ferguson-Forcade algorithm has been implemented with multiprecision arithmetic on the Cray-2 supercomputer at NASA Ames Research Center. The resulting computer program has been used to probe the question of whether or not certain constants involving $ \pi $, e, and $ \gamma $ satisfy any simple polynomial equations. These computations established that the following constants cannot satisfy any algebraic equation of degree eight or less with integer coefficients whose Euclidean norm is $ {10^9}$ or less: $ e/\pi $, $ e + \pi $, $ {\log _e}\pi $, $ \gamma $, $ {e^\gamma }$, $ \gamma /e$, $ \gamma /\pi $, and $ {\log _e}\gamma $. Stronger results were obtained in several cases. These computations thus lend credence to the conjecture that each of the above mathematical constants is transcendental.

References [Enhancements On Off] (What's this?)

  • [1] D. H. Bailey, "The computation of $ \pi $ to 29,360,000 decimal digits using Borweins' quartically convergent algorithm," Math. Comp., v. 50, 1988, pp. 283-296. MR 917836 (88m:11114)
  • [2] D. H. Bailey, "A high performance fast Fourier transform algorithm for the Cray-2," J. Supercomputing, v. 1, 1987, pp. 43-60.
  • [3] A. Baker, Transcendental Number Theory, Cambridge Univ. Press, London, 1975. MR 0422171 (54:10163)
  • [4] J. M. Borwein & P. B. Borwein, "The arithmetic-geometric mean and fast computation of elementary functions," SIAM Rev., v. 26, 1984, pp. 351-365. MR 750454 (86d:65029)
  • [5] J. M. Borwein & P. B. Borwein, Pi and the AGM--A Study in Analytic Number Theory and Computational Complexity, Wiley, New York, 1987.
  • [6] E. O. Brigham, The Fast Fourier Transform, Prentice-Hall, Englewood Cliffs, N. J., 1974.
  • [7] H. R. P. Ferguson &. R. W. Forcade, "Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two," Bull. Amer. Math. Soc. (N.S.), v. 1, 1979, pp. 912-914. MR 546316 (80i:10039)
  • [8] H. R. P. Ferguson, "A non-inductive $ {\text{GL}}(n,Z)$ algorithm that constructs linear relations for n Z-linearly dependent real numbers," J. Algorithms, v. 8, 1987, pp. 131-145. MR 875331 (88h:11096)
  • [9] H. R. P. Ferguson, "A short proof of the existence of vector Euclidean algorithms," Proc. Amer. Math. Soc., v. 97, 1986, pp. 8-10. MR 831375 (87i:11080)
  • [10] D. W. Sweeney, "On the computation of Euler's constant," Math. Comp., v. 17, 1963, pp. 170-178. MR 0160308 (28:3522)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11J81, 11Y60

Retrieve articles in all journals with MSC: 11J81, 11Y60

Additional Information

Article copyright: © Copyright 1988 American Mathematical Society

American Mathematical Society