GATE CS 2023 Set 1 — Question 15

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33EasyRecurrence RelationsSets & CombinatoricsEngineering Mathematics

Engineering Mathematics → Sets & Combinatorics → Recurrence Relations

Last updated

Question

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

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Sets & Combinatorics