Guest · filters and generic practice availableBrowsing as a guest · PYQ filters and generic practice are available. Sign in only for personalised features and saved progress.
Quadratic Equation and Inequalities question
2019 · Shift 1 · Q26
JEE AdvancedMathematicsQuadratic Equation and InequalitiesMultiple correct+4 / −1
Let α and β be the roots of x2−x−1=0, with α>β. For all positive integers n, define an=α−βαn−βn,n≥1b1=1andbn=an−1+an+1,n≥2 Then which of the following options is/are correct?
A
n=1∑∞10nbn=898
B
bn = α n + β n for all n ≥ 1
C
a1 + a2 + a3 + ... + an = an+2 − 1 for all n ≥ 1
D
n=1∑∞10nan=8910
View written solutionFree
Correct answer: B, C, D
1. Analyze the Quadratic Equation and its Roots
The given quadratic equation is x2−x−1=0.
Let α and β be its roots. By the quadratic formula, the roots are x=21±1−4(1)(−1)=21±5.
Given α>β, we have:
α=21+5 and β=21−5.
From Vieta's formulas, we have:
Sum of roots: α+β=1
Product of roots: αβ=−1
Also, since α and β are roots of the equation, they satisfy it:
α2−α−1=0⟹α2=α+1
β2−β−1=0⟹β2=β+1
From these, we can also derive other useful relations:
α−β=21+5−21−5=5
α−1=1/α and β−1=1/β
α−1=−β and β−1=−α
2. Analyze the sequences an and bn
Sequence an:an=α−βαn−βn for n≥1.
This is the Binet's formula for the Fibonacci sequence (Fn). Let's check the first few terms:
a1=α−βα−β=1
a2=α−βα2−β2=α+β=1
a3=α−βα3−β3=α2+αβ+β2=(α+β)2−αβ=12−(−1)=2
So, the sequence an is 1,1,2,3,5,…, which are the Fibonacci numbers, an=Fn. The sequence satisfies the recurrence relation an=an−1+an−2 for n≥3.
Sequence bn:b1=1 and bn=an−1+an+1 for n≥2.
Let's analyze bn for n≥2:
bn=an−1+an+1=α−βαn−1−βn−1+α−βαn+1−βn+1bn=α−β(αn−1+αn+1)−(βn−1+βn+1)bn=α−βαn(α−1+α)−βn(β−1+β)
Using α−1=−β and β−1=−α:
α−1+α=−β+α=α−β
β−1+β=−α+β=−(α−β)
Substituting these into the expression for bn:
bn=α−βαn(α−β)−βn(−(α−β))=α−β(αn+βn)(α−β)=αn+βn
This holds for n≥2. For n=1, we are given b1=1. Let's check our derived formula: α1+β1=1. So the formula bn=αn+βn is valid for all n≥1. This sequence represents the Lucas numbers Ln.
3. Evaluate the Options
Option B: bn=αn+βn for all n≥1
As shown above, this is correct.
Option C: a1+a2+a3+⋯+an=an+2−1 for all n≥1
This is a standard identity for Fibonacci numbers. Let's prove it using the explicit formula for ak.
∑k=1nak=∑k=1nα−βαk−βk=α−β1(∑k=1nαk−∑k=1nβk)
These are sums of geometric progressions:
∑k=1nαk=αα−1αn−1
∑k=1nβk=ββ−1βn−1
Since α−1=1/α and β−1=1/β (from α2−α−1=0⟹α−1=1/α):
∑k=1nαk=α1/ααn−1=α2(αn−1)=αn+2−α2
∑k=1nβk=β2(βn−1)=βn+2−β2
So, the sum is:
α−β1[(αn+2−α2)−(βn+2−β2)]=α−βαn+2−βn+2−α−βα2−β2=an+2−a2
Since a2=1, we have ∑k=1nak=an+2−1. This is correct.
Option D: n=1∑∞10nan=8910
Let S=∑n=1∞anxn with x=1/10. This is the generating function for an. Since an satisfies the recurrence an=an−1+an−2 for n≥3 with a1=1,a2=1, we have:
S(1−x−x2)=a1x+(a2−a1)x2=1⋅x+(1−1)x2=x.
So, S=1−x−x2x.
For x=1/10:
S=1−1/10−(1/10)21/10=1−1/10−1/1001/10=(100−10−1)/1001/10=89/1001/10=8910
This is correct.
Option A: n=1∑∞10nbn=898
Let T=∑n=1∞bnxn with x=1/10. We have bn=αn+βn. So:
T=∑n=1∞(αn+βn)xn=∑n=1∞(αx)n+∑n=1∞(βx)n
These are geometric series. For x=1/10, ∣αx∣<1 and ∣βx∣<1, so they converge.
T=1−αxαx+1−βxβx=(1−αx)(1−βx)αx(1−βx)+βx(1−αx)T=1−(α+β)x+αβx2αx−αβx2+βx−αβx2=1−(α+β)x+αβx2(α+β)x−2αβx2
Substituting α+β=1 and αβ=−1:
T=1−1⋅x+(−1)x21⋅x−2(−1)x2=1−x−x2x+2x2
For x=1/10:
T=1−1/10−1/1001/10+2(1/100)=89/10012/100=8912
The option states the sum is 8/89, which is incorrect.
Conclusion
Options B, C, and D are correct. Option A is incorrect.