📚 Reasoning Ability – Series
Target Audience: Nagaland Police Sub‑Inspector (SI) Exam
Depth: MIT‑level (first principles, rigorous proofs, advanced theory)
Format: Markdown study notes – definitions, theorems, proofs, edge cases, strategies, examples, and a challenging problem.
1. Overview
A series is the sum of the terms of a sequence.
Mathematically, for a sequence ((a_n)_{n=1}^{\infty}),
[ S_N = \sum_{n=1}^{N} a_n ,\qquad S = \sum_{n=1}^{\infty} a_n = \lim_{N\to\infty} S_N ]
The finite sum (S_N) is called a partial sum; the limit (if it exists) is the sum of the series.
In reasoning‐ability exams participants must:
- Identify the pattern that generates the sequence.
- Predict the next term or the sum of first (N) terms.
- Detect hidden series (e.g. Fibonacci, primes, triangular numbers).
- Spot trick patterns (alternating signs, factorial growth, etc.).
The notes below start from the ground up and build up to the sharpest tools used by researchers in analysis and combinatorics.
2. Fundamental Definitions
| Symbol | Meaning | Example |
|---|---|---|
| (a_n) | (n)-th term of a sequence | (a_n = 2n-1) (odd numbers) |
| (S_N) | Partial sum of first (N) terms | (S_N = 1+3+5+\dots+(2N-1)=N^2) |
| (\lim_{N\to\infty} S_N) | Sum of infinite series | (\sum_{n=1}^{\infty} \frac1{2^n} = 1) |
Key concepts
- Convergence – the limit exists and is finite.
- Divergence – the limit does not exist or is infinite.
- Absolute convergence – (\sum |a_n|) converges ⇒ (\sum a_n) converges.
- Conditional convergence – (\sum a_n) converges but (\sum |a_n|) diverges (e.g., alternating harmonic series).
3. Classification of Series
| Type | General Form | Sum Formula (if convergent) | Example |
|---|---|---|---|
| Arithmetic | (a_n = a_1 + (n-1)d) | (S_N = \frac{N}{2}(a_1 + a_N)) | (1,4,7,10,\dots) |
| Geometric | (a_n = a_1 r^{,n-1}) | (S_N = a_1\frac{1-r^N}{1-r}) ( | r |
| Harmonic | (a_n = \frac1n) | Divergent | (1+1/2+1/3+\dots) |
| Alternating Harmonic | (a_n = \frac{(-1)^{n+1}}{n}) | (\ln 2) | (1-1/2+1/3-1/4+\dots) |
| Fibonacci | (F_{n+2}=F_{n+1}+F_n,;F_1=F_2=1) | No closed form for finite sum; Binet’s formula for (F_n). | (1,1,2,3,5,8,\dots) |
| Prime‑based | (a_n = p_n) (the (n)-th prime) | No simple sum | (2,3,5,7,11,\dots) |
| Factorial | (a_n = n!) | Divergent | (1,2,6,24,\dots) |
| Catalan | (C_n = \frac{1}{n+1}\binom{2n}{n}) | Catalan generating function (C(x)=\frac{1-\sqrt{1-4x}}{2x}) | 1,1,2,5,14,… |
4. Rigorous Theory & Proofs
4.1 Arithmetic Series
Theorem. For (S_N=\sum_{k=1}^{N}(a_1+(k-1)d)),
[ S_N = \frac{N}{2}\bigl(a_1+a_N\bigr) = \frac{N}{2}\bigl(2a_1+(N-1)d\bigr). ]
Proof. Rearrange the sum by writing it forwards and backwards:
[ S_N = a_1 + (a_1+d)+\dots+(a_1+(N-1)d) \ S_N = (a_1+(N-1)d)+\dots+(a_1+d)+a_1 ]