3 citations · 4 across the 8 of their papers we have counts for
Showing 2016 · math.NTShow all
2 papers · 2 filters
math.NT2016★ 3 cited
Efficient computation of terms of linear recurrence sequences of any order
Dmitry I. Khomovsky
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 indi…
math.NT2016
A method for obtaining Fibonacci identities
Dmitry I. Khomovsky
For the Lucas sequence we discuss the identities such as the well-known Fibonacci identities. We also propose a method for obtaining identities involving recurrenc…