DOI: 10.5176/2251-1911_CMCGS20
Authors: Howard Cheng and Christopher Martin
Abstract: Many important well-known constants such as and (3) can be approximated by a truncated hypergeometric series. A modular algorithm based on rational number reconstruction was previously proposed to reduce space complexity of the well-known binary splitting algorithm [1]. In this paper, we examine some variations of this algorithm using Mersenne number moduli and Montgomery multiplication. Implementations of these variations are compared to existing methods and evaluated for their practicality
Updating...