Computer Sciences > GATE 2023 > Discrete Mathematics
The Lucas sequence Ln is defined by the recurrence relation:
Ln = Ln-1 + Ln-2, for n ≥ 3, with L1 = 1 and L2 = 3.
Which one of the options given is TRUE?
A
Ln = (1+√5/2)n + (1-√5/2)n
B
Ln = (1+√5/2)n - (1-√5/3)n
C
Ln = (1+√5/2)n + (1-√5/3)n
D
Ln = (1+√5/2)n - (1-√5/2)n

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science