An algorithm for proving arbitrary identities involving linear recurrence sequences

MaRDI QIDQ2883413zbMATH OpenFDO

Authors William A. Webb

Publication date 10 May 2012

Published in Congressus Numerantium (Search for Journal in Brave)

Mathematics Subject Classification ID

Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

An algorithm for proving of identities involving linear recurrence sequences is introduced and illustrated with six examples, related to Fibonacci numbers.

Recommendations

• scientific article; zbMATH DE number 701827
• An efficient algorithm for deriving summation identities from mutual recurrences
• A comparison of algorithms for proving positivity of linearly recurrent sequences
• scientific article; zbMATH DE number 7008842
• An algorithmic approach to discovering and proving \(q\)-series identities
• On explicit formulae and linear recurrent sequences
• scientific article; zbMATH DE number 4118432
• scientific article; zbMATH DE number 6096371
• On finite sequences satisfying linear recursions
• An Efficient Formula for Linear Recurrences

Cited in

(4)

• An algebraic derivation of a certain exact sequence
• scientific article; zbMATH DE number 7008842 (Why is no real title available?)
• An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
• A method for uniformly proving a family of identities

This page was built for publication: An algorithm for proving arbitrary identities involving linear recurrence sequences

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