Q.Evaluate k=1∑11(2+3k).
🔒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 — Sum Of Series
What Does "Sum of a Series" Even Mean?
Imagine you're standing at point 0 and you take a step of 1 metre forward. Then a step of half a metre. Then a quarter metre. Then an eighth. And you keep going, each step half the size of the previous one.
After 1 step: you're at 1 metre.
After 2 steps: at 1.5 metres.
After 3 steps: at 1.75 metres.
After 4 steps: at 1.875 metres.
After 5 steps: at 1.9375 metres.
You notice something: you're getting closer and closer to 2 metres, but you never quite reach it. If you could take infinitely many steps, would you ever get to exactly 2 metres? This is the heart of what a series is — adding up infinitely many numbers and asking: does this sum settle down to a finite value?
A series is just the sum of the terms of a sequence. If the sequence is a1,a2,a3,…, then the series is a1+a2+a3+….
The Precise Definition
Let’s formalise this. Suppose we have an infinite sequence of numbers:
a1,a2,a3,a4,…
We want to make sense of the infinite sum:
a1+a2+a3+a4+…
We can't just "add infinitely many things" directly — that's not a finite operation. So mathematicians do something clever: they look at partial sums.
Define:
S1=a1
S2=a1+a2
S3=a1+a2+a3
⋮
Sn=a1+a2+⋯+an
Sn is called the nth partial sum — it's the sum of the first n terms.
Now, the series is said to converge (or have a sum) if the sequence of partial sums S1,S2,S3,… approaches some finite number S as n gets larger and larger. In that case, we write:
∑k=1∞ak=S
If the partial sums don't settle down to a finite number — they either grow without bound or oscillate forever — the series diverges and has no finite sum.
∑k=1∞ak=limn→∞SnwhereSn=∑k=1nak
The Walking Example, Formalised
Our sequence of steps: 1,21,41,81,…
The partial sums:
S1=1
S2=1+21=1.5
S3=1+21+41=1.75
S4=1+21+41+81=1.875
You can prove (and we will later) that:
Sn=2−2n−11
As n→∞, 2n−11→0, so Sn→2. Therefore:
∑k=1∞2k−11=2
The infinite sum equals exactly 2 — even though you never "reach" it after any finite number of steps, the limit of the process is 2.
Two Classic Examples to Build Intuition
1. The Harmonic Series (Diverges)
1+21+31+41+51+…
This one is tricky. The terms get smaller and smaller, but the partial sums grow without bound — just very slowly. S100≈5.18, S1000≈7.48, S1000000≈14.39. It never stops growing. This series diverges.
Just because terms get smaller does NOT mean the series converges. The harmonic series is the classic counterexample.
2. A Geometric Series (Converges) …
Concept: Sum of series — split into two separate sums and use the geometric series formula.
The given sum can be separated:
∑k=111(2+3k)=∑k=1112+∑k=1113k
The first sum is simply 2×11=22.
For the second sum, we have a geometric series with first term a=31=3, common ratio r=3, and n=11 terms: …
Split by linearity: the constant part gives 22 and the geometric part ∑3k=2312−3=265,719, for a total of 265,741.
1. Separate the sum.
∑k=111(2+3k)=∑k=1112+∑k=1113k
2. Constant part.
∑k=1112=2×11=22
3. Geometric part (first term 3, ratio 3, 11 terms):
∑k=1113k=3⋅3−1311−1=2312−3 …
Showing the 12 most recent of 21 on this concept.
- AP EAPCET 2026Set eng-2026-05-12-AN1 markMCQQ.1.5+2.8+3.11+⋯ to n terms = (A) 2n(n+1)(2n+3) (B) 2n(n+1)(2n+1) (C) 3n(n+1)(n+2) (D) 3n(n+1)(n+3)
›Reveal solutionSolution
Each term is (position)×(an AP with first term 5, common difference 3); summing the resulting quadratic 3k2+2k gives 2n(n+1)(2n+3). Answer: (A).
Concept and Intuition
The series is 1⋅5+2⋅8+3⋅11+⋯. The first factor in each term is just the position k=1,2,3,…. The second factor is 5,8,11,…, an arithmetic progression with first term 5 and common difference 3, so its k-th term is 5+3(k−1)=3k+2. So the general term of the series is Tk=k(3k+2).
To sum n such terms, expand into a polynomial in k and use the standard sums ∑k=2n(n+1) and ∑k2=6n(n+1)(2n+1).
Step-by-Step Solution
- General term: Tk=k⋅(3k+2)=3k2+2k.
- Sum: Sn=∑k=1n(3k2+2k)=3∑k=1nk2+2∑k=1nk.
- ∑k2=6n(n+1)(2n+1), so 3∑k2=2n(n+1)(2n+1).
- ∑k=2n(n+1), so 2∑k=n(n+1). …
- AP EAPCET 2026Set eng-2026-05-13-FN1 markMCQQ.If 43+1615+6463+⋯n terms=256939, then 5n= (A) 55 (B) 20 (C) 15 (D) 35
›Reveal solutionSolution
The series is a sum of fractions of the form 22k22k−1=1−4k1. Summing n such terms gives n−31(1−4n1). Setting this equal to 256939 yields n=4, so 5n=20.
We are given:
43+1615+6463+⋯ to n terms=256939
and asked for 5n.
Concept and Intuition
Each term looks like a fraction close to 1. Notice:
- 43=1−41
- 1615=1−161
- 6463=1−641
The denominators are powers of 4: 41,42,43,…. So the k-th term is:
4k4k−1=1−4k1
Thus the sum of n terms is:
Sn=∑k=1n(1−4k1)=n−∑k=1n4k1
The second sum is a finite geometric series. This transforms the problem into simple algebra.
Step-by-step solution
-
Write the general term
The numerators are 3,15,63,… which are 4−1,16−1,64−1,… i.e. 4k−1 for k=1,2,3,….
So term Tk=4k4k−1=1−4k1.
-
Sum the series
Sn=∑k=1n(1−4k1)=n−∑k=1n4k1
- Sum the geometric series ∑k=1n4k1 is a geometric series with first term a=41, ratio r=41, and n terms.
∑k=1n4k1=1−4141(1−4n1)=4341(1−4n1)=31(1−4n1)
- Write the total sum
Sn=n−31(1−4n1)
- Set equal to given value
n−31(1−4n1)=256939
- Solve for n Multiply by 3:
3n−(1−4n1)=2562817
3n−1+4n1=2562817
3n+4n1=2562817+1=2563073
Now test small integer n: …
- AP EAPCET 2026Set eng-2026-05-14-AN1 markMCQQ.The sum Sn of the n terms of the series 12+2×22+32+2×42+52+2×62+⋯ is given by (A) Sn=2n2(n+1)2, n is even ; Sn=2n(n+1), n is odd (B) Sn=2n(n2+1), n is even ; Sn=2n2(n+1), n is odd (C) Sn=2n(n+1)2, n is even ; Sn=2n2(n+1), n is odd (D) Sn=2n2(n2+1), n is even ; Sn=2n(n+1)2, n is odd
›Reveal solutionSolution
The series alternates between a square and twice the next square; by grouping pairs and handling the odd‑term case separately, we derive closed forms that match option (C).
Concept and Intuition
The series is:
12+2⋅22+32+2⋅42+52+2⋅62+⋯
Notice the pattern:
- Terms at odd positions (1st, 3rd, 5th, …) are just squares: 12,32,52,…
- Terms at even positions (2nd, 4th, 6th, …) are twice the square of the even number: 2⋅22,2⋅42,2⋅62,…
So the series is not a simple sum of squares — it’s a hybrid. The natural approach is to group terms in pairs (odd + even) because each pair has a neat structure. Then we handle the case when n is odd separately (since the last term will be an unpaired odd‑position square).
Step‑by‑Step Derivation
1. Write the general term
Let the k-th pair be (2k−1)2 (odd) and 2⋅(2k)2 (even).
So the k-th pair sum is:
Pk=(2k−1)2+2⋅(2k)2
2. Simplify the pair sum
Pk=(4k2−4k+1)+2⋅(4k2)=4k2−4k+1+8k2=12k2−4k+1
3. Sum for n even
If n is even, say n=2m, then we have exactly m complete pairs. So:
S2m=∑k=1m(12k2−4k+1)
Use standard formulas:
∑k=1mk2=6m(m+1)(2m+1),∑k=1mk=2m(m+1),∑k=1m1=m
Thus:
S2m=12⋅6m(m+1)(2m+1)−4⋅2m(m+1)+m=2m(m+1)(2m+1)−2m(m+1)+m
Factor m out:
S2m=m[2(m+1)(2m+1)−2(m+1)+1]
Simplify inside:
2(m+1)(2m+1)−2(m+1)+1=2(m+1)(2m+1−1)+1=2(m+1)(2m)+1=4m(m+1)+1
So:
S2m=m(4m(m+1)+1)=4m2(m+1)+m
Now replace m=n/2:
Sn=4(2n)2(2n+1)+2n=4⋅4n2⋅2n+2+2n=2n2(n+2)+2n=2n(n(n+2)+1)
Simplify:
n(n+2)+1=n2+2n+1=(n+1)2
Hence:
Sn=2n(n+1)2for n even
4. Sum for n odd
If n is odd, say n=2m+1, then we have m complete pairs plus one extra term: the (2m+1)-th term, which is an odd‑position square: (2m+1)2.
So:
S2m+1=S2m+(2m+1)2
We already have S2m=4m2(m+1)+m. Add (2m+1)2=4m2+4m+1:
- AP EAPCET 2026Set eng-2026-05-14-AN1 markMCQQ.n→∞limn51+24+34+⋯+n4−n→∞limn51+23+33+⋯+n3= (A) 51 (B) 41 (C) 201 (D) 0
›Reveal solutionSolution
Both limits are Riemann-sum-style power-sum limits; the k4 sum grows like n5/5 giving 1/5, while the k3 sum only grows like n4, so dividing by n5 sends the second limit to 0 — the answer is 1/5.
Concept and Intuition
A sum ∑k=1nkp grows like p+1np+1 for large n (this is exactly the Riemann-sum statement np+11∑kp→∫01xpdx=p+11). Dividing by n5 picks out only the p=4 sum as contributing a finite nonzero limit; the p=3 sum, being one power of n smaller, vanishes in the same limit.
Step-by-Step Solution
- Recognize n→∞limn514+24+⋯+n4=n→∞limn1k=1∑n(nk)4=∫01x4dx=51.
- Recognize n→∞limn513+23+⋯+n3=n→∞limn21⋅n1k=1∑n(nk)3=n→∞limn21∫01x3dx=n→∞lim4n21=0. …
- AP EAPCET 2026Set eng-2026-05-13-AN1 markMCQQ.For all n∈N, a(a+d)1+(a+d)(a+2d)1+(a+2d)(a+3d)1+⋯ upto n terms = (A) a+dnd (B) a(a+nd)nd (C) a(a+nd)n (D) a+ndd
›Reveal solutionSolution
The sum telescopes when each term is rewritten as a difference of two simpler fractions. The final result is a(a+nd)n, which corresponds to option (C).
Concept and Intuition (Sum of Series)
When you see a sum of fractions whose denominators are products of terms in arithmetic progression — like a(a+d), (a+d)(a+2d), etc. — your first instinct should be telescoping.
The trick: each term can be split into a difference of two fractions whose denominators are the two factors. Then, when you add them up, most terms cancel, leaving only the first and last.
Here, the general term is (a+(k−1)d)(a+kd)1. Notice that:
(a+(k−1)d)(a+kd)1=d1(a+(k−1)d1−a+kd1)
Why? Because if you combine the right-hand side over a common denominator, you get exactly the left-hand side. This is the classic partial-fraction decomposition for such products.
Step-by-step solution
- Write the sum explicitly The series is:
Sn=a(a+d)1+(a+d)(a+2d)1+(a+2d)(a+3d)1+⋯+(a+(n−1)d)(a+nd)1
There are n terms, and the last denominator uses a+(n−1)d and a+nd.
- Decompose each term For any integer k from 1 to n, the k-th term is:
(a+(k−1)d)(a+kd)1=d1(a+(k−1)d1−a+kd1)
This is verified by cross-multiplying:
d1((a+(k−1)d)(a+kd)a+kd−(a+(k−1)d))=d1⋅(a+(k−1)d)(a+kd)d=(a+(k−1)d)(a+kd)1
- Write the sum using the decomposition
Sn=d1[(a1−a+d1)+(a+d1−a+2d1)+⋯+(a+(n−1)d1−a+nd1)]
- Observe the telescoping cancellation …
- AP EAPCET 2026Set eng-2026-05-18-FN1 markMCQQ.−1+107⋅22−10⋅157⋅9⋅23+10⋅15⋅207⋅9⋅11⋅24−⋯∞= (A) (8125)1/5 (B) 243255 (C) (2581)1/5 (D) 255243
›Reveal solutionSolution
The alternating series with those specific factorial-style numerators/denominators and increasing powers of 2 is a generalised binomial series in disguise; summing it in closed form gives (5/9)5/2=255/243.
Concept and Intuition
Series whose terms have numerators like 7⋅9⋅11⋯ and denominators like 10⋅15⋅20⋯ are built from the generalised binomial coefficients that appear in expansions such as (1−x)−n=∑kk!n(n+1)(n+2)⋯(n+k−1)xk. Recognising the pattern (numerator steps of 2, denominator steps of 5) points to an underlying exponent of n=7/2, and the extra (k+1)!1-type factor (compared to a plain binomial term) signals that this is the integral of a (1−x)−7/2 series, which integrates cleanly to a (1−x)−5/2 expression.
Step-by-Step Solution
- Write the general term (for k≥1) of the series (ignoring sign) as ∏i=0k−1(10+5i)∏i=0k−1(7+2i)⋅2k+1.
- Factor out constants: ∏(7+2i)=2k(27)k and ∏(10+5i)=5k(k+1)!, where (27)k is the rising factorial from 7/2.
- This shows the series is −2∑k≥0yk(k+1)!(7/2)k for a suitable y=−4/5, i.e. essentially the term-by-term integral of the binomial series for (1−x)−7/2. …
- AP EAPCET 2025Set eng-2025-05-21-FN1 markMCQQ.If (1+x)n=r=0∑nCrxr, then the value of C0+(C0+C1)+(C0+C1+C2)+…+(C0+C1+C2+…+Cn) is (A) n2n−1 (B) 2n+n (C) (n+2)2n (D) (n+2)2n−1
›Reveal solutionSolution
Swapping the order of a double summation turns the nested partial-sum expression into a single sum weighted by (n−r+1), which collapses using the two standard binomial identities ∑Cr=2n and ∑rCr=n2n−1 to give (n+2)2n−1.
Concept and Intuition
The expression C0+(C0+C1)+(C0+C1+C2)+…+(C0+…+Cn) is a sum of partial sums of the binomial coefficients. Rather than summing partial sums directly, it's far cleaner to ask: 'how many times does each individual Cr get counted across all these partial sums?' — this reframes a nested sum as a single weighted sum, which then falls to two well-known binomial identities.
Step-by-Step Solution
- Define Sk=∑r=0kCr (the k-th partial sum). We want S=∑k=0nSk.
- Swap the order of summation: S=∑k=0n∑r=0kCr=∑r=0nCr⋅#{k:r≤k≤n}.
- For fixed r, the number of valid k (with k ranging from r to n) is (n−r+1). So S=∑r=0n(n−r+1)Cr.
- Split this: S=(n+1)∑r=0nCr−∑r=0nrCr.
- Use the standard identities: ∑r=0nCr=2n (sum of a row of Pascal's triangle) and ∑r=0nrCr=n⋅2n−1 (a classic identity, provable by differentiating (1+x)n and setting x=1).
- Substitute: S=(n+1)2n−n⋅2n−1=2n−1[2(n+1)−n]=2n−1(2n+2−n)=2n−1(n+2). …
- AP EAPCET 2025Set eng-2025-05-22-AN1 markMCQQ.k=1∑nk(k+1)(k+2)…(k+r−1)= (A) r+1n(n+1)(n+2)…(n+r) (B) rn(n+1)(n+2)…(n+r−1) (C) r+1n(n+1)(n+2)…(n+r+1) (D) 2n+1n(n+1)(n+2)…2n
›Reveal solutionSolution
Summing k(k+1)⋯(k+r−1) from 1 to n telescopes to r+1n(n+1)⋯(n+r) — option (A).
Concept and Intuition
A product of r consecutive integers starting at k behaves like a discrete analogue of xr, and just as ∫xrdx=r+1xr+1, there is a discrete 'antidifference' for such falling-factorial-type products: k(k+1)⋯(k+r−1) is (up to the constant r+11) the first difference of k(k+1)⋯(k+r). This lets the whole sum collapse (telescope) instead of needing to expand and sum power series term by term.
Step-by-Step Solution
- Define Tk=k(k+1)(k+2)⋯(k+r−1), the general term.
- Consider Uk=k(k+1)(k+2)⋯(k+r) (one factor more, up to k+r) and Uk−1=(k−1)k(k+1)⋯(k+r−1).
- Compute Uk−Uk−1=k(k+1)⋯(k+r−1)[(k+r)−(k−1)]=k(k+1)⋯(k+r−1)⋅(r+1)=(r+1)Tk.
- So Tk=r+1Uk−Uk−1, and summing from k=1 to n telescopes: ∑k=1nTk=r+1Un−U0.
- U0=0⋅1⋯r=0 (it contains the factor 0), so ∑k=1nTk=r+1Un=r+1n(n+1)(n+2)⋯(n+r). …
- AP EAPCET 2025Set eng-2025-05-23-AN1 markMCQQ.1+154+15.304.10+15.30.454.10.16+…∞= (A) (53)2/3 (B) (35)2/3 (C) (53)3/2 (D) (35)3/2
›Reveal solutionSolution
This tests recognizing a series as a generalized binomial expansion (1−x)−p by matching the ratio of consecutive terms. Answer: (35)2/3.
Concept and Intuition
The generalized binomial theorem gives (1−x)−p=1+px+2!p(p+1)x2+3!p(p+1)(p+2)x3+⋯, whose n-th to (n−1)-th term ratio is np+n−1x. Many exam series with steadily-incrementing numerator/denominator factors are exactly this expansion in disguise; the trick is to compute the term ratio and match it to np+n−1x.
Step-by-Step Solution
- Terms: t1=154, t2=15⋅304⋅10, t3=15⋅30⋅454⋅10⋅16. The numerator factors increase by 6 each time (4,10,16,…) and the denominator factors are multiples of 15 (15,30,45,…).
- The ratio of the n-th term to the (n−1)-th term is 15n4+6(n−1)=15n6n−2. …
- AP EAPCET 2025Set eng-2025-05-26-AN1 markMCQQ.3⋅51+5⋅71+7⋅91+… to 24 terms = (A) 14723 (B) 356 (C) 376 (D) 518
›Reveal solutionSolution
This is a telescoping series; splitting each term by partial fractions collapses the 24-term sum to 518.
Concept and Intuition
Terms of the form (2n+1)(2n+3)1 split into a difference of two simpler fractions differing by a fixed "step" (here, from 2n+11 to 2n+31). When you sum consecutive terms, the middle values cancel in pairs (telescoping), leaving only the very first and very last pieces.
Step-by-Step Solution
- Write the series as n=1∑24(2n+1)(2n+3)1, since the terms are 3⋅51,5⋅71,7⋅91,… (i.e. n=1,2,3,…).
- Partial fractions: (2n+1)(2n+3)1=21(2n+11−2n+31).
- Sum telescopes: 21[(31−51)+(51−71)+⋯+(491−511)]=21(31−511) …
- AP EAPCET 2025Set eng-2025-05-26-FN1 markMCQQ.If Sn=13+23+…+n3 and Tn=1+2+…+n, then (A) Sn=Tn3 (B) Sn=Tn3 (C) Sn=Tn2 (D) Sn=Tn2
›Reveal solutionSolution
This is the standard identity that the sum of the first n cubes equals the square of the sum of the first n natural numbers: Sn=Tn2.
Concept and Intuition
Tn=1+2+⋯+n=2n(n+1) is the familiar sum of the first n natural numbers. There is a classical, easily-verified identity that the sum of the first n cubes equals the square of this same sum: 13+23+⋯+n3=(1+2+⋯+n)2. This can be seen directly from the standard closed form Sn=(2n(n+1))2=Tn2.
Step-by-Step Solution
- Recall the standard formula: Sn=k=1∑nk3=(2n(n+1))2.
- Recall Tn=k=1∑nk=2n(n+1).
- Substitute: Sn=(Tn)2=Tn2.
- Quick numeric check with n=3: T3=1+2+3=6, T32=36; and S3=13+23+33=1+8+27=36. Matches, confirming Sn=Tn2. …
- AP EAPCET 2024Set eng-2024-05-19-AN1 markMCQQ.1−32+3.62.4−3.6.92.4.6+⋯∞= (A) 53 (B) (52)2/3 (C) 52 (D) (53)2/3
›Reveal solutionSolution
This series looks like a generalized binomial expansion but each term actually collapses to a plain geometric ratio; the sum is 53.
Concept and Intuition
Numerator of the n-th term is 2⋅4⋅6⋯(2n)=2nn! and the denominator is 3⋅6⋅9⋯(3n)=3nn!. The n! cancels, leaving exactly (32)n — a clean geometric progression, not a fractional-power binomial series as the answer choices might suggest.
Step-by-Step Solution
- Term 0: 1. Term 1: 32. Term 2: 3⋅62⋅4=188=94=(32)2. Term 3: 3⋅6⋅92⋅4⋅6=16248=278=(32)3.
- So the series is ∑n=0∞(−1)n(32)n, a geometric series with first term a=1 and common ratio r=−32.
- Since ∣r∣<1, it converges to S=1−ra=1−(−2/3)1=5/31=53. …
🎓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.