Article
Licensed
Unlicensed
Requires Authentication
A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants
-
Kunle Adegoke
Published/Copyright:
May 31, 2012
Abstract.
Using a clear and straightforward approach, we discover and prove new binary digit extraction BBP-type formulas for polylogarithm constants. Some known results are also rediscovered in a more direct and elegant manner. Numerous experimentally discovered and hitherto unproved binary BBP-type formulas are also proved.
Received: 2011-08-11
Accepted: 2011-10-17
Published Online: 2012-05-31
Published in Print: 2012-June
© 2012 by Walter de Gruyter Berlin Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- On a Theorem of Prachar Involving Prime Powers
- A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants
- A Recurrence Related to the Bell Numbers
- Sum-Product Estimates Applied to Waring's Problem over Finite Fields
- Communal Partitions of Integers
- On Computation of Exact van der Waerden Numbers
- On the Complexity of Chooser–Picker Positional Games
- Partition of an Integer into Distinct Bounded Parts, Identities and Bounds
- A Correlation Identity for Stern's Sequence
- Primitive Prime Divisors in Zero Orbits of Polynomials
Articles in the same Issue
- Masthead
- On a Theorem of Prachar Involving Prime Powers
- A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants
- A Recurrence Related to the Bell Numbers
- Sum-Product Estimates Applied to Waring's Problem over Finite Fields
- Communal Partitions of Integers
- On Computation of Exact van der Waerden Numbers
- On the Complexity of Chooser–Picker Positional Games
- Partition of an Integer into Distinct Bounded Parts, Identities and Bounds
- A Correlation Identity for Stern's Sequence
- Primitive Prime Divisors in Zero Orbits of Polynomials
