NO MATH ANXIETY ✦ NON-ENGINEERS ONLY ✦ 100% CONCEPT CLARITY ✦ CRACK MBA LIKE A BOSS ✦ NO MATH ANXIETY ✦ NON-ENGINEERS ONLY ✦ 100% CONCEPT CLARITY ✦ CRACK MBA LIKE A BOSS ✦
Analytical Reasoning Pillar

SERIES & SEQUENCES

Complete Guide for CAT, MBA CET, NMAT, SNAP & XAT

DEFINITION

What Is a Series?

A Series (or Sequence) is an ordered succession of terms—numbers, letters, words, or alphanumeric clusters—generated according to a definite underlying mathematical, positional, or logical relationship. The solver's task is to uncover that generative law and use it to determine a missing term, find the next term, or identify a rogue term that violates the rule.

FORMULA: $T_n = f(n) \text{ or } f(T_{n-1})$ RULE-GOVERNED
CORE INTUITION 📈

Systematic Pattern Detection

Series reasoning is not random guessing; it is controlled hypothesis testing. A genuine rule must account consistently for every single term in the sequence, not just the last pair. By systematically evaluating differences, multiplicative ratios, powers, prime properties, and position indices, you isolate the true generative law with 100% mathematical certainty.

APPROACH: DIFFERENCE $\to$ RATIO $\to$ POWER ZERO GUESSWORK
🔬 THE 5 STRUCTURAL SERIES ARCHITECTURES

In management entrance exams (CAT, MBA CET, SNAP, NMAT, XAT), every series question falls into one of five structural categories:

1. Consistent Rule

Single uniform operator applied step-by-step (e.g. constant addition $+7$, geometric ratio $\times 3$).

2. Alternating / Interleaved

Two independent sub-series interwoven at odd ($1, 3, 5$) and even ($2, 4, 6$) indices.

3. Multi-Operation / Hybrid

Compound formulas combining operations like $T_n = 2 T_{n-1} + n$ or alternating between $+k$ and $\times m$.

4. Alphabetic / Positional

Letters mapped to numbers $A=1 \dots Z=26$, reverse positions ($27-\text{rank}$), or modulo 26 cyclic jumps.

5. Finite Ambiguity

Sequences where short prefixes admit multiple rules; resolved strictly by the Principle of Parsimony.

🎯 Why It Matters

Series questions test rapid pattern recognition, numerical fluency, and mental arithmetic. In speed-based exams like SNAP and MBA CET, cracking 4-6 series questions in under 3 minutes provides a decisive competitive edge.

🏛️ Where Used

Heavily featured in MAH MBA CET (5-8 standalone questions), SNAP (3-5 questions), NMAT (Language & Logical reasoning), XAT (Decision Making sequences), and CAT LRDI set pattern foundations.

🔑 Prerequisites

Familiarity with prime numbers up to 100, perfect squares up to $35^2$, perfect cubes up to $15^3$, basic modular arithmetic, and the alphabetical index mapping ($A=1$ through $Z=26$).

SECTION B

Number Series Fundamentals

Before testing complex formulas, an expert reasoning solver inspects seven elementary relational indicators between terms:

1. Consecutive Differences ($\Delta_1$)

Subtract each term from its successor: $d_i = T_{i+1} - T_i$. If $d_i$ is constant, it is an arithmetic progression.

Example: $11, 18, 25, 32, 39, \dots \implies \Delta_1 = +7$ (Constant AP)
2. Second Differences ($\Delta_2$)

When first differences increase or decrease at a steady pace, take the difference of differences: $\Delta_2 = d_{i+1} - d_i$.

Example: $2, 6, 12, 20, 30 \implies \Delta_1 = 4, 6, 8, 10 \implies \Delta_2 = +2$ (Quadratic)
3. Ratios & Multiplication

When terms grow aggressively by multiples, evaluate $r_i = \frac{T_{i+1}}{T_i}$. Constant ratio indicates a geometric series.

Example: $3, 12, 48, 192, 768 \implies \text{Ratio } r = \times 4$ (Constant GP)
4. Alternating Operations

Successive steps alternate between two distinct operations (e.g., $+a, \times b, +a, \times b$).

Example: $5, 10, 8, 16, 14, 28 \implies \times 2, -2, \times 2, -2, \times 2$
5. Neighbour Term Recurrence

A term depends on the sum, product, or difference of previous terms (e.g., Fibonacci recurrence: $T_n = T_{n-1} + T_{n-2}$).

Example: $2, 3, 5, 8, 13, 21 \implies 2+3=5, 3+5=8, 5+8=13$
6. Non-Adjacent Positions

Terms do not relate to immediate neighbours, but connect strictly to terms at index $n \pm 2$ or $n \pm 3$.

Example: $10, 50, 15, 45, 20, 40 \implies \text{Odds } +5 \text{ vs Evens } -5$
⚖️ THE PRINCIPLE OF PARSIMONY (OCCAM'S RAZOR IN REASONING)

Mathematically, any finite set of $k$ numbers can be fitted by an infinite number of high-order polynomial functions. However, competitive aptitude exams operate under the Principle of Parsimony: the simplest generative rule that consistently explains every provided term without arbitrary ad-hoc exceptions is the intended answer. If both a simple linear difference rule and an intricate 4th-degree polynomial fit the prefix, always select the simpler, foundational rule.

SECTION C

12 Common Number Series Patterns

PATTERN 01 Linear AP

Constant Addition / Subtraction

How to Recognise: Terms increase or decrease steadily by an identical increment $d$.
How to Test: Compute $T_2 - T_1, T_3 - T_2, \dots$ Confirm that all differences match exactly.

Worked Example: $8, 15, 22, 29, 36, ?$
Differences: $+7, +7, +7, +7 \implies \text{Next} = 36 + 7 = \mathbf{43}$.
Common Trap: Assuming constant addition after checking only the first pair without testing across all subsequent terms.
PATTERN 02 Geometric GP

Constant Multiplication / Division

How to Recognise: Consecutive terms explode in magnitude or shrink rapidly by a fixed factor.
How to Test: Check the ratio $r = \frac{T_{k+1}}{T_k}$. Verify equality across all terms.

Worked Example: $4, 12, 36, 108, ?$
Ratios: $\times 3, \times 3, \times 3 \implies \text{Next} = 108 \times 3 = \mathbf{324}$.
Common Trap: Confusing multiplying by 3 with adding $+8, +24, +72$ (which is an increasing difference series).
PATTERN 03 Accelerating AP

Increasing Differences

How to Recognise: Step sizes grow gradually ($+2, +4, +6, +8$).
How to Test: Compute first differences; check if they form an AP, consecutive evens, or primes.

Worked Example: $5, 7, 11, 17, 25, ?$
Differences: $+2, +4, +6, +8 \implies \text{Next diff} = +10 \implies 25 + 10 = \mathbf{35}$.
Common Trap: Forgetting to add the newly calculated difference to the last term instead of the last difference.
PATTERN 04 Decelerating

Decreasing Differences

How to Recognise: Successive gaps between terms contract steadily.
How to Test: Subtract terms; observe if differences diminish by a uniform decrement.

Worked Example: $100, 85, 72, 61, 52, ?$
Differences: $-15, -13, -11, -9 \implies \text{Next diff} = -7 \implies 52 - 7 = \mathbf{45}$.
Common Trap: Miscalculating negative differences when terms cross below zero.
PATTERN 05 $n^2 \pm k$

Squares & Square Offsets

How to Recognise: Numbers hover close to famous perfect squares ($1, 4, 9, 16, 25, 36, 49 \dots$).
How to Test: Express each term as $n^2, n^2-1, n^2+1, \text{ or } n^2-n$.

Worked Example: $3, 8, 15, 24, 35, ?$
Rule: $n^2 - 1$ for $n = 2, 3, 4, 5, 6 \implies \text{Next} = 7^2 - 1 = \mathbf{48}$.
Common Trap: Starting the base count $n$ at 1 instead of 2, resulting in an off-by-one term error.
PATTERN 06 $n^3 \pm k$

Cubes & Cube Offsets

How to Recognise: Numbers hover near perfect cubes ($1, 8, 27, 64, 125, 216, 343 \dots$).
How to Test: Formulate as $n^3, n^3 \pm 1, n^3 \pm n$, or $n^3 + n^2$.

Worked Example: $2, 9, 28, 65, 126, ?$
Rule: $n^3 + 1$ for $n = 1, 2, 3, 4, 5 \implies \text{Next} = 6^3 + 1 = 216 + 1 = \mathbf{217}$.
Common Trap: Mistaking $65$ ($4^3+1$) for $8^2+1$ without confirming whether the other terms conform to squares or cubes.
PATTERN 07 Primes

Prime Number Patterns

How to Recognise: Sequence contains numbers with exactly two distinct positive divisors ($2, 3, 5, 7, 11, 13, 17 \dots$).
How to Test: Verify that no composite numbers (such as $9, 15, 21, 27$) are present.

Worked Example: $13, 17, 19, 23, 29, ?$
Consecutive primes $\implies \text{Next prime after } 29 = \mathbf{31}$.
Common Trap: Including $33$ ($3 \times 11$) or $35$ ($5 \times 7$) as prime numbers under time pressure.
PATTERN 08 Divisibility

Multiples & Divisibility

How to Recognise: All terms share a distinct common factor or obey modulo constraints.
How to Test: Check whether terms are successive multiples $k \times m$, or share specific divisibility remainders.

Worked Example: $14, 28, 42, 56, 70, ?$
Multiples of 14: $14 \times 1, \dots, 14 \times 5 \implies 14 \times 6 = \mathbf{84}$.
Common Trap: Overlooking that differences in a multiple series are identically equal to the divisor itself.
PATTERN 09 Figurate

Triangular & Figurate Numbers

How to Recognise: Sum of the first $n$ natural numbers: $T_n = \frac{n(n+1)}{2}$.
How to Test: Differences between terms are $2, 3, 4, 5, 6 \dots$ starting from 1.

Worked Example: $1, 3, 6, 10, 15, ?$
Gaps: $+2, +3, +4, +5 \implies \text{Next gap } +6 \implies 15 + 6 = \mathbf{21}$.
Common Trap: Confusing triangular numbers with Fibonacci numbers due to low starting terms ($1, 3$).
PATTERN 10 $n!$

Factorial Progressions

How to Recognise: Super-exponential growth: $1, 2, 6, 24, 120, 720 \dots$
How to Test: Consecutive multipliers grow by 1 each step: $\times 2, \times 3, \times 4, \times 5$.

Worked Example: $2, 3, 8, 27, 112, ?$ ($T_n = n \times T_{n-1} + (-1)^n$ or $T_n = T_{n-1} \times k + k$)
Standard: $1, 2, 6, 24, 120, ? \implies \times 2, \times 3, \times 4, \times 5 \implies 120 \times 6 = \mathbf{720}$.
Common Trap: Forgetting $0! = 1$ when a sequence starts with 1, 1, 2, 6, 24.
PATTERN 11 Digit Logic

Digit Sums & Products

How to Recognise: Standard arithmetic differences fail, but individual digits reveal internal structure.
How to Test: Sum digits ($S(n)$) or multiply digits ($P(n)$). Check $T_n = T_{n-1} + S(T_{n-1})$.

Worked Example: $12, 15, 21, 24, 30, ?$
Rule: $T_n = T_{n-1} + \text{sum of digits}(T_{n-1})$
$12 + (1+2) = 15; 15 + (1+5) = 21; 21 + (2+1) = 24; 24 + (2+4) = 30 \implies 30 + (3+0) = \mathbf{33}$.
Common Trap: Attempting complex polynomial fits on numbers that merely sum their internal digits.
PATTERN 12 $a \times T_{n-1} \pm b$

Combined Operations

How to Recognise: Terms roughly double, triple, or halve with a constant or stepping additive offset.
How to Test: Test linear recurrence $T_n = m \cdot T_{n-1} \pm c$.

Worked Example: $2, 5, 11, 23, 47, ?$
Rule: $\times 2 + 1 \implies 47 \times 2 + 1 = \mathbf{95}$.
Common Trap: Misinterpreting $\times 2 + 1$ as pure doubling without verifying the additive constant on larger numbers.
SECTION D

Difference-Based Series & Difference Trees

The Difference Tree is the single most powerful diagnostic tool in number series. When a series does not show an immediate constant difference or ratio, calculating successive tiers of differences reveals its polynomial degree.

📊 Canonical Difference Table Construction

Consider the sequence: $2, 5, 10, 17, 26, ?$

Tier Sequential Terms & Differences
Original Series ($T_n$) 2 5 10 17 26 ? = 37
1st Differences ($\Delta_1$) +3 +5 +7 +9 +11
2nd Differences ($\Delta_2$) — +2 +2 +2 +2 (CONSTANT)
Deduction: The second difference is constant ($+2$). Therefore, the first difference increases from $9$ to $9 + 2 = 11$. Adding $11$ to the last known term ($26$) gives the missing term: $26 + 11 = \mathbf{37}$.
📐 Polynomial Degree Theorem
  • If the 1st difference is constant, $T_n$ is linear: $T_n = an + b$.
  • If the 2nd difference is constant, $T_n$ is quadratic: $T_n = an^2 + bn + c$ (with $\Delta_2 = 2a$). Here, $\Delta_2 = 2 \implies a = 1$, giving $n^2 + 1$.
  • If the 3rd difference is constant, $T_n$ is cubic: $T_n = an^3 + bn^2 + cn + d$ (with $\Delta_3 = 6a$).
⚠️ Difference Tree Limitations

Never blindly construct difference trees on geometric, factorial, or alternating sequences! If terms multiply ($\times 2, \times 3$), taking differences merely creates another geometric series without collapsing to a constant. Stop and check ratios if differences grow exponentially.

SECTION E

Alternating & Interleaved Series

When a series oscillates up and down (e.g., $15, 30, 18, 26, 21, 22 \dots$), consecutive differences will fluctuate chaotically between positive and negative numbers. This is the classic signature of an Interleaved Series: two completely separate sequences merged into one.

🧩 Two-Track Position Decomposition

Analyze: $4, 18, 8, 14, 12, 10, 16, ?$

TRACK 1: ODD POSITIONS (1st, 3rd, 5th, 7th)
4, 8, 12, 16
Rule: Arithmetic progression with $+4$.
TRACK 2: EVEN POSITIONS (2nd, 4th, 6th, 8th)
18, 14, 10, ?
Rule: Arithmetic progression with $-4 \implies 10 - 4 = \mathbf{6}$.
Conclusion: The requested term is at position 8 (even track). It is directly determined by Track 2: $10 - 4 = \mathbf{6}$.
Exam Insight (SNAP & CET): Occasionally, an exam features a Triple Interleaved Series where 3 sequences are combined. If a sequence has 9 to 12 terms and alternating even/odd tracks do not yield clean patterns, separate terms into modulo 3 tracks ($1, 4, 7 \dots; 2, 5, 8 \dots; 3, 6, 9 \dots$).
SECTION F

Missing-Term Series (Single & Multiple Blanks)

In a missing-term problem, one or two values in the middle or at the end of the sequence are replaced with a question mark ($?$). To avoid false matches, follow this 5-step checklist:

STEP 1
Local Context

Inspect terms right before & after the blank.

STEP 2
Magnitude

Assess if growth is additive ($\Delta_1$) or multiplicative ($r$).

STEP 3
Anchor Test

Check against squares, cubes, primes, and digit sums.

STEP 4
Dual Track

Check whether odd and even positions obey different rules.

STEP 5
Bridging Proof

Crucial: ensure proposed term produces the term after the blank.

Single-Gap Bridging
$3, 8, 18, 38, ?, 158$

Test linear recurrence: $T_n = 2 T_{n-1} + 2$.
$3 \times 2 + 2 = 8$; $8 \times 2 + 2 = 18$; $18 \times 2 + 2 = 38$.
Calculate blank: $38 \times 2 + 2 = \mathbf{78}$.
Bridging Verification: $78 \times 2 + 2 = 156 + 2 = 158$. Exactly matches the post-blank term!

Dual-Gap Validation
$5, ?, 17, 23, ?, 35$

Notice $23 - 17 = 6$ and $35 - 5 = 30$ over 5 steps ($30/5 = 6$).
Hypothesis: Constant AP with $d = +6$.
First gap: $5 + 6 = \mathbf{11}$. (Check: $11 + 6 = 17$, valid).
Second gap: $23 + 6 = \mathbf{29}$. (Check: $29 + 6 = 35$, valid).
Both blanks confirmed: $(11, 29)$.

SECTION G

Incorrect-Term Series ("Find the Wrong Number")

"Find the Wrong Number" is notoriously harder than missing-number questions because test-takers do not know where the rule breaks. However, there is an exact mathematical theorem that solves these instantly:

🎯 THE DUAL-CORRUPTION LOCALIZATION LAW

In any difference-based sequence, an error in a single term $T_k$ corrupts exactly two adjacent differences: $d_{k-1} = T_k - T_{k-1}$ and $d_k = T_{k+1} - T_k$. The term at the intersection of the two anomalous differences is always the faulty number!

Worked Diagnostic: Identify the wrong term in $5, 12, 26, 54, 112, 222$
• Check rule: $T_n = 2 T_{n-1} + 2$
$5 \times 2 + 2 = 12$ (Match)
$12 \times 2 + 2 = 26$ (Match)
$26 \times 2 + 2 = 54$ (Match)
$54 \times 2 + 2 = 110$ $\implies$ Given term is 112! (MISMATCH)
Verification: If $T_5 = 110$, then $110 \times 2 + 2 = 222$ (Matches the final term perfectly!)
Conclusion: The incorrect term is 112. Replacing it with 110 restores the full sequence.
SECTION H

Alphabet Series & Letter Jumps

Alphabet series are simply numerical series disguised as letters. By memorizing positional anchors, you translate letter sequences into standard integers in 2 seconds flat.

FORWARD ANCHOR: E - J - O - T - Y (5s)
E
5
J
10
O
15
T
20
Y
25

Use EJOTY to pinpoint neighbouring letters immediately (e.g., $S$ is 1 before $T \implies 19$; $L$ is 2 after $J \implies 12$).

REVERSE ALPHABET POSITIONS
Formula: $\text{Reverse Position} = 27 - \text{Forward Rank}$

$Z = 27 - 26 = 1$; $A = 27 - 1 = 26$; $M = 27 - 13 = 14$. Opposite pairs always sum to 27 ($A-Z, B-Y, C-X, D-W, E-V, \dots$).

🔄 Cyclic Wraparound Law ($Z \to A$)

When forward increments exceed 26, wrap cyclically using modulo 26 arithmetic:

$$\text{Letter Rank} = ((P + k - 1) \bmod 26) + 1$$ Example: In $B, E, I, N, T, ?$ the differences are $+3, +4, +5, +6$.
The next difference is $+7$. Starting from $T(20)$: $20 + 7 = 27$.
Applying modulo 26: $27 - 26 = 1 \implies \mathbf{A}$. The next letter is $\mathbf{A}$.
SECTION I

Alphanumeric Series

Alphanumeric series combine letters and digits into compound clusters (e.g. $A2Z, C5X, F10U, J17Q, ?$). The golden rule: decouple the components. Treat each character slot as an independent parallel progression before investigating any internal cross-coupling.

Worked Walkthrough: $A2Z, C5X, F10U, J17Q, ?$
Track 1: Leading Letter $A(1) \xrightarrow{+2} C(3) \xrightarrow{+3} F(6) \xrightarrow{+4} J(10)$
Next increment: $+5$
$10 + 5 = 15 \implies \mathbf{O}$
Track 2: Middle Number $2 \xrightarrow{+3} 5 \xrightarrow{+5} 10 \xrightarrow{+7} 17$
Next increment: $+9$ (or $n^2+1$)
$17 + 9 = \mathbf{26}$
Track 3: Trailing Letter $Z(26) \xrightarrow{-2} X(24) \xrightarrow{-3} U(21) \xrightarrow{-4} Q(17)$
Next decrement: $-5$
$17 - 5 = 12 \implies \mathbf{L}$
Synthesis: Concatenating the three tracks yields the final term: $\mathbf{O26L}$.
SECTION J

Word & Symbol Series

Unlike Coding & Decoding, which translates words into ciphers, Word & Symbol Series focus strictly on sequential transformations of words based on structural attributes:

1. Word-Length Progressions

Words ordered by character count or vowel counts:

At, The, Four, About, Simple, ?
Lengths: 2, 3, 4, 5, 6 $\implies$ Answer must be a 7-letter word (e.g. Freedom).
2. Semantic Calendar Sequences

Initial letters of ordered real-world sequences (days, months, planets):

J, F, M, A, M, J, ?
Months: Jan, Feb, Mar, Apr, May, Jun $\implies$ Next is J (July).
3. Cyclic Letter Chains

The terminal letter of each word becomes the initial letter of the next:

CAT, TIGER, RABBIT, TOAD, ?
Ends with D $\implies$ Next word must start with D (e.g. DEER).
SECTION K

Advanced & Hybrid Series

High-percentile CAT and XAT questions employ Hybrid Series that integrate multiple operators, position index dependencies, and Fibonacci-style multi-term recurrences.

1. Generalized Multi-Term Recurrence

Each term is the sum of the preceding 3 terms ($T_n = T_{n-1} + T_{n-2} + T_{n-3}$):

Series: $1, 1, 2, 4, 7, 13, 24, ?$
Verification:
$1+1+2 = 4$
$1+2+4 = 7$
$2+4+7 = 13$
$4+7+13 = 24$
Next: $7 + 13 + 24 = \mathbf{44}$.
2. Index-Dependent Multipliers ($n \times T_{n-1} + n$)

The multiplier or additive constant increments with the term index $n$:

Series: $4, 9, 20, 43, 90, ?$
Step 1 ($n=1$): $4 \times 2 + 1 = 9$
Step 2 ($n=2$): $9 \times 2 + 2 = 20$
Step 3 ($n=3$): $20 \times 2 + 3 = 43$
Step 4 ($n=4$): $43 \times 2 + 4 = 90$
Step 5 ($n=5$): $90 \times 2 + 5 = 180 + 5 = \mathbf{185}$.
SECTION L

The 11-Step Repeatable Solving Framework

Follow this battle-tested 11-step execution workflow on every series question under timed conditions:

01

Record the Sequence Accurately

Write down every term cleanly with sufficient whitespace above and below for difference tiers.

02

Calculate First Differences ($\Delta_1$)

Compute $T_2 - T_1, T_3 - T_2, \dots$ If differences are constant, you have an AP. If they increase linearly, prepare for $\Delta_2$.

03

Check Ratios and Multiplicative Factors

If numbers jump by factors ($\times 2, \times 3, \times 4$), divide successive terms. Do not waste time computing differences on exponential growth.

04

Inspect Squares, Cubes, and Primes

Test if terms equal $n^2 \pm k$, $n^3 \pm k$, $n^3 \pm n$, or prime numbers. This resolves 40% of non-linear questions instantly.

05

Evaluate Second Differences ($\Delta_2$)

If first differences increase steadily, calculate $\Delta_2$. A constant second difference proves a quadratic formula ($an^2+bn+c$).

06

Split Alternating Tracks (Odd vs Even)

If values oscillate up and down, isolate odd positions ($1, 3, 5$) and even positions ($2, 4, 6$) into independent series.

07

Convert Letters to Positional Integers

For alphabet series, immediately write ranks $A=1 \dots Z=26$ using EJOTY. Treat cyclic wraps ($Z \to A$) modulo 26.

08

Decouple Alphanumeric Components

Separate letter sequences from numeric sequences. Solve both parallel tracks independently before checking cross-links.

09

Verify Candidate Rule Across Every Term

Never finalize an answer that fits only 2 terms. The hypothesized rule must satisfy every provided number in the sequence.

10

Execute Bridging Check

For missing-term or incorrect-term series, calculate the proposed term and confirm it mathematically reproduces the succeeding term.

11

Apply Principle of Parsimony

If two rules fit, choose the simpler, more natural rule. If ambiguous under strict time pressure, eliminate impossible options and move forward.

SECTION M

10 Fully Worked Solved Examples

EXAMPLE 01 (EASY) — CONSTANT DIFFERENCE AP TYPE: ARITHMETIC PROGRESSION

Question: Find the next term in the sequence: $14, 23, 32, 41, 50, ?$

1. Observed Pattern: The numbers increase at a constant, moderate rate.
2. Intermediate Calculations:
$23 - 14 = +9$
$32 - 23 = +9$
$41 - 32 = +9$
$50 - 41 = +9$
3. Reasoning: This is a standard Arithmetic Progression with common difference $d = +9$.
4. Calculation of Next Term: $50 + 9 = \mathbf{59}$.
5. Final Verification: $14 + 9 \times 5 = 14 + 45 = 59$. The rule accounts for every single term without exception.
CORRECT ANSWER: 59
EXAMPLE 02 (EASY) — CONSTANT RATIO GP TYPE: GEOMETRIC PROGRESSION

Question: Find the next term in the sequence: $6, 18, 54, 162, ?$

1. Observed Pattern: Rapid multiplicative growth between consecutive terms.
2. Intermediate Calculations:
$18 / 6 = 3$
$54 / 18 = 3$
$162 / 54 = 3$
3. Reasoning: Geometric progression with common ratio $r = 3$.
4. Calculation of Next Term: $162 \times 3 = \mathbf{486}$.
5. Final Verification: $T_n = 6 \times 3^{n-1}$. For $n=5$: $6 \times 3^4 = 6 \times 81 = 486$. Verified!
CORRECT ANSWER: 486
EXAMPLE 03 (MEDIUM) — INCREASING DIFFERENCE TYPE: SECOND DIFFERENCE

Question: Find the next term in the sequence: $7, 11, 19, 31, 47, ?$

1. Observed Pattern: Successive gaps widen steadily.
2. Intermediate Calculations:
$\Delta_1$: $11 - 7 = 4$; $19 - 11 = 8$; $31 - 19 = 12$; $47 - 31 = 16$.
First differences are: $4, 8, 12, 16$ (Multiples of 4, or $\Delta_2 = +4$).
3. Reasoning: The next difference must be $16 + 4 = 20$.
4. Calculation of Next Term: $47 + 20 = \mathbf{67}$.
5. Final Verification: Formula $T_n = 2n^2 - 2n + 7$. For $n=6$: $2(36) - 12 + 7 = 72 - 12 + 7 = 67$. Verified!
CORRECT ANSWER: 67
EXAMPLE 04 (MEDIUM) — CUBES WITH CONSTANT OFFSET TYPE: $n^3 + 1$

Question: What is the next term in the series: $2, 9, 28, 65, 126, ?$

1. Observed Pattern: Terms are 1 greater than perfect cubes ($1, 8, 27, 64, 125$).
2. Intermediate Calculations:
$1^3 + 1 = 1 + 1 = 2$
$2^3 + 1 = 8 + 1 = 9$
$3^3 + 1 = 27 + 1 = 28$
$4^3 + 1 = 64 + 1 = 65$
$5^3 + 1 = 125 + 1 = 126$
3. Reasoning: Each term follows the explicit form $T_n = n^3 + 1$ for index $n \ge 1$.
4. Calculation of Next Term: For $n=6$: $6^3 + 1 = 216 + 1 = \mathbf{217}$.
5. Final Verification: Checked $6^3 = 216$, $216 + 1 = 217$. Unambiguous and rigorously verified.
CORRECT ANSWER: 217
EXAMPLE 05 (MEDIUM) — CONSECUTIVE PRIMES TYPE: PRIME SEQUENCE

Question: Find the next term in the sequence: $11, 13, 17, 19, 23, 29, 31, ?$

1. Observed Pattern: All numbers in the sequence are prime numbers. Notice that odd composite numbers like 15, 21, 25, 27 are absent.
2. Intermediate Calculations:
Prime list: $2, 3, 5, 7, \mathbf{11, 13, 17, 19, 23, 29, 31}, \mathbf{37}, 41 \dots$
3. Reasoning: This is a strictly ordered sequence of consecutive prime numbers starting at 11.
4. Calculation of Next Term: The next prime number immediately after 31 is $\mathbf{37}$.
5. Final Verification: 33 is divisible by 3 and 11; 35 is divisible by 5 and 7; 37 has no divisors other than 1 and itself. Verified!
CORRECT ANSWER: 37
EXAMPLE 06 (MEDIUM) — DUAL ALTERNATING SEQUENCE TYPE: INTERLEAVED

Question: Determine the next number in the sequence: $4, 18, 8, 14, 12, 10, 16, ?$

1. Observed Pattern: Values oscillate (4 up to 18, down to 8, up to 14). This indicates an interleaved sequence.
2. Intermediate Calculations (Track Decomposition):
Odd positions (1st, 3rd, 5th, 7th): $4, 8, 12, 16$ (Rule: $+4$ each step).
Even positions (2nd, 4th, 6th, 8th): $18, 14, 10, ?$ (Rule: $-4$ each step).
3. Reasoning: The target term is the 8th term, which belongs to the even-indexed progression.
4. Calculation of Next Term: $10 - 4 = \mathbf{6}$.
5. Final Verification: Odd track extends to $16+4=20$; Even track extends to $6-4=2$. The pattern is consistent across all positions.
CORRECT ANSWER: 6
EXAMPLE 07 (MEDIUM-HARD) — MISSING TERM BRIDGING TYPE: $2 T_{n-1} + 2$

Question: Find the missing term in the sequence: $3, 8, 18, 38, ?, 158$

1. Observed Pattern: Terms roughly double at each step with an additive component.
2. Intermediate Calculations:
Step 1: $3 \times 2 + 2 = 8$
Step 2: $8 \times 2 + 2 = 18$
Step 3: $18 \times 2 + 2 = 38$
(Alternatively, differences are $5, 10, 20, 40, 80$, which double each time).
3. Reasoning: The generative law is $T_n = 2 T_{n-1} + 2$ (or difference doubling).
4. Calculation of Missing Term: $38 \times 2 + 2 = 76 + 2 = \mathbf{78}$ (or $38 + 40 = 78$).
5. Final Verification (Bridging Check): Testing term 78 into the formula for the next term: $78 \times 2 + 2 = 156 + 2 = 158$. Exactly matches 158!
CORRECT ANSWER: 78
EXAMPLE 08 (HARD) — INCORRECT TERM LOCALIZATION TYPE: WRONG NUMBER

Question: One term in the given sequence is incorrect. Identify it: $5, 12, 26, 54, 112, 222$

1. Observed Pattern: Differences are $7, 14, 28, 58, 110$. Notice $7, 14, 28$ double, but then breaks at 58 and 110.
2. Intermediate Calculations:
Term 1 to 2: $5 \times 2 + 2 = 12$
Term 2 to 3: $12 \times 2 + 2 = 26$
Term 3 to 4: $26 \times 2 + 2 = 54$
Term 4 to 5: $54 \times 2 + 2 = \mathbf{110}$ (Given term is 112!)
Term 5 to 6: $110 \times 2 + 2 = 222$ (Matches the given 222!)
3. Reasoning: The erroneous term 112 corrupts both difference 4 ($54 \to 112 = +58$) and difference 5 ($112 \to 222 = +110$). Replacing it with 110 makes the differences $7, 14, 28, 56, 112$.
4. Result: The incorrect term is $\mathbf{112}$ (correct value is 110).
5. Final Verification: Fully verified by substituting 110 and validating all subsequent steps.
INCORRECT TERM: 112
EXAMPLE 09 (MEDIUM) — ALPHABET JUMP WITH CYCLIC WRAP TYPE: MODULO 26

Question: Find the next term in the letter series: $B, E, I, N, T, ?$

1. Observed Pattern: Convert each letter to its standard English alphabetical position (A=1 ... Z=26).
2. Intermediate Calculations:
$B = 2$
$E = 5$ (Gap: $5 - 2 = +3$)
$I = 9$ (Gap: $9 - 5 = +4$)
$N = 14$ (Gap: $14 - 9 = +5$)
$T = 20$ (Gap: $20 - 14 = +6$)
3. Reasoning: Jumps increase by $+1$ at each step ($+3, +4, +5, +6$). Next jump must be $+7$.
4. Calculation with Cyclic Wrap: Position = $20 + 7 = 27$. Applying cyclic modulo 26: $27 - 26 = 1 = \mathbf{A}$.
5. Final Verification: The series transitions cleanly past Z into A. Answer is unambiguously A.
CORRECT ANSWER: A
EXAMPLE 10 (HARD) — TRIPLE-TRACK ALPHANUMERIC TYPE: COMPOUND CLUSTER

Question: Find the next term in the alphanumeric sequence: $A2Z, C5X, F10U, J17Q, ?$

1. Observed Pattern: Each term contains a leading letter, a middle number, and a trailing letter.
2. Intermediate Calculations (Three Parallel Tracks):
• First letter: $A(1) \xrightarrow{+2} C(3) \xrightarrow{+3} F(6) \xrightarrow{+4} J(10) \xrightarrow{+5} \mathbf{O(15)}$
• Middle number: $2 \xrightarrow{+3} 5 \xrightarrow{+5} 10 \xrightarrow{+7} 17 \xrightarrow{+9} \mathbf{26}$ (also $n^2+1$ for $n=1..5$)
• Third letter: $Z(26) \xrightarrow{-2} X(24) \xrightarrow{-3} U(21) \xrightarrow{-4} Q(17) \xrightarrow{-5} \mathbf{L(12)}$
3. Reasoning: All three components obey accelerating increments ($+2, +3, +4, +5$ and $-2, -3, -4, -5$).
4. Calculation of Next Term: Combining $O + 26 + L = \mathbf{O26L}$.
5. Final Verification: Rigorously verified across all 4 previous terms and tracks. Result is uniquely determined.
CORRECT ANSWER: O26L
SECTION N

10 Common Traps & How to Avoid Them

1. Checking Only Consecutive Differences

Trap: Computing $T_2 - T_1$ and assuming an AP without checking ratios or powers.
Fix: If numbers double or multiply, switch immediately to testing ratios.

2. Ignoring Ratios on Rapid Growth

Trap: Calculating multi-tier difference trees on series like $3, 12, 48, 192$.
Fix: When terms grow by factors $> 2$, test geometric division first.

3. Missing an Alternating Pattern

Trap: Trying to fit a single monotonic rule onto a sequence that oscillates up and down.
Fix: Separate terms at odd positions from terms at even positions.

4. Confusing Differences with Ratios

Trap: Confusing $+8, +16, +32$ with $\times 2, \times 2, \times 2$.
Fix: Note that $T_n = 2 T_{n-1}$ produces doubling differences, but the starting base dictates the formula.

5. Assuming Every Curve Is Squares or Cubes

Trap: Forcing $n^2$ onto numbers that actually follow prime gaps or Fibonacci sums.
Fix: Memorize prime numbers up to 100 to spot prime series instantly.

6. Forcing an Overly Complex Polynomial

Trap: Inventing a 4-variable cubic equation when a simple digit sum explains the pattern.
Fix: Follow Occam's Razor: test elementary patterns before exotic polynomials.

7. Checking Only the Final Two Terms

Trap: Finding a rule that links $T_{k-1}$ and $T_k$, but failing to verify on $T_1$ and $T_2$.
Fix: Every candidate rule must be validated across the entire given sequence.

8. Applying Cyclic Wraparound Without Proof

Trap: Wrapping $Z \to A$ arbitrarily when the sequence actually counts backward from $Z$.
Fix: Confirm whether the direction of alphabet jumps is strictly positive or negative.

9. Assuming Strict Mathematical Uniqueness

Trap: Panicking when two plausible rules exist.
Fix: Check answer choices! In multiple-choice aptitude tests, only one valid rule will be among the options.

10. Selecting a Wrong Term Without Re-Verifying

Trap: Spotting an anomaly and picking it without verifying if replacing it restores all subsequent terms.
Fix: Perform the substitution and confirm the restored number links seamlessly to the next term.

SECTION O

Shortcuts & TBT Exam Playbook

⚡ THE 45-SECOND TRIAGE

Spend 10s checking differences, 10s checking ratios, 10s checking squares/cubes, and 15s checking alternating tracks. If no pattern emerges within 45 seconds, flag and skip. Never let a series question eat 3 minutes.

🎯 OPTION BACK-SOLVING

If you suspect an alternating rule or composite multiplier, plug the answer choices into the blank. Checking if an option satisfies both the predecessor and successor differences resolves the problem in seconds.

🧠 SPEED ANCHORS

Commit to memory: Primes to 100 ($2, 3 \dots 97$), Squares to $32^2$ ($1024$), Cubes to $12^3$ ($1728$), Powers of 2 to $2^{10}$ ($1024$), Powers of 3 to $3^6$ ($729$), and Factorials to $7!$ ($5040$).

SECTION P

15 Verified Practice Questions

Q01 • EASY MISSING NUMBER (AP)

Find the missing number in the sequence: $17, 24, 31, 38, ?, 52$

A) 43
B) 45
C) 46
D) 47
Q02 • EASY NEXT TERM (GP)

What is the next number in the sequence: $5, 15, 45, 135, ?$

A) 385
B) 395
C) 405
D) 415
Q03 • EASY ALPHABET SERIES

Find the next letter in the series: $D, G, J, M, P, ?$

A) Q
B) R
C) S
D) T
Q04 • EASY INCREASING DIFFERENCE

Find the next term in the sequence: $3, 6, 11, 18, 27, ?$

A) 36
B) 37
C) 38
D) 39
Q05 • MEDIUM SQUARE PATTERNS

Determine the next term in the sequence: $0, 3, 8, 15, 24, ?$

A) 33
B) 35
C) 37
D) 48
Q06 • MEDIUM CUBE OFFSETS

Find the next term in the series: $0, 7, 26, 63, 124, ?$

A) 215
B) 216
C) 217
D) 225
Q07 • MEDIUM PRIME NUMBERS

What is the next number in the sequence: $2, 3, 5, 7, 11, 13, 17, ?$

A) 18
B) 19
C) 21
D) 23
Q08 • MEDIUM ALTERNATING TRACKS

Determine the next term: $25, 10, 22, 13, 19, 16, 16, ?$

A) 17
B) 18
C) 19
D) 20
Q09 • MEDIUM DIFFERENCE OF DIFFERENCES

Find the next number in the sequence: $2, 7, 17, 32, 52, ?$

A) 72
B) 75
C) 77
D) 82
Q10 • MEDIUM ALPHABET INCREASING JUMPS

Find the next letter in the series: $A, C, F, J, O, ?$

A) S
B) T
C) U
D) V
Q11 • HARD INDEX-COUPLED RECURRENCE

Find the next term in the series: $4, 9, 20, 43, 90, ?$

A) 182
B) 185
C) 186
D) 190
Q12 • HARD FIND THE WRONG NUMBER

Identify the incorrect term in the sequence: $3, 7, 16, 35, 72, 153, 312$

A) 16
B) 35
C) 72
D) 153
Q13 • HARD ALPHANUMERIC CLUSTERS

What is the next term in the series: $W12D, T15G, Q18J, N21M, ?$

A) K24P
B) L24P
C) K23P
D) J24O
Q14 • HARD FIGURATE / PRONIC NUMBERS

Find the next term in the sequence: $2, 6, 12, 20, 30, ?$

A) 38
B) 40
C) 42
D) 44
Q15 • HARD SUM OF SQUARES

Find the next term in the series: $1, 5, 14, 30, 55, 91, ?$

A) 130
B) 136
C) 140
D) 145
SECTION Q

Frequently Asked Questions

What is a number series?

A number series is an ordered sequence of numerical values generated by an underlying logical, mathematical, or structural rule. The goal is to identify that generative rule and apply it to deduce missing terms, find the next term, or isolate an incorrect term.

How do I start solving a missing-term series?

First, inspect the magnitude of change between adjacent terms. If numbers increase slowly or moderately, calculate first differences. If numbers grow rapidly by factors, test multiplicative ratios or powers (squares, cubes). If numbers oscillate up and down, separate the odd and even indexed terms into two independent alternating sub-series.

When should I use differences?

Use differences whenever the sequence exhibits steady, additive, or quadratic expansion where successive terms do not maintain a constant multiplication ratio. If first differences form an arithmetic progression, the second difference will be constant, indicating a quadratic pattern.

When should I use ratios?

Use ratios when terms grow exponentially or multiply dramatically (e.g., 4, 12, 36, 108). Divide each term by its predecessor. If the quotient is constant, it is a geometric series; if the multiplier increases by 1 each step (×2, ×3, ×4), it is a factorial-like expansion.

How do I recognise an alternating series?

An alternating series typically features numbers that fluctuate up and down (increase, decrease, increase, decrease) or has two distinct clusters of numbers. Separate terms at positions 1, 3, 5, 7 from terms at positions 2, 4, 6, 8 and analyze each track independently.

How do I solve alphabet series?

Immediately translate every letter into its standard numerical alphabet position (A=1, B=2, ... Z=26) using anchor mnemonics like EJOTY (5, 10, 15, 20, 25). Once in numeric form, analyze differences and wrap around from Z to A using modulo 26 arithmetic when required.

How do I solve alphanumeric series?

Deconstruct each cluster into independent letter and number components. Analyze the letter sequence and the numeric sequence on separate parallel tracks first, and then check whether the number represents the positional value or mathematical power of the letter.

How can I identify an incorrect term?

In a difference-based series, a single wrong number corrupts exactly two adjacent first differences. Locate the two corrupted differences; the number shared between those two intervals is the erroneous term. Replace it with the calculated correct value to verify that both differences and all remaining terms are restored.

Can a series have more than one valid continuation?

In pure mathematics, any finite sequence can technically be interpolated by infinitely many polynomials. However, in competitive aptitude tests, the intended answer is governed by the Principle of Parsimony (the simplest, most consistent rule requiring the fewest arbitrary assumptions that fits all provided terms).

How do I avoid overcomplicating a pattern?

Always test the basic foundational patterns first: constant difference, constant ratio, simple squares/cubes, and prime numbers. Never jump to complex polynomial formulas or obscure digit tricks until all elementary single-operation and two-track alternating rules have been tested and eliminated.

SECTION R

Related Concepts & What's Next

🚀 Topic 12: Venn Diagrams (Now Live!) Analytical Reasoning Pillar

Advance next to Venn Diagrams — master 2-set and 3-set visual logical overlaps, "Only X" regions, survey analysis, and maximum-minimum overlap optimization for CAT and MBA CET.