8.1 Number Series, Letter Series, Coding-Decoding & Relationships

8.1 Number Series, Letter Series, Coding-Decoding & Relationships

Core Principle: Mathematical reasoning in competitive examinations is not a test of arbitrary calculation tricks or intuitive guesswork. It is a systematic diagnostic of pattern recognition, algebraic symmetry, spatial coordinate tracking, and relational network deduction. By mastering standardized diagnostic protocols, candidates transform seemingly opaque sequences and coded puzzles into deterministic mathematical operations.

---

1. Mathematical and Logical Reasoning in CG SET Paper I: Blueprint and Epistemological Scope

In the Chhattisgarh State Eligibility Test (CG SET) Paper I, Unit 5: Mathematical Reasoning and Aptitude occupies a pivotal deterministic role. CG SET follows the UGC Paper I syllabus, and this unit evaluates an aspirant's foundational computational fluency, structural logic, and capacity to abstract relationships from symbolic data. Under the UGC note of five 2-mark questions per unit, Unit 5 usually accounts for 5 questions (10 marks), representing 10% of the total Paper I score.

While general awareness units require extensive empirical recall of environmental pacts or educational commissions, mathematical reasoning is completely algorithmic and self-verifiable. A candidate who methodically deconstructs the underlying rule can achieve an absolute 100% accuracy rate (10/10 marks), providing a crucial competitive buffer for Paper I qualification.

Core Cognitive Modalities Tested in Unit 5

Questions in Unit 5 test four primary cognitive modalities:

1. Inductive Numerical Pattern Recognition: Identifying the mathematical progression governing an ordered sequence of numbers to extrapolate a missing term or identify an erroneous outlier.
2. Symbolic and Positional Decoupling: Translating alphabetic characters into numerical coordinates, manipulating modular cyclic shifts, and deciphering linguistic cipher algorithms.
3. Spatial Vector Analysis: Mapping spatial trajectories across two-dimensional cardinal coordinates, tracking angular rotations, and computing net Euclidean displacement.
4. Relational Network Deduction: Deconstructing multi-generational genealogical statements into formal family-tree networks and decoding symbolic kinship operators.

Types of Reasoning

The UGC syllabus opens Unit 5 with types of reasoning. The main types are:

Number and letter series questions are mainly inductive, because you infer the rule from the terms given. Blood-relation and direction questions are deductive, because the answer follows necessarily from the statements. Section 9.1 covers deductive, inductive, abductive and analogical reasoning in more depth.

---

2. Number Series Mastery & Diagnostic Workflow

A number series is an ordered sequence of real numbers generated according to a specific, invariant mathematical rule. In CG SET Paper I, questions typically present a sequence with one omitted value indicated by a question mark ($?$) or ask candidates to detect the single "wrong term" that violates the governing rule.

Primary Architectural Patterns of Number Series

Candidates must be thoroughly conversant with the eight primary mathematical archetypes encountered in examination series:

1. Arithmetic Progressions (AP) & Linear Difference Series

The difference between successive terms is a constant scalar $d$:

$T_n = T_{n-1} + d \implies T_n = a + (n - 1)d$

• Example: $7, 13, 19, 25, 31, \dots$ (Common difference $d = +6$).

2. Arithmetic of Second Differences (Polynomial / Triangular Series)

The primary differences between consecutive terms ($\Delta_1$) are not constant, but the differences of those differences ($\Delta_2$) form a constant arithmetic progression. These series reflect underlying quadratic polynomials of the form $T_n = an^2 + bn + c$.

• Example: $3, 8, 17, 30, 47, \dots$
  • First differences ($\Delta_1$): $5, 9, 13, 17$
  • Second differences ($\Delta_2$): $+4, +4, +4$ (Constant)
  • Next $\Delta_1 = 17 + 4 = 21 \implies \text{Next term} = 47 + 21 = 68$.

3. Geometric Progressions (GP) & Multiplicative Series

Each successive term is produced by multiplying the preceding term by a constant non-zero common ratio $r$:

$T_n = T_{n-1} \times r \implies T_n = a \cdot r^{n-1}$

• Example: $4, 12, 36, 108, 324, \dots$ ($r = 3$).
• Fractional / Decimal Multipliers: Series frequently involve multipliers such as $\times 0.5, \times 1.5, \times 2.5, \dots$ (e.g., $8, 4, 6, 15, 52.5, \dots$).

4. Hybrid Arithmetic-Geometric Series ($a \cdot T_{n-1} \pm k$)

Each term is generated by multiplying the prior term by a factor and then adding or subtracting a constant or progressive integer:

• Example: $2, 5, 12, 27, 58, \dots$
  • $2 \times 2 + 1 = 5$
  • $5 \times 2 + 2 = 12$
  • $12 \times 2 + 3 = 27$
  • $27 \times 2 + 4 = 58$
  • Next term: $58 \times 2 + 5 = 116 + 5 = 121$.

5. Exponential Square and Cube Series ($n^2 \pm k, n^3 \pm k$)

Terms are anchored to integer powers. Mastery requires instant mental recognition of the first 25 squares and the first 12 cubes:

Classic Exam Sequence: $0, 6, 24, 60, 120, 210, ?$. Recognizing the $n^3 - n$ benchmark immediately reveals the next term for $n=7$ as $7^3 - 7 = 343 - 7 = 336$.

6. Alternating / Interleaved Sequences

Two distinct mathematical series are interleaved into a single visible sequence, occupying alternate positions. Odd indices follow one rule while even indices follow an entirely independent rule.

• Example: $4, 20, 7, 17, 10, 14, 13, 11, ?$
  • Sub-series 1 (Odd positions: 1st, 3rd, 5th, 7th, 9th): $4, 7, 10, 13, ?$ $\implies$ Common difference $+3$. Next term $= 16$.
  • Sub-series 2 (Even positions: 2nd, 4th, 6th, 8th): $20, 17, 14, 11$ $\implies$ Common difference $-3$.

7. Prime Number Progressions

Sequences governed by consecutive prime numbers: $2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, \dots$

• Critical Caution: $1$ is neither prime nor composite. $2$ is the only even prime number. $9, 15, 21, 25, 27, 33, 35$ are composite and must never be mistaken for primes.

8. Fibonacci & Recursive Additive Series

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

• Standard: $1, 1, 2, 3, 5, 8, 13, 21, 34, 55, \dots$
• Modified: $2, 3, 5, 8, 13, 21, 34, \dots$
• Tribonacci: $T_n = T_{n-1} + T_{n-2} + T_{n-3}$ (e.g., $1, 2, 3, 6, 11, 20, 37, \dots$).

---

Systematic 5-Step Diagnostic Protocol for Unknown Number Series

When confronted with an unfamiliar series under exam pressure, candidates should avoid random arithmetic attempts and execute this structured 5-step diagnostic workflow:

Step 1: Inspect Growth Trajectory
        ├── Steep / Exponential Growth ──> Test Geometric (× r) or Powers (n², n³)
        └── Moderate / Linear Growth    ──> Test Arithmetic Differences

Step 2: Calculate Level 1 Differences (Δ₁)
        ├── Constant Difference?        ──> Pure Arithmetic Progression identified
        └── Non-constant?               ──> Proceed to Step 3

Step 3: Calculate Level 2 Differences (Δ₂)
        ├── Constant Second Difference?  ──> Quadratic Polynomial series (an² + bn + c)
        └── Patterned (e.g., +2, +4, +6)?──> Triangular progression solved

Step 4: Benchmark Power Test
        └── Check distance from nearest perfect squares (n² ± k) or cubes (n³ ± k)

Step 5: Structural & Positional Tests
        ├── Values oscillating up & down? ──> Interleaved / Alternating series
        ├── Digits summing / reversing?   ──> Internal digit manipulation rule
        └── Unbroken prime sequence?      ──> Prime number progression

---

3. Letter Series and Alpha-Numeric Progressions

Letter series test the candidate's understanding of the English alphabet as a closed cyclic mathematical group of order 26 (modulo 26 arithmetic).

3.1 Forward and Reverse Positional Values

Every letter holds two intrinsic numerical coordinates:

• Forward Positional Value: $A = 1, B = 2, \dots, Z = 26$.
• Reverse Positional Value (Backward Rank): $A = 26, B = 25, \dots, Z = 1$.

Forward:  A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z
Rank:     1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
Reverse: 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10  9  8  7  6  5  4  3  2  1

The Rule of 27 (Opposite Letter Invariant)

A fundamental mathematical property links the forward and reverse coordinates of any letter:

$\text{Forward Position} + \text{Reverse Position} = 27$

Consequently, two letters are diametrically opposite in the 26-letter alphabet if their forward positional values sum to exactly 27:

$\text{Pos}(L_1) + \text{Pos}(L_2) = 27$

High-Speed Positional Anchors: The EJOTY and CFILORUX Systems

Rather than counting fingers from A during the exam, memorize the five-interval EJOTY benchmark:

• $E = 5$
• $J = 10$
• $O = 15$
• $T = 20$
• $Y = 25$

To identify any letter, anchor to the nearest EJOTY landmark (e.g., $S$ is one before $T = 20 \implies S = 19$; $M$ is two before $O = 15 \implies M = 13$).

Alternatively, utilize the three-interval CFILORUX system: $C(3), F(6), I(9), L(12), O(15), R(18), U(21), X(24)$.

3.2 Modulo 26 Cyclic Shifts

Letter series frequently loop around the end of the alphabet. Under modulo 26:

• Moving forward past $Z$: $25(Y) \to 26(Z) \to 1(A) \to 2(B)$.
• Moving backward past $A$: $3(C) \to 2(B) \to 1(A) \to 26(Z) \to 25(Y)$.

---

4. Coding-Decoding Paradigms

Coding-decoding evaluates the ability to infer an encryption cipher applied to a known string and apply that exact cipher to encrypt or decrypt a target string.

4.1 Letter-to-Letter Coding

1. Constant Scalar Shift: Every character is shifted by $+k$ or $-k$ positions (e.g., each letter $+3$).
2. Progressive Positional Shift: Successive letters shift by increasing intervals: 1st letter $+1$, 2nd letter $+2$, 3rd letter $+3$, etc.
3. Reverse Order Inversion: The word is reversed end-to-end, or divided into two halves and each half reversed internally.
4. Opposite Letter Coding: Every letter is replaced by its Rule of 27 counterpart ($A \to Z, B \to Y, C \to X$).
5. Cross-Pair Shifts: In a 6-letter word, letters 1 and 2 swap with shifts, letters 3 and 4 swap, and letters 5 and 6 swap.

4.2 Number and Symbol Coding

• Direct Positional Summation: The code equals the arithmetic sum of forward positional values.
  • Example: $\text{CAT} = 3 + 1 + 20 = 24$.
• Reverse Positional Summation: The code equals the sum of reverse values.
  • Example: $\text{CAT} = (27 - 3) + (27 - 1) + (27 - 20) = 24 + 26 + 7 = 57$.
• Positional Product or Digit Sum: Multiplying coordinates or summing individual digits of coordinates.
• Direct Symbol Assignment: Characters are mapped one-to-one to specific punctuation marks or digits without mathematical operations (e.g., R = 5, E = #, A = 9, D = $).

4.3 Substitution Coding (Fictional Nomenclature)

In substitution coding, names of everyday objects are arbitrarily mapped to other words (e.g., "If blue is called red, red is called green, green is called white, and white is called yellow, what is the color of clear sky?").

• The Direct Resolution Rule: Determine the true real-world factual answer first (Clear sky is blue). Then identify the single code word that blue is called (Blue is called red). The correct answer is red. Never chain substitutions through multiple levels.

4.4 Deciphering Message / Sentence Codes (Common Word Elimination)

In sentence coding, multi-word statements are encrypted into nonsense syllable codes. The assignment of code syllables to words is scrambled.

• Given:
  1. "pic vic nic" means "winter is cold"
  2. "to nic re" means "summer is hot"
  3. "re pic maj" means "winter was hot"
• Elimination Protocol:
  • Compare (1) and (2): Common word is "is"; common code is "nic" $\implies \text{is} = \text{nic}$.
  • Compare (1) and (3): Common word is "winter"; common code is "pic" $\implies \text{winter} = \text{pic}$.
  • From (1), remaining word is "cold" and remaining code is "vic" $\implies \text{cold} = \text{vic}$.
  • Compare (2) and (3): Common word is "hot"; common code is "re" $\implies \text{hot} = \text{re}$.
  • From (2), remaining word is "summer" and code is "to" $\implies \text{summer} = \text{to}$.
  • From (3), remaining word is "was" and code is "maj" $\implies \text{was} = \text{maj}$.

---

5. Direction and Distance Sense Tests

Direction sense questions test orientation in two-dimensional Euclidean space. All movements must be modeled upon a standardized Cartesian coordinate plane.

                     North (+y)
                         │
         North-West      │      North-East
             (NW)        │        (NE)
                         │
West (-x) ───────────────┼─────────────── East (+x)
                         │
         South-West      │      South-East
             (SW)        │        (SE)
                         │
                     South (-y)

5.1 Cardinal Directions and Angular Vectors

• Four Cardinal Directions: North ($0^\circ / 360^\circ$), East ($90^\circ$), South ($180^\circ$), West ($270^\circ$).
• Four Intercardinal (Ordinal) Directions: North-East ($45^\circ$), South-East ($135^\circ$), South-West ($225^\circ$), North-West ($315^\circ$).
• Turning Rules:
  • Right Turn: Always corresponds to a $90^\circ$ clockwise rotation.
  • Left Turn: Always corresponds to a $90^\circ$ counter-clockwise (anti-clockwise) rotation.
  • Facing North: Right = East ($+x$), Left = West ($-x$).
  • Facing South: Right = West ($-x$), Left = East ($+x$) (Direction orientation reverses!).
  • Facing East: Right = South ($-y$), Left = North ($+y$).
  • Facing West: Right = North ($+y$), Left = South ($-y$).

5.2 Shortest Displacement via the Pythagorean Theorem

To compute the net shortest distance between a traveler's terminal position and their origin, sum all horizontal displacements ($\Delta x$) and vertical displacements ($\Delta y$):

$\text{Net Horizontal Displacement } (\Delta x) = \sum x_{\text{East}} - \sum x_{\text{West}}$ $\text{Net Vertical Displacement } (\Delta y) = \sum y_{\text{North}} - \sum y_{\text{South}}$

The straight-line Euclidean distance $D$ is given by the Pythagorean theorem:

$D = \sqrt{(\Delta x)^2 + (\Delta y)^2}$

Common Pythagorean Triples in Examination Problems

Recognizing integer triples eliminates long square-root calculations:

• $(3, 4, 5)$ and its multiples: $(6, 8, 10)$, $(9, 12, 15)$, $(12, 16, 20)$
• $(5, 12, 13)$ and its multiples: $(10, 24, 26)$
• $(8, 15, 17)$
• $(7, 24, 25)$
• $(9, 40, 41)$

---

6. Blood Relationships & Family Tree Modeling

Blood relationship problems evaluate deductive reasoning over kinship structures. To avoid cognitive overload from complex narrative descriptions, candidates should map relationships into a standardized visual Family Tree Diagram.

6.1 Standardized Family Tree Notational Conventions

                  Grandfather [+] ════ Grandmother [-]
                                    │
             ┌──────────────────────┴──────────────────────┐
             │                                             │
       Father [+] ════ Mother [-]                      Uncle [+]
                    │
     ┌──────────────┴──────────────┐
     │                             │
Self [+]                        Sister [-] ════ Brother-in-law [+]

6.2 Key Relational Nomenclature and Distinctions

• Paternal vs. Maternal Lines:
  • Paternal grandfather/grandmother: Father's parents.
  • Maternal grandfather/grandmother: Mother's parents.
  • Paternal uncle: Father's brother (Chacha).
  • Maternal uncle: Mother's brother (Mama).
• Nephew vs. Niece:
  • Nephew: Brother's or sister's son.
  • Niece: Brother's or sister's daughter.
• In-Law Relationships:
  • Father-in-law / Mother-in-law: Spouse's father / mother.
  • Brother-in-law: Spouse's brother OR sister's husband.
  • Sister-in-law: Spouse's sister OR brother's wife.
• Cousin: Child of an aunt or uncle (independent of paternal/maternal distinction).

6.3 Coded Blood Relations

In advanced SET problems, kinship is expressed via symbolic algebraic operators (e.g., $P + Q$ means $P$ is father of $Q$; $P - Q$ means $P$ is sister of $Q$; $P \times Q$ means $P$ is brother of $Q$; $P \div Q$ means $P$ is mother of $Q$).

The Two-Step Elimination Protocol for Coded Relations

1. The Gender Filter: If the question asks for a male relationship (e.g., "A is the uncle of B"), immediately inspect the symbol following $A$. If the operator defines $A$ as female, eliminate that option instantly without drawing the tree.
2. The Generation Gap Calculator: Assign numerical generation values:
   • Parents, Uncles, Aunts: $+1$
   • Grandparents: $+2$
   • Siblings, Spouses, Self, Cousins: $0$
   • Children, Nephews, Nieces: $-1$
   • Grandchildren: $-2$ Sum the generation values across the expression. If the target relationship requires a net generation gap of $+1$, any expression yielding $0, -1$, or $+2$ is mathematically impossible.

---

7. Exam Traps & Common Errors in Unit 5

• Trap 1: The First Difference Fallacy in Number Series: Stopping analysis after calculating first differences ($\Delta_1$) and assuming no pattern exists. Always compute second differences ($\Delta_2$) or test distances from adjacent squares ($n^2 \pm k$) and cubes ($n^3 \pm k$).
• Trap 2: The Left/Right Inversion Trap When Facing South or West: When a problem states "traveling South, they turned right", candidates instinctively map right as East. In reality, facing South ($-y$) inverts orientation: a right turn points West ($-x$).
• Trap 3: Presuming Gender from Names or Indirect Association: In blood relationships, never assume a person is male or female based on cultural names (e.g., "Kiran", "Suman"). Gender is determined strictly if explicitly designated by a kinship title (e.g., "father", "sister", "wife") or coded gender operator.
• Trap 4: Forgetting the Rule of 27 in Letter Coding: Manually counting letters backward from $Z$ wastes critical seconds. Utilize $\text{Reverse Rank} = 27 - \text{Forward Rank}$ for instant, error-free reverse mapping.