Study Notes – Series
(Coast Guard Reasoning Ability – Advanced University Level)
Purpose – Equip you with a systematic framework to analyze, predict, and construct numerical series used in reasoning tests.
Audience – Graduate students, competitive exam aspirants, and anyone who wishes to master series reasoning.
1. Foundations
1.1 What is a Series?
A sequence (or series) is an ordered list of numbers
[
{a_n}{n=0}^{\infty} \quad \text{or} \quad {a_n}{n=1}^{\infty}
]
where each term (a_n) may be defined by a rule, formula, or recurrence relation.
Key distinction – In mathematics, series sometimes refers to the sum of terms, but in reasoning tests the term “series” almost always means sequence.
1.2 First‑Principles Approach
- Identify the domain – Are indices integers, natural numbers, or are terms defined only for specific positions?
- Collect initial data – Write the first few terms explicitly.
- Look for patterns –
- Arithmetic differences (Δ)
- Geometric ratios (R)
- Polynomial fit (Lagrange interpolation)
- Recurrence relations
- Test hypotheses – Verify that the rule holds for all given terms and predict the next ones.
2. Classical Series Families
| Family | Definition | Example | Common Reasoning Tricks |
|---|---|---|---|
| Arithmetic (AP) | (a_{n+1} = a_n + d) | 2, 5, 8, 11, … | Compute common difference Δ; check for missing terms. |
| Geometric (GP) | (a_{n+1} = a_n \cdot r) | 3, 6, 12, 24, … | Compute ratio R; look for powers of 2, 3, etc. |
| Fibonacci‑type | (a_{n+1} = a_n + a_{n-1}) | 1, 1, 2, 3, 5, 8, … | Recognize additive recurrence; sometimes multiplied by a constant. |
| Quadratic | (a_n = an^2 + bn + c) | 1, 4, 9, 16, … | Δ increases linearly; second difference constant. |
| Cubic | (a_n = an^3 + bn^2 + cn + d) | 1, 8, 27, 64, … | Third difference constant. |
| Alternating | (a_n = (-1)^n \cdot f(n)) | 1, -2, 3, -4, … | Sign flips; absolute values follow a pattern. |
| Factorial | (a_n = n!) | 1, 2, 6, 24, 120, … | Rapid growth; often used to test recognition of n! pattern. |
| Prime‑based | (a_n = p_n) (nth prime) | 2, 3, 5, 7, 11, … | Requires knowledge of primes; sometimes shifted or combined. |
2.1 Edge Cases
| Edge | Description | Example |
|---|---|---|
| Zero terms | Series involving 0 as a term or as a factor | 0, 0, 0, … or 1, 0, 1, 0, 1, … |
| Negative indices | Recurrence defined for (n < 0) or terms alternate sign | (a_{-1} = 1, a_0 = 2, a_1 = 4) (reverse GP) |
| Non‑integer indices | Continuous‑domain extensions (e.g., (a_n = \sin(n\pi/2))) | 0, 1, 0, -1, 0, 1, … |
| Composite patterns | Two overlapping sequences interleaved | 1, 4, 2, 9, 3, 16, … (n and n² alternating) |
3. Advanced Theory
3.1 Recurrence Relations
A recurrence relation defines (a_n) in terms of previous terms:
[ a_n = \sum_{k=1}^{m} c_k,a_{n-k} + f(n) ]
- Linear homogeneous: (f(n)=0).
- Linear non‑homogeneous: (f(n)\neq 0).
3.1.1 Solving Linear Recurrences
- Characteristic equation
[ r^m - c_1 r^{m-1} - \dots - c_m = 0 ] - Roots (r_i) (repeated/complex allowed).
- General solution
[ a_n = \sum_{i} P_i(n),r_i^n ] where (P_i(n)) is a polynomial of degree (s_i-1) if (r_i) has multiplicity (s_i).
Example (Fibonacci)
Characteristic: (r^2 - r - 1 = 0) → (r = \phi,; \psi).
Solution: (a_n = A\phi^n + B\psi^n).
3.2 Generating Functions
The ordinary generating function (OGF) of ({a