scientific article; zbMATH DE number 1807669

MaRDI QIDQ3149532zbMATH OpenFDO

Authors Cristiano Teodoro

Publication date 24 November 2002

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Calculation of integer sequences (11Y55)

Recommendations

• Fast Computation of Fibonacci Numbers and Their Sums
• A fast algorithm for computing large Fibonacci numbers
• On Fibonacci search method with \(k\)-Lucas numbers.
• Fibonacci and Lucas sums by matrix methods
• scientific article; zbMATH DE number 1995564
• The computational formulas of general higher order Fibonacci number and Lucas number
• A method for computing Lucas sequences
• A symmetric algorithm for hyper-Fibonacci and hyper-Lucas numbers
• On generalized Fibonacci and Lucas numbers by matrix methods

Cited in

(7)

• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• A method for computing Lucas sequences
• A fast algorithm for computing large Fibonacci numbers
• Improved algorithms for the calculation of Fibonacci numbers
• A Formal Derivation of an 0(log n) Algorithm for Computing Fibonacci Numbers
• scientific article; zbMATH DE number 17620 (Why is no real title available?)
• scientific article; zbMATH DE number 977919 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149532)