Numerical results on the transcendence of constants involving , and Euler's constant
Author:
David H. Bailey
Journal:
Math. Comp. 50 (1988), 275281
MSC:
Primary 11J81; Secondary 11Y60
MathSciNet review:
917835
Fulltext PDF Free Access
Abstract 
References 
Similar Articles 
Additional Information
Abstract: Let be a vector of real numbers. x is said to possess an integer relation if there exist integers such that . 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 FergusonForcade algorithm has been implemented with multiprecision arithmetic on the Cray2 supercomputer at NASA Ames Research Center. The resulting computer program has been used to probe the question of whether or not certain constants involving , e, and 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 or less: , , , , , , , and . Stronger results were obtained in several cases. These computations thus lend credence to the conjecture that each of the above mathematical constants is transcendental.
 [1]
David
H. Bailey, The computation of 𝜋 to
29,360,000 decimal digits using Borweins’ quartically convergent
algorithm, Math. Comp. 50
(1988), no. 181, 283–296. MR 917836
(88m:11114), http://dx.doi.org/10.1090/S00255718198809178363
 [2]
D. H. Bailey, "A high performance fast Fourier transform algorithm for the Cray2," J. Supercomputing, v. 1, 1987, pp. 4360.
 [3]
Alan
Baker, Transcendental number theory, Cambridge University
Press, LondonNew York, 1975. MR 0422171
(54 #10163)
 [4]
J.
M. Borwein and P.
B. Borwein, The arithmeticgeometric mean and fast computation of
elementary functions, SIAM Rev. 26 (1984),
no. 3, 351–366. MR 750454
(86d:65029), http://dx.doi.org/10.1137/1026073
 [5]
J. M. Borwein & P. B. Borwein, Pi and the AGMA Study in Analytic Number Theory and Computational Complexity, Wiley, New York, 1987.
 [6]
E. O. Brigham, The Fast Fourier Transform, PrenticeHall, Englewood Cliffs, N. J., 1974.
 [7]
H.
R. P. Ferguson and R.
W. Forcade, Generalization of the Euclidean
algorithm for real numbers to all dimensions higher than two, Bull. Amer. Math. Soc. (N.S.) 1
(1979), no. 6, 912–914. MR 546316
(80i:10039), http://dx.doi.org/10.1090/S027309791979146913
 [8]
Helaman
R. P. Ferguson, A noninductive
𝐺𝐿(𝑛,𝑍) algorithm that constructs integral
linear relations for 𝑛𝑍linearly dependent real
numbers, J. Algorithms 8 (1987), no. 1,
131–145. MR
875331 (88h:11096), http://dx.doi.org/10.1016/01966774(87)900332
 [9]
Helaman
Ferguson, A short proof of the existence of
vector Euclidean algorithms, Proc. Amer. Math.
Soc. 97 (1986), no. 1, 8–10. MR 831375
(87i:11080), http://dx.doi.org/10.1090/S0002993919860831375X
 [10]
Dura
W. Sweeney, On the computation of Euler’s
constant, Math. Comp. 17 (1963), 170–178. MR 0160308
(28 #3522), http://dx.doi.org/10.1090/S0025571819630160308X
 [1]
 D. H. Bailey, "The computation of to 29,360,000 decimal digits using Borweins' quartically convergent algorithm," Math. Comp., v. 50, 1988, pp. 283296. MR 917836 (88m:11114)
 [2]
 D. H. Bailey, "A high performance fast Fourier transform algorithm for the Cray2," J. Supercomputing, v. 1, 1987, pp. 4360.
 [3]
 A. Baker, Transcendental Number Theory, Cambridge Univ. Press, London, 1975. MR 0422171 (54:10163)
 [4]
 J. M. Borwein & P. B. Borwein, "The arithmeticgeometric mean and fast computation of elementary functions," SIAM Rev., v. 26, 1984, pp. 351365. MR 750454 (86d:65029)
 [5]
 J. M. Borwein & P. B. Borwein, Pi and the AGMA Study in Analytic Number Theory and Computational Complexity, Wiley, New York, 1987.
 [6]
 E. O. Brigham, The Fast Fourier Transform, PrenticeHall, 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. 912914. MR 546316 (80i:10039)
 [8]
 H. R. P. Ferguson, "A noninductive algorithm that constructs linear relations for n Zlinearly dependent real numbers," J. Algorithms, v. 8, 1987, pp. 131145. 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. 810. MR 831375 (87i:11080)
 [10]
 D. W. Sweeney, "On the computation of Euler's constant," Math. Comp., v. 17, 1963, pp. 170178. 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
DOI:
http://dx.doi.org/10.1090/S00255718198809178351
PII:
S 00255718(1988)09178351
Article copyright:
© Copyright 1988
American Mathematical Society
