Skip to content

Series Formation: Number, Letter and Pattern Series

CSIR NET Part A series formation: difference tables, ratio and mixed series, interleaved series, letter series, coding-decoding, analogies and number matrices.

  • 18 min read
  • Updated
On this page · 20 sections
  1. Prerequisites
  2. The Hook: Reading a Lab Notebook Backwards
  3. The Order of Checks
  4. Difference Series
  5. Ratio and Mixed-Operation Series
  6. Series Built from Known Numbers
  7. Interleaved (Alternating) Series
  8. Fibonacci-Type Series
  9. Finding the Wrong Term
  10. Letter Series
  11. Coding and Decoding
  12. Analogies and Odd One Out
  13. Number Grids and Matrices
  14. Memory Tricks
  15. Don’t Confuse
  16. Common Mistakes
  17. Practice
  18. Quick Revision Table
  19. Key Takeaways
  20. What’s Next

Prerequisites

The Hook: Reading a Lab Notebook Backwards

The Order of Checks

Most series in aptitude papers use one of a handful of rules. Try them in roughly this order, because the earlier checks are both commoner and quicker:

graph TD
    A["Look at the terms"] --> B{"Growing slowly and steadily?"}
    B -->|"Yes"| C["1. Differences
(then second differences)"] B -->|"Growing fast"| D["2. Ratios, or x k plus c"] C --> E{"Rule found?"} D --> E E -->|"No"| F["3. Known numbers:
squares, cubes, primes, n^2 +/- 1"] F --> G["4. Two series interleaved
(odd and even positions)"] G --> H["5. Each term from the previous two
(Fibonacci-type)"] H --> I["6. Digit-based rules"] E -->|"Yes"| J["Check the rule on EVERY term,
then apply once more"]

Difference Series

First differences

Write the differences between consecutive terms underneath. If they are constant, the series is arithmetic: \( a_n = a_1 + (n-1)d \). If they themselves form a simple pattern, extend that pattern.

Second and higher differences

If the first differences are not obvious, difference them again. A constant row of second differences means the terms follow a quadratic in \( n \); a constant third row means a cubic.

Differences that are themselves known numbers

The differences may be squares, cubes, primes or powers of 2:

SeriesDifferencesNext
3, 4, 8, 17, 33, ?1, 4, 9, 16 (squares)\( 33 + 25 = 58 \)
2, 3, 5, 9, 17, ?1, 2, 4, 8 (powers of 2)\( 17 + 16 = 33 \)
10, 12, 15, 20, 27, ?2, 3, 5, 7 (primes)\( 27 + 11 = 38 \)
1, 2, 10, 37, 101, ?1, 8, 27, 64 (cubes)\( 101 + 125 = 226 \)

Ratio and Mixed-Operation Series

When the terms grow fast, divide each term by the one before.

RuleExampleNext
Constant ratio (geometric)5, 15, 45, 135405 (×3)
Increasing multiplier3, 6, 18, 72, 3602,160 (×2, ×3, ×4, ×5, ×6)
Multiply then add4, 9, 19, 39, 79159 (×2 + 1)
Multiply then subtract3, 5, 9, 17, 3365 (×2 − 1)
Alternating operations2, 6, 3, 9, 6, 1815 (×3, −3 alternately)
Multiply by n, add n1, 2, 6, 21, 88445 (×1 + 1, ×2 + 2, ×3 + 3, ×4 + 4, ×5 + 5)

Series Built from Known Numbers

Many series are a familiar sequence, slightly disguised. Keep these banks in your head:

BankValues
Squares1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400
Cubes1, 8, 27, 64, 125, 216, 343, 512, 729, 1000, 1331, 1728
Primes below 1002, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 (25 primes)
Powers of 22, 4, 8, 16, 32, 64, 128, 256, 512, 1024
Powers of 33, 9, 27, 81, 243, 729
Triangular numbers \( \frac{n(n+1)}{2} \)1, 3, 6, 10, 15, 21, 28, 36, 45, 55
Factorials1, 2, 6, 24, 120, 720
Fibonacci1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89

The common disguises:

DisguiseExampleRuleNext
\( n^2 + 1 \)2, 5, 10, 17, 26squares plus one37
\( n^2 - 1 \)0, 3, 8, 15, 24squares minus one35
\( n(n+1) \)2, 6, 12, 20, 30product of neighbours42
\( n^3 - n \)0, 6, 24, 60, 120\( (n-1)n(n+1) \)210
\( n^3 + 1 \)2, 9, 28, 65, 126cubes plus one217
Squares of primes4, 9, 25, 49, 121\( p^2 \)169
\( n^n \)1, 4, 27, 2563,125
Alternating squares and cubes1, 8, 9, 64, 25, 216odd \( n \): \( n^2 \); even \( n \): \( n^3 \)49

Interleaved (Alternating) Series

If terms rise and fall, or the differences make no sense, split the series into the terms in odd positions and the terms in even positions. Each half is usually simple.

A long series (8 or more terms given) is a hint worth testing: two series woven together need more terms to pin down than a single simple series does.

Fibonacci-Type Series

Each term depends on the two (or three) before it.

SeriesRuleNext
2, 3, 5, 8, 13, 21sum of previous two34
1, 1, 2, 4, 7, 13, 24sum of previous three44
2, 3, 6, 18, 108product of previous two1,944
1, 3, 4, 7, 11, 18sum of previous two29

Finding the Wrong Term

Some questions give a complete series with one term wrong. Find the rule that fits most of the terms, then find the term that breaks it. Change only one term.

Be careful: changing a term changes two differences. If two adjacent differences look wrong in opposite directions, the term between them is the culprit.

Letter Series

Convert letters to positions. Two tables are worth memorising:

LetterABCDEFGHIJKLM
Position12345678910111213
Reverse26252423222120191817161514
LetterNOPQRSTUVWXYZ
Position14151617181920212223242526
Reverse13121110987654321
  • Opposite letters (A–Z, B–Y, C–X, …) have positions summing to 27.
  • EJOTY marks positions 5, 10, 15, 20, 25. From these you can reach any letter in one or two steps.
  • Wrap-around: after Z comes A again. Positions are counted modulo 26.
SeriesRuleNext
C, F, I, L, O+3R
A, C, F, J, O+2, +3, +4, +5U (15 + 6 = 21)
BY, DW, FU, HSfirst letter +2, second −2 (opposite pairs)JQ
AZ, CX, EV, GTfirst +2, second −2IR
X, A, D, G+3, wrappingJ
Z, X, U, Q, L−2, −3, −4, −5F (12 − 6 = 6)
AB, DEF, HIJKblocks of 2, 3, 4 consecutive letters, skipping one letter between blocksMNOPQ

Missing-letter pattern series

Another format gives a repeated block with gaps, such as “a _ c a b _ a b c”. Find the block length from the first complete repetition (here “abc”, length 3), then fill each gap so every block is the same. The blanks are b and c, in that order. With longer strings, mark the block boundaries with a pencil stroke before filling anything.

Coding and Decoding

A word is converted by a fixed rule; you find the rule from one example and apply it to another.

Code typeExampleRule
Letter shiftLAB → MBCeach letter +1
Reverse alphabetGEL → TVOeach letter to its opposite (positions sum to 27)
Reversed word plus shiftCELL → MMFDreverse to LLEC, then +1
Position numbersCAT → 3-1-20letter positions
Position sumCAT → 243 + 1 + 20
Positional shiftDNA → EPD+1, +2, +3 by position
Word substitution“cell is called tissue, tissue is called organ”the answer uses the new name

Analogies and Odd One Out

An analogy “A : B :: C : ?” asks you to find the relation between A and B and apply it to C. An odd-one-out question asks which item breaks a property the others share. Both are series questions in disguise: find the property, then test every option.

AnalogyRelationAnswer
6 : 36 :: 9 : ?square81
3 : 28 :: 4 : ?\( n^3 + 1 \)65
7 : 50 :: 9 : ?\( n^2 + 1 \)82
BD : EG :: KM : ?each letter +3NP

Properties to test in odd-one-out items, in order: prime or composite; odd or even; perfect square or cube; divisible by 3, 7, 11; digit sum; for letter groups, vowels and the gaps between letters.

Number Grids and Matrices

A 3 × 3 grid of numbers with one missing entry: the rule usually works along rows (or columns), the same way in each row.

Rules to try in order: row sum or product equal; third = first + second (or ×, −); third = (first + second) × k; column-wise versions of the same; and the centre equal to some combination of the four around it.

Figure series (a shape rotating 45° each step, dots increasing by one) follow the same discipline: track one feature at a time (position, count, orientation, shading) and write its sequence down before looking at the options.

Memory Tricks

Don’t Confuse

ThisvsThat
\( n(n+1) \): 2, 6, 12, 20\( n^2 + 1 \): 2, 5, 10, 17
\( n^3 - n \): 0, 6, 24, 60\( n^3 - 1 \): 0, 7, 26, 63
Arithmetic (constant difference)Geometric (constant ratio)
Letter position (A = 1)Reverse position (A = 26)
Opposite letter (sum 27)Next letter (+1)
Missing term (insert a term)Wrong term (replace one term)

Common Mistakes

Practice

All questions below are original practice questions written for this page. They are not from any CSIR NET paper.

Level 1: Foundation

  1. Find the next term: 3, 5, 9, 17, 33, ?
  2. Find the next letter: B, E, H, K, ?
  3. If CAT is coded as DBU, how is DOG coded?
Answers
  1. 65. Each term is \( 2 \times \) previous \( - 1 \): \( 33 \times 2 - 1 = 65 \). (Differences 2, 4, 8, 16, 32 give the same answer.)
  2. N. Steps of +3: K (11) + 3 = 14 = N.
  3. EPH. Each letter +1.

Level 2: Part A Style

Practice Q1. Find the missing term: 2, 6, 12, 20, 30, ?

(a) 40 (b) 42 (c) 44 (d) 48

Answer: (b) 42

Differences 4, 6, 8, 10, so the next is 12: \( 30 + 12 = 42 \). Equivalently \( n(n+1) \) with \( n = 6 \).

Practice Q2. Find the wrong term: 1, 8, 27, 64, 124, 216.

(a) 8 (b) 27 (c) 124 (d) 216

Answer: (c) 124

The series is the cubes \( 1^3 \) to \( 6^3 \). The fifth term should be \( 5^3 = 125 \).

Practice Q3. Find the missing term: 1, 3, 4, 9, 7, 27, 10, ?

(a) 13 (b) 54 (c) 81 (d) 30

Answer: (c) 81

Odd positions: 1, 4, 7, 10 (+3). Even positions: 3, 9, 27, ? (×3). The missing term is in an even position: \( 27 \times 3 = 81 \). Option (a), 13, is the next odd-position term, which is the trap.

Practice Q4. Find the next term: AZ, CX, EV, GT, ?

(a) HS (b) IR (c) IS (d) JQ

Answer: (b) IR

First letters: A, C, E, G, I (+2). Second letters: Z, X, V, T, R (−2). Each pair is also an opposite pair (positions summing to 27: A–Z, C–X, E–V, G–T, and I–R is 9 + 18 = 27). Both rules agree on IR.

Practice Q5. In a code, each letter is replaced by its opposite letter (A by Z, B by Y, and so on). How is GEL written?

(a) TVO (b) TUO (c) SVO (d) HFM

Answer: (a) TVO

Opposites sum to 27: G (7) → 20 = T; E (5) → 22 = V; L (12) → 15 = O. Option (d) is the +1 shift, a different code.

Level 3: Multi-Step (Part C depth)

Practice Q6. Find the next term: 0, 6, 24, 60, 120, 210, ?

(a) 294 (b) 320 (c) 336 (d) 343

Answer: (c) 336

The terms are \( n^3 - n = (n-1)n(n+1) \) for \( n = 1, 2, \ldots \): \( 0, 6, 24, 60, 120, 210 \). For \( n = 7 \): \( 6 \times 7 \times 8 = 336 \).

Check by differences: 6, 18, 36, 60, 90; second differences 12, 18, 24, 30; third differences constant at 6 (a cubic, as expected). Next second difference 36, next first difference 126, next term \( 210 + 126 = 336 \).

Practice Q7. Find the missing number.

Row 13425
Row 2512169
Row 3815?

(a) 225 (b) 279 (c) 289 (d) 361

Answer: (c) 289

Each row: third = (first)\(^2\) + (second)\(^2\). \( 9 + 16 = 25 \), \( 25 + 144 = 169 \), \( 64 + 225 = 289 \).

Practice Q8. Consider the sequence 1, 1, 2, 3, 5, 8, 13, 21, … in which each term is the sum of the previous two. Which of the following statements are correct?

  1. Every third term is even.
  2. The sum of the first \( n \) terms equals the \( (n+2) \)-th term minus 1.
  3. The ratio of consecutive terms approaches 1.5.

(a) 1 only (b) 1 and 2 only (c) 2 and 3 only (d) 1, 2 and 3

Answer: (b) 1 and 2 only
  1. The pattern of odd and even is odd, odd, even, repeating (odd + odd = even, odd + even = odd, even + odd = odd). So the 3rd, 6th, 9th… terms (2, 8, 34, …) are even. True.
  2. Check: first 5 terms sum to \( 1 + 1 + 2 + 3 + 5 = 12 \), and the 7th term is 13; \( 13 - 1 = 12 \). The identity holds for all \( n \) by induction. True.
  3. The ratio approaches the golden ratio, about 1.618, not 1.5: \( 21/13 \approx 1.615 \). False.

Quick Revision Table

CheckClueExample
Differencesslow, steady growth5, 11, 19, 29, 41 → 55
Second differencesfirst differences change steadily1, 3, 8, 18, 35 → 61
Ratiosfast growth3, 6, 18, 72, 360 → 2,160
× k ± cratio close to constant, not exact4, 9, 19, 39 → 79
Known numbersvalues near squares or cubes2, 5, 10, 17 → 26
Interleavedterms go up and down1, 3, 4, 9, 7, 27, 10 → 81
Fibonacci-typeeach term near the sum of two before2, 3, 5, 8, 13 → 21
Wrong termone term spoils two differences3, 7, 15, 31, 64, 127
Lettersconvert to positions; EJOTY; opposites sum 27AZ, CX, EV, GT → IR
Codesderive the rule from the example, apply exactlyROOT → SPPU, LEAF → MFBG

Key Takeaways

What’s Next