Formal proofs of degree 5 binary BBP-type formulas

DOI10.7169/FACM/2013.48.1.2zbMath1268.11163OpenAlexW1981245701MaRDI QIDQ1948707

A. M. Adegoke

Publication date: 24 April 2013

Published in: Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.facm/1364222826

zbMATH Keywords

digit extraction formulasBailey-Borwein-Plouffe type formulaspolylogarithm constants

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Evaluation of number-theoretic constants (11Y60)

Cites Work

• Unnamed Item
• Unnamed Item
• New binary and ternary digit extraction (BBP-type) formulas for trilogarithm constants
• A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants
• On the rapid computation of various polylogarithmic constants
• A novel approach to the discovery of ternary BBP-type formulas for polylogarithm constants
• Analysis of PSLQ, an integer relation finding algorithm
• Finding and Excluding b-ary Machin-Type Individual Digit Formulae
• On the Random Character of Fundamental Constant Expansions
• A Non-PSLQ route to BBP-type formulas

This page was built for publication: Formal proofs of degree 5 binary BBP-type formulas