Drexel dragonThe Math Forum

The Math Forum Internet Mathematics Library

Identities for Linear Recurring Sequences

Library Home || Full Table of Contents || Library Help

Visit this site: http://www.mathpages.com/home/kmath016.htm

Author:Kevin Brown
Description: There are several methods for computing the Nth term (mod M) of a linear recurring sequence of order d in log_2(N) steps, but most such methods require d^2 full multiplications (mod M) per step. The algorithm described below requires only d(d+1)/2 multiplications per step.

Levels: College
Languages: English
Resource Types: Articles
Math Topics: Sequences and Sets

[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help

© 1994- The Math Forum at NCTM. All rights reserved.