åèæç®
ããã§ã¯ãã®ãµã¤ãã®å 容ãæ¸ãããã«åç §ããè³æãæããã ã¾ãï¼åèã®ããã«å 容ã«åæ ããã¦ããªãï¼ãããã£ã¦ããªãï¼ è³æãçªå·ãä»ããæãã¦ããã
ãªãï¼æ¸ç±å ã«è¦ãããï¼æãããªèª¤æ¤ã«ã¤ãã¦ãè¨è¼ããã
æ¸ç±(æ¥æ¬èª)
- [JB01]
éç° åº·æ£
ãÏã®ã¯ãªãã
æ±äº¬å³æ¸, 1991.
- [JB02] ã¸ã£ã³=ãã¼ã« ãã¥ã©ã¨ï¼èï¼ï¼ç æ¿ç¾©ï¼è¨³ï¼ ãÏâé æã®æ°ã æåæ¸åº, 2010.
-
- p.36 Ïâã®å¼ä¸ã«ãã $e$ ã®ææ°ã¯ $n^2/10^{10}$ â $-n^2/10^{10}$ (第 2 å·ã§ä¿®æ£æ¸ã¿)
- p.117 è¨ç®çµæã® 1 å æ¡ â 2500 åæ¡ã16 é²æ°ã§ã¯ãªã 2 é²æ°ã§æ°ããã 1 å æ¡
- p.169 (8) ã®å³è§£ä¸ï¼AE ã®é·ã㯠3/2 â 3/10
- [JB03] Alfred S. Posamentier, Ingmar Lehmannï¼è¨³ï¼æ¾æµ¦ ä¿è¼ï¼ ãä¸æè°ãªæ°Ïã®ä¼è¨ã æ¥çµBP, 2005.
- [JB05] 竹ä¹å è©, ä¼è¤ é ãÏ âÏã®è¨ç®ã¢ã«ãã¡ãã¹ããç¾ä»£ã¾ã§ã å ±ç«åºç, 2007.
- [JB06] 寺澤 é ãÏã¨å¾®ç©åã®23話ã æ¥æ¬è©è«ç¤¾, 2006.
- [JB07] çªå£ åå ãÏã®å ¬å¼ããã¶ã¤ã³ããã æ°é¢¨è, 1997.
- [JB08] æ´ç° æ彦 ãÏã®æ¬ã ç§å®¶æ¬, 1980.
- å½ä¼å³æ¸é¤¨ã«ã¦é²è¦§å¯è½ã
- [JB09] å æ²ä¸, ç§ä¹å ä¸é ãè¨ç®æ©æ¢°ã å ±ç«å ¨æ¸, 1953.
- [JB10] ã¬ãªã³ãã«ãã»ãªã¤ã©ã¼(è)ï¼é«ç¬æ£ä»(訳) ããªã¤ã©ã¼ã®ç¡é解æã 海鳴社ï¼2001ï¼
æ¸ç±(å¤å½èª)
- [FB01] Lennart Berggren, Jonathan M. Borwein, and Peter B. Borwein ãPi: A Source Bookã Springer, 2004.
- æ°å¤ãã®è«æãæ²è¼ããã¦ããã®ã§å¼ç¨ããè«æã¯ç¹å®ããã
- [FB02] Jörg Arndt and Christoph Haenel (Trans. Catriona and david Lischka) ãπ UNLEASHEDã Springer, 2000.
-
1998 å¹´ã«åºããããã¤ãèªæ¬ã®è±è¨³çãå
æ¬ã¯ 2010 å¹´ã«åçããã¦ããã翻訳ã®ãããï¼èª¤æ¤ãå¤ãã
- p.38 (3.1) å¼ã®ä¸ã®è¡ï¼2 ã®åã ãã¹ãã¼ã¹ãç¡ãã
- p.47 l.28 Hiryuku â Hiroyuki
- p.111 (8.8)ï¼p.237 (16.153) ak+1 ã®å¾ãã«ï¼ãç¡ã
- p.128 l.15 hindivisual â indivisual
- p.129 vï¼ï¼vâv(a,k)âv(a,2k-1) â vï¼ï¼vâv(a,k)ï¼v(a,2k-1)
- p.148 â ã®ä½ç½®ãå¤ã
- p.159 Ok(r) ã®å¼ä¸ï¼ååã® n â k
- p.159 表㮠O2(r) 㯠Ïr/2 â Ïrã»2
- p.194 l.13 in 1772 â In 1772
- p.205 Aryabhata 㯠pg(384) â pgm(384)ï¼W. Shanks ã® No. of deciamls 㯠530 â 527
- p.206 1996.03 ã® Chudnovsky's ã®è¨é²ã§ã¯ unknown 㨠1 week? ãé
- p.226 (16.45) ã®ååï¼(4n)!) â (4n)!
- p.227 (16.53) 1 è¡ç®è¡æ«ã®ï¼ã¯ä¸è¦
- p.233 (16.133) n2 â n2
- p.237 (16.152) ã®åæåå¾ã§ 16ã»4n â 16ã»4k
- [FB03] Donald E. Knuth ãThe Art of Computer Programming VOLUME 2 Seminumerical Algorithms Third Editionã Addison Wesley, 1998.
- é¦è¨³ãããã¤ãããã®ã§é©å½ãªãã®ãåç §ãã¦ãããããã
- [FB04] Pierre Eymar and Jean-Pierre Lafon (Trans. Stephen S. Wilson) ãTHE NUMBER πã AMS, 2004.
-
1999 å¹´ã«åºçããããã©ã³ã¹èªæ¬ã®è±è¨³çã
- p.69 Proof ã® 3 è¡ç®ï¼qn+1ï¼(1ï¼un+1/un)qnâun+1/unqn-1
- p.87 1 段è½ç®ã®æå¾ï¼loga(xy)ï¼logaxï¼logay
- p.94 2 å¼ç®åæ¯ï¼(2nï¼1)!) â (2nï¼1)!
- p.211 (5.20) (k3-k)d2y/dx2 â (k3-k)d2y/dk2
- p.212 1ï¼2 è¡ç® dy/dx â dy/dkï¼dy/dx2 â dy/dk2
- p.220 2 å¼ç®ï¼yân â yn
- p.239 (5.55) q(2)n â (q2)n
- p.250 2F1 㨠3F2 ã®ååï¼(bn) â (b)n
- p.252 (5.81),(5.83),(5.84) ã® 3F2 㧠(ã; 1,1, Ï(k)) â (ã; 1,1; Ï(k))
- [FB05] Jonathan M. Borwein and Peter B. Borwein ãPi and the AGMã Wiley-Interscience, 1998. (Amazon)
- [FB06] Niven, I. M. ãIrrational Numbersã New York: Wiley, 1956.
Web(æ¥æ¬èª)
- [JW01] ããªããåå¨çã¯3.14ãªã®ãï¼ã(ãã³ãã³åç»)
- [JW02] Ï=3.
- å°æ°ç¹ä»¥ä¸1åæ¡è¡¨ç¤ºãããµã¼ãã
- [JW03] FTPã«ããpiãµã¼ãã¹
- æ°å¤ãã®è¨ç®è¨é²ãåºããéç°ç 究室ã®FTPãµã¼ãã40åæ¡ã¾ã§ã®å¤ãéå»ã®è¨ç®è¨é²ã®è©³ç´°ï¼è¨ç®ããã°ã©ã ãsuperÏãããã¦ã³ãã¼ãã§ããã
- [JW04] åå¨çã®å ¬å¼é æ«å®ç Ver. 3.141
- [JW05] Ïã®å ¬å¼ããã¶ã¤ã³ãã
- [JB07]ã®ã¦ã§ãçã
- [JW06] FFT (é«éãã¼ãªã¨ã»ã³ãµã¤ã³ã»ãµã¤ã³å¤æ) ã®æ¦ç¥ã¨è¨è¨æ³
- [JW07] Pi
- Ïã®å¤ã 13 å æ¡ã¾ã§ï¼1 åæ¡ãã¨ã« ZIP ãã¡ã¤ã«ã§ãã¦ã³ãã¼ãã§ãããå ¬éããã¦ããÏã®å¤ã®æ大æ°ã
- [JW08] Daisuke Takahashi's Home Page
- åå¨çè¨ç®ã§ããã¤ãä¸çè¨é²ãæã¡ç«ã¦ãé«æ©å¤§ä»æ°ã®ãã¼ã¸
Web(å¤å½èª)
- [FW01] Fabrice Bellard's Home Page
- å ¬å¼ãè¨ç®ãªã©ï¼å¹ åºãåå¨çè¨ç®ã«ã¤ãã¦ç 究ã»å®é¨ããã¦ãã Bellard ã®ãµã¤ãã ãµã¤ãå ã¯åããã«ãããï¼ä¾ãã°Ïã® 16 é²è¡¨è¨é¨åè¨ç®ã«ã¤ãã¦ã¯ Old projectsâworld record for... ã«ããã
- [FW02] PiHex
- [FW03] Computing π with Hadoop
- [FW04] Pi-Prime -- from Wolfram mathWorld
- [FW05] Computing Digits of π with CUDA
éèª(æ¥æ¬èª)
- [JM01] é«æ© 大ä», ãåå¨çä¸çè¨é²æ´æ° 2å 5769å8037ä¸æ¡ã¸ã®éã, ãæ å ±å¦çã Vol.50 No.12, æ å ±å¦çå¦ä¼, 2009.
- [JM02] ä¸æ æ», ãã¨ã¬ã¬ã³ããªè§£çããã¨ã åºé¡ç·¨ã, ãæ°å¦ã»ããã¼ã 1998 å¹´ 3 æå·, æ¥æ¬è©è«ç¤¾, 1998.
- [JM03] ä¸æ æ», ãã¨ã¬ã¬ã³ããªè§£çããã¨ã 解çç·¨ã, ãæ°å¦ã»ããã¼ã 1998 å¹´ 6 æå·, æ¥æ¬è©è«ç¤¾, 1998.
- [JM04] åå¯ è±å², ãåå¨çæ誦ã«é ããããåçã, ãæ°å¦æåã 第 1 å·, æ¥æ¬è©è«ç¤¾, 2003. (Amazon)
- [JM05] é«é åä¹ é, ãÏã® arctangent relations ãæ±ãã¦ã, ãbitã 1983 å¹´ 4 æå·, å ±ç«åºç, 1983.
è«æ(æ¥æ¬èª)
- [JT01] å³ç° åå², 天é æ, æµ ç° å°ç´, è¤é æ¸ æ¬¡. "ç´æ°ã®éç´ã«ããå¤åé·æ°ã®è¨ç®æ³ã¨Ïã®è¨ç®ã¸ã®å¿ç¨". æ å ±å¦çå¦ä¼ç ç©¶å ±å 98-HPC-74, pp.31-36.
- [JT02] å¾ ä¿ç¯, éç° åº·æ£, é«æ© 大ä». "ç´æ°ã«åºã¥ãå¤æ°æ¡è¨ç®ã®æ¼ç®éåæ¸ãå®ç¾ããåå²æçæ°åæ³". æ å ±å¦çå¦ä¼è«æèª 41-6 (2000).
- [JT03] å¾ ä¿ç¯. "å¤æ°æ¡è¨ç®ã«ãããé«éã¢ã«ã´ãªãºã ã®ç 究". æ©ç¨²ç°å¤§å¦å¦ä½è«æ(2005).
- [JT04] é«æ© 大ä», éç° åº·æ£. "å¤åé·å¹³æ¹æ ¹ã®é«éè¨ç®æ³". æ å ±å¦çå¦ä¼ç ç©¶å ±å 95-HPC-58, pp.51-56.
- [JT05] æ¾å éäº. "è¨ç®å¹çã®è¯ã arctan é¢ä¿å¼ã®æ¢ç´¢ã®è©¦ã¿" (å ±åæ¸). (2009). (PDF)
è«æ(å¤å½èª)
- [FT01] D.V. Chudnovsky, G.V. Chudnovsky "Approximations and complex multiplication according to Ramanujan" in [FB01]
- [FT02] R. Webster "The Tale of Ï" in [FB01]
- 第14åIMOã®ãã³ãï¼
- [FT03] Lam Lay-Yong "Circle Measurements in Ancient China" in [FB01]
- [FT04] Ivan Niven "A SIMPLE PROOF THAT Ï IS IRRATIONAL" in [FB01]
- [FT05] Bruno Haible and Thomas Papanikolaou. "Fast Multiprecision Evaluation of Series of Rational Numbers". Third International Symposium, ANTS-III. 1997. (CiteSeer)
- [FT06] Xavier Gourdon and Pascal Sebah. "Binary splitting method" (HTML) (PS)
- [FT07] J. M. Borwein and P. B. Borwein. "Strange Series and High Precision Fraud". (PDF)
- [FT08] David Eugene Smith. "WILLIAM JONES - The First Use of π for the Circle Ratio" in [FB01]
- [FT09] David H. Bailey, Jonathan M. Borwein, Peter B. Borwein, and Simon Plouffe. "The Quest for Pi". Mathematical Intelligencer (Volume 19, p.50-57). 1997. (CiteSeer)
- [FT10] Fabrice Bellard. "A new formula to compute the n'th binary digit of pi". 1997.
- [FT11] V. A. Lebesgue. "Sur l'impossibilité en nombres entiers de l'équation xmï¼y2ï¼1". Nouvelles Annales des Mathématiques 1 [9] (1850), 178-181. (PDF)
- [FT12] W. Ljunggren. "Zur Theorie der Gleichung x2ï¼1ï¼Dy4". Avh. Norske Vid. Akad. Oslo. I. (1942), No. 5. MR 8:6f
- [FT13] Fabrice Bellard. "Computation of the n'th digit of Ï in any base in O(n2)". (1997) (PS)
- [FT14] Xavier Gourdon. "Computation of the $n$-th decimal digit of $\pi$ with low memory". (2003) (PDF)
- [FT15] Cyril Bouvier, Paul Zimmermann. "Division-Free Binary-to-Decimal Conversion" (2013) hal-00864293v1 (PDF)