NobleBlocks
Public

Memory Efficient Arithmetic

Published in ArXiv.org • Feb 25, 2003
NobleIDNI8P94W64R07S04
Authors:
Ernie Croot

Abstract

In this paper we give an algorithm for computing the mth base-b digit (m=1 is the least significant digit) of an integer n (actually, it finds sharp approximations to n/b^m mod 1), where n is defined as the last number in a sequence of integers s1,s2,...,sL=n, where s1=0, s2=1, and each successive s...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!