Unit 6
Algebra
Class 12 Mathematics
Sequence and Series
Class 12 Mathematics – Sequence and Series Notes PDF
On mobile, swipe inside the PDF to read all pages and pinch to zoom.
Contents / Quick Navigation
NEB / CDC Focus
For this Class 12 unit, the central results are the sums of the first n natural numbers, their squares and their cubes, together with the principle of mathematical induction and its use in proving finite-sum identities.
1. Sequence and Series
A sequence is an ordered list of numbers or terms: a₁,a₂,a₃,….
A series is obtained by adding the terms of a sequence: a₁+a₂+a₃+….
The Class 12 unit does not require a fresh treatment of arithmetic and geometric progressions here. The focus is on standard finite sums and mathematical induction.
2. Sum of the First n Natural Numbers
Let
S=1+2+3+…+(n−1)+n.
Write the same sum in reverse:
S=n+(n−1)+(n−2)+…+2+1.
Adding term by term:
2S=(n+1)+(n+1)+…+(n+1).
There are n equal terms on the right, so
Find 1+2+3+…+100.
S=100(101)/2=5050.
2.1 Sum from m to n
For positive integers m≤n,
3. Sum of the Squares of the First n Natural Numbers
This formula can be proved by mathematical induction. It is also useful in statistics, coordinate geometry and algebraic simplification.
Find 1²+2²+…+20².
S=20(21)(41)/6=2870.
3.1 Sum of Squares from m to n
Subtract the sum through m−1 from the sum through n:
4. Sum of the Cubes of the First n Natural Numbers
Thus the sum of the first n cubes is exactly the square of the sum of the first n natural numbers:
1³+2³+…+n³ = (1+2+…+n)².
Find 1³+2³+…+10³.
S=[10(11)/2]²=55²=3025.
5. Principle of Mathematical Induction
Suppose P(n) is a statement about positive integers. To prove P(n) for every positive integer n, it is sufficient to show:
- Base step: P(1) is true.
- Inductive step: whenever P(k) is true, P(k+1) is also true.
The assumption that P(k) is true is called the induction hypothesis.
5.1 Standard Proof Structure
- State the proposition P(n).
- Verify it for the initial value, usually n=1.
- Assume P(k) is true for an arbitrary positive integer k.
- Start the left side of P(k+1).
- Use the induction hypothesis to replace the part through k.
- Simplify until the right side becomes exactly the formula with n=k+1.
- Conclude that the statement holds for all positive integers.
You may assume only P(k), not the statement you are trying to prove for k+1. The inductive step must genuinely derive P(k+1) from the induction hypothesis.
6. Proving Standard Sums by Mathematical Induction
6.1 Proof of 1+2+…+n=n(n+1)/2
Base case: For n=1,
LHS=1, RHS=1(2)/2=1.
Induction hypothesis: Assume for n=k,
1+2+…+k=k(k+1)/2.
For n=k+1:
1+2+…+k+(k+1) = k(k+1)/2+(k+1)
=(k+1)(k+2)/2.
This is exactly the required formula with n=k+1. Hence the formula holds for all positive integers.
6.2 Proof of the Sum of Squares
Base case: For n=1, both sides equal 1.
Assume
1²+2²+…+k²=k(k+1)(2k+1)/6.
Then
1²+2²+…+k²+(k+1)² = k(k+1)(2k+1)/6+(k+1)².
Factor k+1:
=(k+1)[k(2k+1)+6(k+1)]/6
=(k+1)(2k²+7k+6)/6
=(k+1)(k+2)(2k+3)/6.
Since 2k+3=2(k+1)+1, this is precisely the formula for k+1.
6.3 Proof of the Sum of Cubes
Base case: At n=1, both sides equal 1.
Assume
1³+2³+…+k³=[k(k+1)/2]².
Then
1³+2³+…+k³+(k+1)³ = k²(k+1)²/4+(k+1)³.
Factor:
=(k+1)²[k²/4+(k+1)]
=(k+1)²(k²+4k+4)/4
=(k+1)²(k+2)²/4 = [(k+1)(k+2)/2]².
Thus the formula is true for all positive integers.
7. Applications of the Standard Sums
7.1 Sums Containing Linear Expressions
Find Σk=1n(3k+2).
=3Σk+2Σ1 =3[n(n+1)/2]+2n.
=n(3n+7)/2.
7.2 Sums Containing Quadratic Expressions
For a polynomial such as Ak²+Bk+C, split the sum:
Find Σk=1n(2k²+3k+1).
=2[n(n+1)(2n+1)/6] +3[n(n+1)/2] +n.
The expression may then be simplified according to the form required in the question.
7.3 Odd and Even Number Sums
These identities follow directly from the natural-number sum and are also excellent practice statements for mathematical induction.
8. Worked Examples
Find 25+26+…+100.
=[1+2+…+100]−[1+2+…+24]
=100(101)/2−24(25)/2 =5050−300 =4750.
Find 6²+7²+…+15².
=15(16)(31)/6−5(6)(11)/6
=1240−55=1185.
Evaluate 3³+4³+…+12³.
=[1³+…+12³]−[1³+2³]
=[12(13)/2]²−[2(3)/2]² =78²−3² =6084−9 =6075.
Prove 1+3+5+…+(2n−1)=n².
Base: At n=1, 1=1².
Assume: 1+3+…+(2k−1)=k².
Then:
1+3+…+(2k−1)+[2(k+1)−1] =k²+(2k+1) =(k+1)².
Hence the result is true for every positive integer n.
Prove that 7ⁿ−1 is divisible by 6 for all positive integers n.
Base: 7¹−1=6, divisible by 6.
Assume: 7ᵏ−1=6m for some integer m.
Then
7k+1−1 =7·7ᵏ−1 =7(7ᵏ−1)+6 =7(6m)+6 =6(7m+1).
Thus it is divisible by 6.
If 1+2+…+n=210, find n.
n(n+1)/2=210 ⇒ n²+n−420=0.
(n−20)(n+21)=0.
Since n is positive, n=20.
Find Σk=1n(k²+k).
=Σk²+Σk =n(n+1)(2n+1)/6+n(n+1)/2.
=n(n+1)[(2n+1)+3]/6 =n(n+1)(n+2)/3.
For n=5,
1³+2³+3³+4³+5³=1+8+27+64+125=225.
[5(6)/2]²=15²=225.
The two sides agree.
9. Problem-Solving Strategy
- Identify whether the sum involves k, k², or k³.
- For a range beginning above 1, use “sum through n minus sum through m−1”.
- Split polynomial sums using linearity: Σ(Ak²+Bk+C)=AΣk²+BΣk+CΣ1.
- In induction, write the base case explicitly.
- State the induction hypothesis exactly before proving P(k+1).
- When proving a sum identity, begin the k+1 case by adding the next term to the sum through k.
- Factor aggressively in the inductive step so the result takes the required k+1 form.
- Do a quick numerical check for a small value of n to catch algebraic errors.
10. Common Mistakes and Warnings
The formula is n(n+1)(2n+1)/6, not divided by 2 or 3.
Σk³=[n(n+1)/2]².
For a sum from m to n, subtract the sum through m−1, not through m.
An induction proof is incomplete without verifying the starting value.
The induction hypothesis is P(k); P(k+1) must be proved.
For a finite sum, the k+1 case is the sum through k plus the new (k+1) term.
Use the starting integer specified by the proposition.
Checking several numerical cases supports a pattern but does not replace mathematical induction.
11. Exam-Important Formula Sheet
12. Important Exam Questions
Short-Answer Questions
- Define a sequence and a series.
- State the formula for 1+2+…+n.
- State the formula for 1²+2²+…+n².
- State the formula for 1³+2³+…+n³.
- State the principle of mathematical induction.
- What is an induction hypothesis?
- Find the sum of the first n even natural numbers.
- Find the sum of the first n odd natural numbers.
Derivation / Proof Questions
- Derive 1+2+…+n=n(n+1)/2 by the pairing method.
- Prove by mathematical induction that 1+2+…+n=n(n+1)/2.
- Prove by mathematical induction that 1²+2²+…+n²=n(n+1)(2n+1)/6.
- Prove by mathematical induction that 1³+2³+…+n³=[n(n+1)/2]².
- Use induction to prove a supplied finite-sum identity.
- Use induction to prove a simple divisibility statement valid for all positive integers.
Numerical / Application Questions
- Evaluate a finite sum of consecutive natural numbers.
- Evaluate a finite range of squares or cubes.
- Find n when a standard finite sum is given.
- Evaluate a polynomial sum involving k and k².
- Use the standard formulas to simplify a finite summation.
Diagram / Concept Questions
- Use a pairing diagram to explain the sum of the first n natural numbers.
- Use the domino idea to explain the principle of mathematical induction.
- Use a square-building diagram to explain 1+3+5+…+(2n−1)=n².
13. One-Minute Revision
- A sequence is an ordered list; a series is the sum of sequence terms.
- 1+2+…+n=n(n+1)/2.
- 1²+2²+…+n²=n(n+1)(2n+1)/6.
- 1³+2³+…+n³=[n(n+1)/2]².
- The cube sum is the square of the natural-number sum.
- For a sum from m to n, subtract the sum through m−1.
- 1+3+…+(2n−1)=n².
- 2+4+…+2n=n(n+1).
- Mathematical induction requires a base case.
- The induction hypothesis assumes P(k) for an arbitrary positive integer k.
- The inductive step must prove P(k+1).
- For finite-sum induction, add the next term to the result through k.
- Checking a few values is not a proof for all natural numbers.
- Standard sum formulas are especially useful for polynomial summations.
- Always simplify the final inductive expression into the exact required k+1 form.
14. Diagram Practice
- Sequence versus series concept diagram.
- Pairing method for 1+2+…+n.
- Square-number array illustrating 1²+2²+…+n².
- Identity map for the sum of cubes.
- Domino analogy for mathematical induction.
- Mathematical induction proof flowchart.
- Formula map for sums of k, k² and k³.
- Odd-number square-building diagram.
Also Visit
Original Nepal eNotes page: Class 12 Mathematics Sequence and Series Notes.
Discussion
Share a helpful question, idea, or explanation with other students.