Q.If tn denotes the nth term of the series 2+3+6+11+18+… then t50 is
(A) 492−1
(B) 492
(C) 502+1
(D) 492+2
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Sequence Term Evaluation
Sequence Term Evaluation
Picture a staircase where the height of each step follows a rule: step 1 is 1 unit high, step 2 is 4 units, step 3 is 9 units, step 4 is 16 units. The pattern is height = (step number)2. If someone asks for the height of step 20, you don't climb up counting -- you compute 202=400 directly. That single act of substitution is what sequence term evaluation means.
The Core Idea
A sequence is an ordered list of numbers, and each number is called a term. Its position -- first, second, third, ... -- is the index, usually written n (starting at n=1 unless told otherwise). The term at position n is written an.
Think of the sequence as a machine: feed it an index n, and it returns the term an.
- Input n=1 -> output a1=12=1
- Input n=2 -> output a2=22=4
- Input n=10 -> output a10=102=100
You are not solving anything here -- you are purely substituting a number into a formula and simplifying.
The Precise Statement
an=f(n)
A sequence defined this way is a function whose domain is the positive integers. Evaluating a term means computing f(n) for one specific value of n.
Example 1 -- sequence an=3n+2:
a1=3(1)+2=5,a2=3(2)+2=8,a5=3(5)+2=17
Example 2 -- sequence an=n(−1)n:
a1=1(−1)1=−1,a2=2(−1)2=21,a3=3(−1)3=−31
A common mistake is confusing the index with the term's value. For an=2n, the 5th term is a5=2×5=10 -- the index n=5 only tells you which term to compute, while 10 is the value sitting at that position. Writing a5=5 mixes up the position number with the answer; always finish the substitution before reading off the result.
Quick Check
Given an=n+1n2−1, find a4.
a4=4+142−1=516−1=515=3 …
Concept: Finding the general term by examining differences between consecutive terms.
Write out the series and compute first differences:
2,3,6,11,18,…
1,3,5,7,…
The first differences form an arithmetic progression of odd numbers. The second differences are constant (equal to 2), confirming tn is quadratic in n.
For a quadratic sequence with constant second difference 2, we have tn=an2+bn+c where 2a=2, so a=1.
Using initial terms:
- t1=2: 1+b+c=2⟹b+c=1 …
The successive differences are 1,3,5,7,… (odd numbers), giving tn=2+(n−1)2, so t50=492+2 — option (D).
For the series 2+3+6+11+18+…, the first differences are
3−2=1,6−3=3,11−6=5,18−11=7,
i.e. the consecutive odd numbers 1,3,5,7,…
Building up the nth term from the first:
tn=t1+∑k=1n−1(2k−1)=2+(n−1)2, …
- KCET 2025Set A-11 markMCQQ.If A is a square matrix of order 3×3, detA=3, then the value of det(3A−1) is (A) 31 (B) 3 (C) 27 (D) 9
›Reveal solutionSolution
Pull the scalar 3 out of a 3×3 matrix as 33, then use det(A−1)=1/detA.
Step 1 — The two properties needed.
For a square matrix of order n and a scalar k:
det(kA)=kndet(A).
The exponent is n, not 1, because multiplying the matrix by k scales every one of the n rows by k, and each row-scaling multiplies the determinant by k once.
Second, from AA−1=I and the multiplicative property det(AB)=detAdetB:
det(A)⋅det(A−1)=det(I)=1⟹det(A−1)=detA1.
Step 2 — Apply with n=3, k=3.
det(3A−1)=33⋅det(A−1)=27⋅detA1.
Step 3 — Substitute detA=3.
det(3A−1)=27⋅31=9. …
- KCET 2022Set C-41 markMCQQ.If A=[23−1−2], then the inverse of the matrix A3 is (A) −1 (B) 1 (C) −A (D) A
›Reveal solutionSolution
The key idea is that A is its own inverse (A2=I), so A3=A, and its inverse is A itself. The correct option is (D).
We start with the matrix
A=[23−1−2].
The question asks for the inverse of A3. Instead of computing A3 directly and then finding its inverse, we can look for a pattern — often such matrices have a simple property.
- Check if A is involutory — that is, whether A2=I. Compute A2:
A2=A⋅A=[23−1−2][23−1−2].
Multiply:
- First row, first column: 2⋅2+(−1)⋅3=4−3=1.
- First row, second column: 2⋅(−1)+(−1)⋅(−2)=−2+2=0.
- Second row, first column: 3⋅2+(−2)⋅3=6−6=0.
- Second row, second column: 3⋅(−1)+(−2)⋅(−2)=−3+4=1.
So
A2=[1001]=I.
ImportantA2=I means A is its own inverse: A−1=A.
- Now find A3. Since A2=I, we have
A3=A2⋅A=I⋅A=A.
So A3 is simply A itself. …
- COMEDK 2022Set 20221 markMCQQ.If Un+1=3Un−2Un−1 and U0=2,U1=3, then Un is equal to (A) 1−2n (B) 2n+1 (C) 2n−1 (D) 2n+2
›Reveal solutionSolution
Check: U(2) = 3(3) − 2(2) = 5 = 2² + 1 ✓; U(3) = 3(5) − 2(3) = 9 = 2³ + 1 ✓.
Concept: Linear homogeneous recurrence with constant coefficients — solve via the characteristic equation.
U(n+1) = 3U(n) − 2U(n−1) → characteristic equation x² = 3x − 2, i.e. x² − 3x + 2 = 0 → (x−1)(x−2) = 0 → x = 1, 2.
So U(n) = A·1ⁿ + B·2ⁿ = A + B·2ⁿ.
Apply initial conditions:
U(0) = A + B = 2
U(1) = A + 2B = 3 …
- KCET 2020Set A-11 markMCQQ.If a1,a2,a3,.......,a9 are in A.P. then the value of a1a4a7a2a5a8a3a6a9 is (A) 29(a1+a9) (B) a1+a9 (C) loge(logee) (D) 1
›Reveal solutionSolution
Consecutive terms of an A.P. make the three rows linearly dependent (R1+R3=2R2), forcing the determinant to be 0 — and the only option equal to 0 is loge(logee).
Step 1 — Write the terms of the A.P.
Let the first term be a and the common difference be d. Then ak=a+(k−1)d, so the determinant is
Δ=aa+3da+6da+da+4da+7da+2da+5da+8d
Step 2 — Spot the row dependence.
Add row 1 and row 3, element by element:
R1+R3=(2a+6d,2a+8d,2a+10d)
and double row 2:
2R2=(2a+6d,2a+8d,2a+10d)
These are identical:
R1+R3=2R2
This is just the A.P. property in row form — the middle row is the average of the outer two, exactly as a5 is the average of a2 and a8, etc.
Step 3 — Conclude the determinant is zero.
Apply the row operation R1→R1+R3−2R2 (a determinant is unchanged by adding a linear combination of other rows to a row):
Δ=0a+3da+6d0a+4da+7d0a+5da+8d=0
A determinant with an all-zero row is zero. (Equivalently: the rows are linearly dependent, so the matrix is singular.)
Δ=0
Step 4 — Which option equals 0?
Evaluate each: …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.