Let us revisit the geometric progression sum considered in an earlier article,
s_r = \sum_{k=0}^\infty r^k = 1 + r + r^2 + r^3 + \ldots,
where r here is a complex number. For what values of r does this infinite sum make sense? Can we find a closed-form expression for s_r in such cases?
Full story »
Introduction This article is a follow-up to part 1 where multiple-precision addition, subtraction, and multiplication for non-negative integers was discussed. This article deals with division. Again, the theoretic foundation is based on Section 4.3.1, The Classical Algorithms, of The Art of Computer Programming, Volume 2, by Donald E. Knuth.
Full story »