{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:00:20Z","timestamp":1743008420902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812439"},{"type":"electronic","value":"9783031812446"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81244-6_32","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:44:24Z","timestamp":1735652664000},"page":"323-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Division in\u00a0the\u00a0Computation of\u00a0Binary BBP-Type Formulas for\u00a0Mathematical Constants"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1357-5770","authenticated-orcid":false,"given":"Daisuke","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"32_CR1","first-page":"11","volume":"5","author":"V Adamchik","year":"1996","unstructured":"Adamchik, V., Wagon, S.: $$\\pi $$: a 2000-year-old search changes direction. Math. Edu. Res. 5, 11\u201319 (1996)","journal-title":"Math. Edu. Res."},{"key":"32_CR2","first-page":"852","volume":"104","author":"V Adamchik","year":"1997","unstructured":"Adamchik, V., Wagon, S.: A simple formula for $$\\pi $$. Am. Math. Mon. 104, 852\u2013855 (1997)","journal-title":"Am. Math. Mon."},{"key":"32_CR3","first-page":"18","volume":"17","author":"K Adegoke","year":"2011","unstructured":"Adegoke, K., Lafont, J.O., Layeni, O.: A class of digit extraction BBP-type formulas in general binary bases. Notes Number Theory Discret. Math. 17, 18\u201332 (2011)","journal-title":"Notes Number Theory Discret. Math."},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1090\/S0025-5718-97-00856-9","volume":"66","author":"D Bailey","year":"1997","unstructured":"Bailey, D., Borwein, P., Plouffe, S.: On the rapid computation of various polylogarithmic constants. Math. Comput. 66, 903\u2013913 (1997)","journal-title":"Math. Comput."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Bailey, D.H.: The BBP algorithm for pi (2006). https:\/\/www.davidhbailey.com\/dhbpapers\/bbp-alg.pdf","DOI":"10.2172\/983322"},{"key":"32_CR6","unstructured":"Bailey, D.H.: A compendium of BBP-type formulas for mathematical constants (2023). https:\/\/www.davidhbailey.com\/dhbpapers\/bbp-formulas.pdf"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/10586458.2001.10504441","volume":"10","author":"DH Bailey","year":"2001","unstructured":"Bailey, D.H., Crandall, R.E.: On the random character of fundamental constant expansions. Exp. Math. 10, 175\u2013190 (2001)","journal-title":"Exp. Math."},{"key":"32_CR8","unstructured":"Bellard, F.: A new formula to compute the n\u2019th binary digit of pi (1997). https:\/\/bellard.org\/pi\/pi_bin.pdf"},{"key":"32_CR9","doi-asserted-by":"publisher","DOI":"10.1201\/b10704","volume-title":"Mathematics by experiment: plausible reasoning in the 21st century","author":"J Borwein","year":"2008","unstructured":"Borwein, J., Bailey, D.: Mathematics by experiment: plausible reasoning in the 21st century, 2nd edn. A K Peters, Natick (2008)","edition":"2"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Craig-Wood, N.: Euler found the first binary digit extraction formula for $$\\pi $$ in 1779. Euleriana 3, Article 3 (2023)","DOI":"10.56031\/2693-9908.1049"},{"key":"32_CR11","unstructured":"Fog, A.: Instruction tables: lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD, and VIA CPUs (2022). https:\/\/www.agner.org\/optimize\/instruction_tables.pdf"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1006\/jsco.1993.1012","volume":"15","author":"T Jebelean","year":"1993","unstructured":"Jebelean, T.: An algorithm for exact division. J. Symb. Comput. 15, 169\u2013180 (1993)","journal-title":"J. Symb. Comput."},{"key":"32_CR13","unstructured":"Karrels, E.: Computing the quadrillionth digit of $$\\pi $$ (2013). https:\/\/on-demand.gputechconf.com\/gtc\/2013\/presentations\/S3071-Computing-the-Quadrillionth-Digit-of-Pi.pdf"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Sze, T.W.: The two quadrillionth bit of pi is 0! distributed computation of pi with Apache Hadoop. In: Proc. 2010 IEEE Second International Conference on Cloud Computing Technology and Science (CloudCom 2010), pp. 727\u2013732 (2010)","DOI":"10.1109\/CloudCom.2010.57"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.parco.2018.02.002","volume":"75","author":"D Takahashi","year":"2018","unstructured":"Takahashi, D.: Computation of the 100 quadrillionth hexadecimal digit of $$\\pi $$ on a cluster of Intel Xeon Phi processors. Parallel Comput. 75, 1\u201310 (2018)","journal-title":"Parallel Comput."},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11139-018-0104-x","volume":"51","author":"D Takahashi","year":"2020","unstructured":"Takahashi, D.: On the computation and verification of $$\\pi $$ using BBP-type formulas. Ramanujan J. 51, 177\u2013186 (2020)","journal-title":"Ramanujan J."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11139-021-00475-y","volume":"59","author":"D Takahashi","year":"2022","unstructured":"Takahashi, D.: On the use of Montgomery multiplication in the computation of binary BBP-type formulas for mathematical constants. Ramanujan J. 59, 211\u2013219 (2022)","journal-title":"Ramanujan J."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81244-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:08:14Z","timestamp":1735654094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81244-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812439","9783031812446"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81244-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}