You already met the parent topic : what ∑ means, the three algebra rules, Gauss's trick, and the "dominoes that cancel" idea of telescoping. This page does one thing: it throws every kind of sum at you and works each to the end, so you never meet a case in an exam you haven't already seen tamed.
Intuition The one question behind every example
Every summation problem is secretly asking: "Can I rewrite the general term as something I already know how to add?" The two rewrites are (a) split into standard formulas (linearity + ∑ k , ∑ k 2 , ∑ k 3 ) or (b) split into a difference f ( k ) − f ( k + 1 ) so it telescopes. That's the whole game. The matrix below just lists the disguises.
Here is the full menu of cases this topic can throw at you. Every cell is covered by a worked example below.
#
Case class
What makes it tricky
Example
A
Linear term ak + b
Just linearity + Gauss
Ex 1
B
Quadratic / cubic term
Needs ∑ k 2 , ∑ k 3
Ex 2
C
Gap-1 telescope k ( k + 1 ) 1
Neighbours cancel, 1 survivor each end
Ex 3
D
Gap-2 telescope k ( k + 2 ) 1
Delayed cancel, 2 survivors each end
Ex 4
E
Shifted lower limit (starts at m = 1 )
Must re-index or subtract a head
Ex 5
F
Limiting value n → ∞
Telescoping → convergence
Ex 6
G
Degenerate / empty & single-term
n < m gives 0 ; n = m gives one term
Ex 7
H
Real-world word problem
Translate story → Σ
Ex 8
I
Exam twist : -difference telescope
Rationalise to expose f ( k ) − f ( k + 1 )
Ex 9
J
Sign / alternating trap
( − 1 ) k is NOT a constant to pull out
Ex 10
k = 1 ∑ 30 ( 5 k − 4 ) .
Forecast: Guess the ballpark first. The terms run from 5 ( 1 ) − 4 = 1 up to 5 ( 30 ) − 4 = 146 , so ~30 terms averaging ~73 → around 2000 . Hold that thought.
Step 1. Split by linearity: ∑ k = 1 30 ( 5 k − 4 ) = 5 ∑ k = 1 30 k − ∑ k = 1 30 4 .
Why this step? ∑ distributes over + and − , and constants factor out — this turns one unfamiliar sum into two known pieces.
Step 2. ∑ k = 1 30 k = 2 30 ⋅ 31 = 465 .
Why this step? Gauss's formula ∑ k = 1 n k = 2 n ( n + 1 ) .
Step 3. ∑ k = 1 30 4 = 30 ⋅ 4 = 120 (a constant added 30 times).
Why this step? The rule ∑ k = 1 n c = n c .
Step 4. Combine: 5 ( 465 ) − 120 = 2325 − 120 = 2205 .
Verify: In the ballpark (≈ 2000 ) ✓. Cross-check via Arithmetic Progressions : an AP with first term 1 , last term 146 , 30 terms sums to 2 30 ( 1 + 146 ) = 15 ⋅ 147 = 2205 ✓.
k = 1 ∑ 10 ( k 3 − 2 k 2 + 3 ) .
Forecast: The k 3 dominates; at k = 10 that's 1000 , so the total is in the low thousands.
Step 1. Split: ∑ k 3 − 2 ∑ k 2 + ∑ 3 (all from k = 1 to 10 ).
Why this step? Linearity again — separate each power so a standard formula handles each.
Step 2. ∑ 1 10 k 3 = [ 2 10 ⋅ 11 ] 2 = 5 5 2 = 3025 .
Why this step? The cube formula [ 2 n ( n + 1 ) ] 2 .
Step 3. ∑ 1 10 k 2 = 6 10 ⋅ 11 ⋅ 21 = 385 , so − 2 ⋅ 385 = − 770 .
Why this step? The square formula 6 n ( n + 1 ) ( 2 n + 1 ) .
Step 4. ∑ 1 10 3 = 30 .
Step 5. Total: 3025 − 770 + 30 = 2285 .
Verify: Recompute smallest case as a sanity anchor — for n = 1 the term is 1 − 2 + 3 = 2 ; the formula pieces give 1 − 2 + 3 = 2 ✓, confirming the split is set up correctly.
k = 1 ∑ n k ( k + 1 ) 1 and give the value for n = 4 .
Forecast: Denominators grow fast, so later terms are tiny. The sum should creep toward but never reach 1 .
Step 1. Partial Fractions : write k ( k + 1 ) 1 = k A + k + 1 B . Clearing gives 1 = A ( k + 1 ) + B k ; setting k = 0 ⇒ A = 1 , k = − 1 ⇒ B = − 1 . So k ( k + 1 ) 1 = k 1 − k + 1 1 .
Why this step? This is exactly the shape f ( k ) − f ( k + 1 ) with f ( k ) = k 1 — the fuel for telescoping.
Step 2. Look at the figure below: each red tail cancels the next blue head.
Why this step? Seeing the cancellation prevents the classic error of thinking "nothing simplifies."
Step 3. By the telescoping formula ∑ k = 1 n [ f ( k ) − f ( k + 1 )] = f ( 1 ) − f ( n + 1 ) = 1 − n + 1 1 = n + 1 n .
Verify: For n = 4 : formula gives 5 4 = 0.8 . Add directly: 2 1 + 6 1 + 12 1 + 20 1 = 0.5 + 0.1 6 + 0.083 3 + 0.05 = 0.8 ✓. And it stays below 1 as forecast ✓.
k = 1 ∑ n k ( k + 2 ) 1 and give the value for n = 3 .
Forecast: The gap between factors is 2 , so a term won't cancel its immediate neighbour — it cancels the one two rows later . Expect two leftover heads and two leftover tails.
Step 1. Partial fractions: k ( k + 2 ) 1 = 2 1 ( k 1 − k + 2 1 ) .
Why this step? Now f ( k ) = k 1 but the shift is by 2 , so cancellation is delayed by one term.
Step 2. The figure shows which terms cancel and which survive.
Why this step? A gap-2 diagram makes "why two survivors" visible instead of memorised.
Step 3. Surviving heads: 1 1 + 2 1 . Surviving tails: − n + 1 1 − n + 2 1 . So
∑ k = 1 n k ( k + 2 ) 1 = 2 1 ( 1 + 2 1 − n + 1 1 − n + 2 1 ) = 2 1 ( 2 3 − n + 1 1 − n + 2 1 ) .
Verify: For n = 3 : formula gives 2 1 ( 2 3 − 4 1 − 5 1 ) = 2 1 ⋅ 20 30 − 5 − 4 = 2 1 ⋅ 20 21 = 40 21 = 0.525 . Direct: 3 1 + 8 1 + 15 1 = 0.3 3 + 0.125 + 0.0 6 = 0.525 ✓.
k = 5 ∑ 20 k ( k + 1 ) 1 .
Forecast: Same telescoping structure as Ex 3, but starting at k = 5 . Only the survivors change — heads move to f ( 5 ) .
Step 1. Use the general telescoping formula ∑ k = m n [ f ( k ) − f ( k + 1 )] = f ( m ) − f ( n + 1 ) with f ( k ) = k 1 , m = 5 , n = 20 .
Why this step? Never assume the lower limit is 1 . Here every interior term from k = 5 to 20 still cancels; only the first head f ( 5 ) and last tail f ( 21 ) remain.
Step 2. Value = f ( 5 ) − f ( 21 ) = 5 1 − 21 1 .
Step 3. Common denominator: 105 21 − 5 = 105 16 .
Verify (the re-index safety check): Compute instead as [whole from 1 to 20] minus [head from 1 to 4] : ( 1 − 21 1 ) − ( 1 − 5 1 ) = 5 1 − 21 1 = 105 16 ✓. Two routes agree — this guards against the [!mistake] of forgetting to move both limits when shifting the index.
Worked example To what value does
k = 1 ∑ n k ( k + 1 ) 1 tend as n → ∞ ?
Forecast: From Ex 3 the partial sum is n + 1 n , which is always just under 1 and climbing — so the limit smells like exactly 1 .
Step 1. Take the closed form S n = 1 − n + 1 1 .
Why this step? Telescoping gave us an exact partial sum — that's the gift that makes limits trivial (see Convergence of Series ).
Step 2. As n → ∞ , n + 1 1 → 0 .
Why this step? One-over-a-growing-number shrinks to nothing; the tail we subtract vanishes.
Step 3. Therefore k = 1 ∑ ∞ k ( k + 1 ) 1 = 1 − 0 = 1 .
Verify: S 100 = 101 100 ≈ 0.990 , S 1000 = 1001 1000 ≈ 0.999 — marching to 1 from below, never overshooting ✓.
Worked example Evaluate (a)
k = 1 ∑ 0 k 2 , (b) k = 7 ∑ 7 ( 3 k − 1 ) , (c) k = 1 ∑ n k ( k + 1 ) 1 at n = 1 .
Forecast: (a) upper limit below lower ⇒ nothing to add ⇒ 0 . (b) one lonely term. (c) should match a single fraction.
Step 1 (a). When n < m the sum is empty (the convention: an empty sum is 0 ).
Why this step? "Add all integers from 1 up to 0 " describes no integers, and the identity element of addition is 0 . Also the formula would give 6 0 ⋅ 1 ⋅ 1 = 0 , consistent.
Step 2 (b). ∑ k = 7 7 ( 3 k − 1 ) has exactly 7 − 7 + 1 = 1 term: 3 ( 7 ) − 1 = 20 .
Why this step? The count formula n − m + 1 still works and equals 1 ; only k = 7 is included.
Step 3 (c). ∑ k = 1 1 k ( k + 1 ) 1 = 1 ⋅ 2 1 = 2 1 ; the closed form n + 1 n = 2 1 agrees.
Why this step? Always sanity-test a closed form at the smallest legal n .
Verify: (a) = 0 ✓; (b) = 20 ✓; (c) = 0.5 matches 2 1 ✓.
Worked example A staircase-lighting art piece has lamp
k shining brightness k ( k + 3 ) 6 units, for lamps k = 1 to k = n . What is the total brightness, and its ceiling as more lamps are added forever?
Forecast: Gap between factors is 3 , so expect three survivors at each end. As n → ∞ the tails die, leaving a finite ceiling.
Step 1. Factor out and split: k ( k + 3 ) 6 = 6 ⋅ 3 1 ( k 1 − k + 3 1 ) = 2 ( k 1 − k + 3 1 ) .
Why this step? k ( k + d ) 1 = d 1 ( k 1 − k + d 1 ) ; here d = 3 .
Step 2. Gap-3 telescope: heads 1 1 + 2 1 + 3 1 survive; tails − n + 1 1 − n + 2 1 − n + 3 1 survive. So
Total = 2 ( 6 11 − n + 1 1 − n + 2 1 − n + 3 1 ) ,
since 1 + 2 1 + 3 1 = 6 6 + 3 + 2 = 6 11 .
Why this step? Three-step gap means the first three heads and last three tails never find a partner.
Step 3. As n → ∞ all three tails → 0 , giving ceiling 2 ⋅ 6 11 = 3 11 ≈ 3.667 units.
Verify: For a modest n = 3 : total = 2 ( 6 11 − 4 1 − 5 1 − 6 1 ) = 2 ⋅ 60 110 − 15 − 12 − 10 = 2 ⋅ 60 73 = 30 73 ≈ 2.433 ; direct 4 6 + 10 6 + 18 6 = 1.5 + 0.6 + 0.3 3 = 2.4 3 ✓. Below the ceiling 3.667 as expected ✓.
k = 1 ∑ n k + k + 1 1 and give the value for n = 8 .
Forecast: No obvious f ( k ) − f ( k + 1 ) ... until we make one. This is the classic "rationalise to reveal the telescope" twist.
Step 1. Multiply top and bottom by the conjugate k + 1 − k :
k + k + 1 1 ⋅ k + 1 − k k + 1 − k = ( k + 1 ) − k k + 1 − k = k + 1 − k .
Why this step? Rationalising turns a stubborn fraction into a clean difference g ( k + 1 ) − g ( k ) with g ( k ) = k . That is a telescope (run in the "+ then −" order).
Step 2. Sum: ∑ k = 1 n ( k + 1 − k ) = n + 1 − 1 = n + 1 − 1 .
Why this step? This is ∑ [ g ( k + 1 ) − g ( k )] = g ( n + 1 ) − g ( 1 ) — the telescoping formula with the sign flipped, so the last head and first tail survive.
Step 3. So the value is n + 1 − 1 .
Verify: For n = 8 : 9 − 1 = 3 − 1 = 2 . Direct sum of k + k + 1 1 for k = 1..8 equals 2 numerically ✓.
k = 1 ∑ 6 ( − 1 ) k k = − 1 + 2 − 3 + 4 − 5 + 6 .
Forecast: The pairs ( − 1 + 2 ) , ( − 3 + 4 ) , ( − 5 + 6 ) each give + 1 , and there are 3 pairs → 3 .
Step 1 (the trap). You may NOT pull ( − 1 ) k out of the sum: it is not a constant , it changes with k . Writing ( − 1 ) k ∑ k would be wrong.
Why this step? Only genuine constants (same value for every k ) factor out. ( − 1 ) k flips sign, so it stays inside.
Step 2. Group in consecutive pairs: ( − 1 + 2 ) + ( − 3 + 4 ) + ( − 5 + 6 ) = 1 + 1 + 1 .
Why this step? Each even term cancels the odd term just before it, leaving + 1 per pair — a bespoke telescoping-style cancellation.
Step 3. Total = 3 .
Verify: Direct: − 1 + 2 − 3 + 4 − 5 + 6 = 3 ✓. (General rule for n even: ∑ k = 1 n ( − 1 ) k k = 2 n ; here 2 6 = 3 ✓.)
Recall One-line summary of the whole matrix
Every sum is "rewrite the term into something addable." Polynomials → split into ∑ k , ∑ k 2 , ∑ k 3 . Fractions with factored denominators → partial fractions → telescope (gap d ⇒ d survivors each end). Roots → rationalise → telescope. Signs like ( − 1 ) k stay inside. Empty sums are 0 ; check closed forms at the smallest n ; take n → ∞ by killing the tail.
Gap-d telescope k ( k + d ) 1 leaves how many survivors each end? Exactly d .
What is an empty sum ∑ k = 1 0 a k equal to? 0 (the identity of addition).
How do you telescope k + k + 1 1 ? Rationalise with the conjugate →
k + 1 − k .
Can ( − 1 ) k be pulled out of a Σ? No — it varies with k , so it is not a constant.
Limit of ∑ k = 1 n k ( k + 1 ) 1 as n → ∞ ? 1 (since n + 1 n → 1 ).
Partial Fractions — the engine that creates every telescoping split here.
Method of Differences — Ex 3–5, 8, 9 are all instances of it.
Arithmetic Progressions — cross-check for the linear Ex 1.
Convergence of Series — Ex 6 and Ex 8's ceiling come straight from exact partial sums.
Mathematical Induction — how to prove the closed forms rigorously.
Binomial Theorem — where ( − 1 ) k sums like Ex 10 reappear.