We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log(2) or _ on a modest workstation in a few hours run time.We demonstrate this technique by computing the ten billionth hexadecimal digit of it, the billionth hexadecimal digits of _'_, log(2) and log2(2), and the ten billionth decimal digit of log(9/10).These calculations rest on the observation that very special types of identities exist for certain numbers like n, it 2, log(2) and 1og2(2). These are essentially polylogarithmic ladders in an integer base. A number of these identities that we derive in this work appear to be new, for example the critical identity for 7z:
We study a sequence, c, which encodes the lengths of blocks in the Thue-Morse sequence. In particular, we show that the generating function for c is a simple product.
We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log(2) or _ on a modest workstation in a few hours run time.We demonstrate this technique by computing the ten billionth hexadecimal digit of it, the billionth hexadecimal digits of _'_, log(2) and log2(2), and the ten billionth decimal digit of log(9/10).These calculations rest on the observation that very special types of identities exist for certain numbers like n, it 2, log(2) and 1og2(2). These are essentially polylogarithmic ladders in an integer base. A number of these identities that we derive in this work appear to be new, for example the critical identity for 7z:
We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log (2) or π on a modest work station in a few hours run time.We demonstrate this technique by computing the ten billionth hexadecimal digit of π, the billionth hexadecimal digits of π 2 , log(2) and log 2 (2), and the ten billionth decimal digit of log(9/10).These calculations rest on the observation that very special types of identities exist for certain numbers like π, π 2 , log(2) and log 2 (2). These are essentially polylogarithmic ladders in an integer base. A number of these identities that we derive in this work appear to be new, for example the critical identity for π:.
his article gives a brief history of the analysis and computation of the mathematical t constant = 3.14159. including number of formulas that have been used to com-
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.