Recognizing Numerical Constants
暂无分享,去创建一个
[1] David Bailey,et al. On the rapid computation of various polylogarithmic constants , 1997, Math. Comput..
[2] J. Borwein,et al. Explicit evaluation of Euler sums , 1995 .
[3] B. Berndt. Ramanujan's Notebooks , 1985 .
[4] Jonathan M. Borwein,et al. Experimental Evaluation of Euler Sums , 1994, Exp. Math..
[5] David H. Bailey,et al. Numerical results on relations between fundamental constants using a new algorithm , 1989 .
[6] Bruce W. Char,et al. Maple V Language Reference Manual , 1993, Springer US.
[7] R. Forcade,et al. Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two , 1979 .
[8] David H. Bailey,et al. Multiprecision Translation and Execution of Fortran Programs , 1993 .
[9] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .
[10] Lawrence S. Kroll. Mathematica--A System for Doing Mathematics by Computer. , 1989 .
[11] Jonathan M. Borwein,et al. Pi and the AGM , 1999 .
[12] Stephen Wolfram,et al. Mathematica: a system for doing mathematics by computer (2nd ed.) , 1991 .
[13] Jonathan M. Borwein,et al. On an intriguing integral and some series related to (4) , 1995 .
[14] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[15] Jeffrey C. Lagarias,et al. Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers , 1989, STACS.
[16] Agnieszka Bodzenta. Proceedings of the Edinburgh Mathematical Society , 1893, Nature.
[17] F. M. Saxelby. Experimental Mathematics , 1902, Nature.