arXiv · 1610.06376
Efficient computation of terms of linear recurrence sequences of any order
Abstract
In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence. Unlike Fiduccia's algorithm our approach uses certain formulas for modular polynomial squarings.
Explore related subjects
Keep this discovery
Dmitry I. Khomovsky. 2016-10-20. Efficient computation of terms of linear recurrence sequences of any order. https://arxiv.org/abs/1610.06376
Cite the original work for its findings. Save a collection to share your selection of sources.