We develop ladders that reduce , for , and , for , to convergent polylogarithms and products of powers of and . Rapid computability results because the required arguments of satisfy , with . We prove that , , , , , , , , and six products of powers of and are constants whose th hexadecimal digit can be computed in time~ and space~, as was shown for , , and by Bailey, Borwein and Plouffe. The proof of the result for entails detailed analysis of hypergeometric series that yield Euler sums, previously studied in quantum field theory. The other 13 results follow more easily from Kummer’s functional identities. We compute digits of and , starting at the ten millionth hexadecimal place. These constants result from calculations of massless Feynman diagrams in quantum chromodynamics. In a related paper, hep-th/9803091, we show that massive diagrams also entail constants whose base of super-fast computation is .

生成讲解博客的中文版本

生成AI智能校验的中文版本