2000 character limit reached
A method for obtaining Fibonacci identities
Published 12 Oct 2016 in math.NT, cs.IT, math.IT, math.NA, and math.RA | (1610.03883v4)
Abstract: For the Lucas sequence ${U_{k}(P,Q)}$ we discuss the identities such as the well-known Fibonacci identities. We also propose a method for obtaining identities involving recurrence sequences. With the help of which we find an interpolating type identity for second order linear recurrences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
