Abstract
Generalized Fibonacci and Lucas sequences (Un) and (Vn) are defined by the recurrence relations Un+1 = PUn+QUn−1 and Vn+1 = PVn +QVn−1, n ≥ 1, with initial conditions U0 = 0, U1 = 1 and V0 = 2, V1 = P. This paper deals with Fibonacci and Lucas numbers of the form Un(P,Q) and Vn(P,Q) with the special consideration that P ≥ 3 is odd and Q = −1. Under these consideration, we solve the equations Vn = 5kx, Vn = 7kx, Vn = 5kx±1, and Vn = 7kx±1 when k | P with k > 1. Moreover, we solve the equations Vn = 5x ± 1 and Vn = 7x ± 1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
