GateAI
Recurrence Relations

GATE CSE 2023 · Q15

MCQ1 markEasy

Time

The Lucas sequence LnL_n is defined by the recurrence relation: Ln=Ln−1+Ln−2,for n≥3,L_n = L_{n-1} + L_{n-2}, \quad \text{for } n \ge 3, with L1=1L_1 = 1 and L2=3L_2 = 3. Which one of the options given is TRUE?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: A) Ln = ( 1 + √(5)2 )n + ( 1 - √(5)2 )n

Recurrence Relations

The recurrence relation is given by:

Ln−Ln−1−Ln−2=0L_n - L_{n-1} - L_{n-2} = 0

The characteristic equation is:

r2−r−1=0r^2 - r - 1 = 0

Solving for the roots rr using the quadratic formula:

r=1±1−4(1)(−1)2=1±52r = \frac{1 \pm \sqrt{1 - 4(1)(-1)}}{2} = \frac{1 \pm \sqrt{5}}{2}

Let α=1+52\alpha = \frac{1+\sqrt{5}}{2} and β=1−52\beta = \frac{1-\sqrt{5}}{2}. The general solution to the recurrence relation is:

Ln=c1αn+c2βnL_n = c_1 \alpha^n + c_2 \beta^n

We can find the constants c1c_1 and c2c_2 using the initial conditions L1=1L_1 = 1 and L2=3L_2 = 3:

  1. For n=1n = 1:

c1(1+52)+c2(1−52)=1  ⟹  (c1+c2)+5(c1−c2)=2c_1 \left(\frac{1+\sqrt{5}}{2}\right) + c_2 \left(\frac{1-\sqrt{5}}{2}\right) = 1 \implies (c_1 + c_2) + \sqrt{5}(c_1 - c_2) = 2
  1. For n=2n = 2:

c1(1+52)2+c2(1−52)2=3c_1 \left(\frac{1+\sqrt{5}}{2}\right)^2 + c_2 \left(\frac{1-\sqrt{5}}{2}\right)^2 = 3

Since α2=3+52\alpha^2 = \frac{3+\sqrt{5}}{2} and β2=3−52\beta^2 = \frac{3-\sqrt{5}}{2}:

c1(3+52)+c2(3−52)=3  ⟹  3(c1+c2)+5(c1−c2)=6c_1 \left(\frac{3+\sqrt{5}}{2}\right) + c_2 \left(\frac{3-\sqrt{5}}{2}\right) = 3 \implies 3(c_1 + c_2) + \sqrt{5}(c_1 - c_2) = 6

Subtracting the first equation from the second equation:

2(c1+c2)=4  ⟹  c1+c2=22(c_1 + c_2) = 4 \implies c_1 + c_2 = 2

Substituting c1+c2=2c_1 + c_2 = 2 back into the first equation:

2+5(c1−c2)=2  ⟹  5(c1−c2)=0  ⟹  c1=c22 + \sqrt{5}(c_1 - c_2) = 2 \implies \sqrt{5}(c_1 - c_2) = 0 \implies c_1 = c_2

Since c1+c2=2c_1 + c_2 = 2 and c1=c2c_1 = c_2, we obtain c1=1c_1 = 1 and c2=1c_2 = 1.

Therefore, the closed-form expression is:

Ln=(1+52)n+(1−52)nL_n = \left(\frac{1+\sqrt{5}}{2}\right)^n + \left(\frac{1-\sqrt{5}}{2}\right)^n

This matches option A.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

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

Where do you stand for GATE?

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.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Recurrence Relations in GATE CSE

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 Relations

More from GATE CSE 2023

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2023 · Q15 · MCQ

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

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.