Efficient computation of terms of linear recurrence sequences of any order
Number Theory
2018-04-25 v2 Rings and Algebras
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 of an th-order linear recurrence. Unlike Fiduccia's algorithm our approach uses certain formulas for modular polynomial squarings.
Keywords
Cite
@article{arxiv.1610.06376,
title = {Efficient computation of terms of linear recurrence sequences of any order},
author = {Dmitry I. Khomovsky},
journal= {arXiv preprint arXiv:1610.06376},
year = {2018}
}
Comments
4 algorithms. arXiv admin note: substantial text overlap with arXiv:1610.03883