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?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2023 · Q15
Time
Select one answerSingle correct
Solution
Official answer: A) Ln = ( 1 + √(5)2 )n + ( 1 - √(5)2 )n
Recurrence RelationsThe recurrence relation is given by:
The characteristic equation is:
Solving for the roots using the quadratic formula:
Let and . The general solution to the recurrence relation is:
We can find the constants and using the initial conditions and :
For :
For :
Since and :
Subtracting the first equation from the second equation:
Substituting back into the first equation:
Since and , we obtain and .
Therefore, the closed-form expression is:
This matches option A.
Try the question first, then check your work.
Examiner trap
Set up the characteristic equation to find the roots, and then solve for the coefficients using the initial conditions and . Alternatively, check the values given by the options for and .
This Recurrence Relations previous year question is Q15 of the GATE CSE 2023 paper. Find more GATE CSE PYQs on Recurrence Relations in Engineering Mathematics, or browse all GATE CSE PYQs.
Free diagnostic
Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 4 related Recurrence Relations PYQs now with no account.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
Recurrence Relations has 4 GATE CSE PYQs across 4 papers from 2016 to 2024. 3 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2023.
How GATE tests Recurrence RelationsIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.