Module 4 · Agniveer Reasoning

Series

Updated 17 Nov 2026 · 6,039 words · illustrated
Updated 21 Nov 2026
Number and alphabet series.
Number Series · Alphabet Series
🎯 Take Mock Test
Spot Pattern TypeSeparate Letters &NumbersAnalyze LetterSequenceAnalyze NumberSequencePositional: A=1,B=2Skipping: A, C, E,GAlternating: A1,B2, C3Prime/Square Nos:2,3,5,7Reverse Order: Z=1,Y=2Cyclic: A, B, C, A,BMixed Ops: +2, ×3,-1Exam Hook: 2-3 questions yearly; target 30 sec eachKey: Write positions; check differences; test optionsvlymbooq
Number Alphabet Series Solving Chain — Shows the 4-step method to crack alpha-numeric series with common pattern types. · Open the full diagram →

Learning Objectives

  • Understand the fundamental concepts of Series
  • Apply key formulas and techniques to solve problems
  • Practice with exam-level questions to build speed and accuracy

What are Number & Alphabet Series?

Series questions present a sequence of numbers, letters, or a combination of both, and you must identify the pattern and find the missing term or the next term. This is one of the most common topics in the reasoning section, typically with 2-4 questions per exam.

Types of Series

1. Number Series: Sequences of numbers with a consistent pattern — arithmetic progression (common difference), geometric progression (common ratio), Fibonacci-like (each term is sum of previous two), alternating operations, digit-based patterns, or a combination.

2. Alphabet Series: Sequences of letters based on their positional values (A=1 to Z=26). Patterns can involve +n, -n, ×n, or alternating patterns between consecutive letters. Sometimes letters are grouped in pairs or triples with a consistent transformation.

3. Mixed Series: A combination of numbers and letters, or two interleaved series running together. Identify the two separate patterns.

4. Missing Term Series: One term is replaced with '?' and you must find it based on the pattern of surrounding terms.

Solved Examples

Example 1 (Number Series)
Find the next term: 2, 6, 18, 54, ?

a) 108 b) 162 c) 216 d) 144
Solution: b) 162. Each term is multiplied by 3: 2×3=6, 6×3=18, 18×3=54, 54×3=162. This is a geometric progression with common ratio 3.
Example 2 (Alphabet Series)
Find the next term: B, E, H, K, ?

a) M b) N c) O d) P
Solution: b) N. Positions: B=2, E=5, H=8, K=11. Each term advances by +3. Next: 11+3=14 = N.
Example 3 (Mixed/Alternating Series)
Find the missing term: 3, 7, 15, ?, 63, 127

a) 29 b) 31 c) 33 d) 35
Solution: b) 31. Pattern: each term is 2ⁿ - 1. 3 = 2²-1, 7 = 2³-1, 15 = 2⁴-1, ? = 2⁵-1 = 31, 63 = 2⁶-1, 127 = 2⁷-1.

Shortcut Techniques

  • Check for difference patterns first: subtract consecutive terms and see if the differences form a pattern (constant, increasing, alternating).
  • If differences don't work, check ratio patterns: divide consecutive terms.
  • For alphabet series, convert letters to numbers immediately. Write A=1 through Z=26 and decode the pattern.
  • For alternating series, look at every alternate term (1st, 3rd, 5th... and 2nd, 4th, 6th...) separately.
  • Prime numbers, squares, cubes, and powers of 2 are common patterns.
Pro Tip
For number series, always check the simplest pattern first — addition or subtraction of a constant. If that doesn't work, try multiplicative patterns or alternating operations. Most SSC series questions use simple arithmetic patterns.

Advanced Problem Types

Competitive exams feature advanced variations combining multiple reasoning concepts. Master these to score high.

Multi-Step Problems

Some questions require applying multiple reasoning techniques sequentially. Break problems into clear steps.

Common Traps

  • Assuming a pattern continues without checking all elements
  • Misinterpreting negative statements in syllogisms
  • Forgetting wrapping in alphabet coding (Z to A transition)
  • Confusing directions (East vs West)
  • Overlooking either-or cases in syllogisms
  • Not considering all possible arrangements in puzzles
Pro Tip
For puzzles, start with the most concrete clue and build around it. Draw diagrams for seating arrangements and family trees for blood relations.

Recursive and Self‑Referential Series

Recursive series define each term by referring to one or more preceding terms rather than by a simple arithmetic or geometric rule. The most common recursive pattern in competitive exams is the linear recurrence of order two: Tn = a·Tn‑1 + b·Tn‑2. Fibonacci‑type sequences (a = b = 1) appear frequently, but examiners also use variations such as Tn = 2·Tn‑1 + 3·Tn‑2 or Tn = Tn‑1 + n. Recognising a recursive pattern requires computing successive differences and checking whether the differences themselves follow a known series. When the first‑order differences are not constant but the second‑order differences become constant, the underlying rule is quadratic; when the second‑order differences follow a geometric progression, the rule is often a mixed recursive‑geometric form.

Self‑referential series embed the term index inside the formula, for example Tn = n² + 2ⁿ or Tn = n·Tn‑1. These appear in “missing term” questions where the position of the missing term is given (e.g., “Find the 7th term”). The solving strategy is to write the general term explicitly, then substitute the required index. A useful shortcut is to generate the first five terms manually; if they match the given series, the hypothesised formula is almost certainly correct. Examiners sometimes disguise a recursive rule by presenting only the first four terms and asking for the sixth, forcing the candidate to extend the recurrence twice.

Typical traps include assuming a simple multiplicative pattern when the recurrence involves addition of the index, or ignoring the initial conditions (the first two terms) which uniquely determine a second‑order recurrence. Always verify the recurrence against at least three consecutive given terms before projecting forward.

Polynomial and Factorial Patterns

Polynomial series arise when the nth term is a polynomial in n of degree two or higher. Quadratic series (degree 2) produce constant second differences; cubic series (degree 3) produce constant third differences. The method of finite differences is the standard tool: write the series, compute successive difference rows until a constant row appears, then reconstruct the missing term by working backwards. For example, the series 2, 5, 10, 17, ? yields first differences 3, 5, 7 and second differences 2, 2 – a constant second difference of 2 signals a quadratic term n². The missing term is 26 (5² + 1).

Factorial‑based series involve terms like n!, (n+1)!/2, or products of consecutive integers such as n·(n+1)·(n+2). These grow faster than any polynomial and are often combined with addition or subtraction of a constant. A classic pattern is Tn = n! + n giving 2, 4, 9, 28, ? (next = 5! + 5 = 125). Recognising factorial growth is easier when the ratio of successive terms increases roughly by the index: Tn+1/Tn ≈ n+1 for large n. Examiners may also use double factorials (e.g., 1·3·5·…·(2n‑1)) or sub‑factorial (derangement) numbers, but these are rare and usually accompanied by a hint such as “product of odd numbers”.

When a series mixes polynomial and factorial components (e.g., Tn = n² + n!), the factorial term dominates after n ≥ 4, so the early terms reveal the polynomial part while later terms expose the factorial. The solving approach: compute the first few terms, separate the dominant growth, and test hypothesised formulas against all given terms.

Worked Example – Mixed Polynomial‑Factorial Series
Find the missing term: 3, 7, 16, 35, ?
Compute first differences: 4, 9, 19. Second differences: 5, 10. Third differences: 5 (constant). Constant third difference indicates a cubic polynomial. Assume Tn = an³ + bn² + cn + d. Using n=1..4 gives four equations. Solving yields a = 5/6, b = 0, c = 1/6, d = 2. The formula simplifies to Tn = (5n³ + n)/6 + 2. For n=5: (5·125 + 5)/6 + 2 = (625+5)/6 + 2 = 630/6 + 2 = 105 + 2 = 107. Answer: 107.
Exam‑Day Strategy
When a series shows rapidly increasing gaps, write the first three difference rows immediately. If the third row becomes constant, you have a cubic; if the second row becomes constant, you have a quadratic. For factorial‑type growth, compute the ratio of successive terms – a ratio that grows by roughly 1 each step signals a factorial component. Always test the derived formula on the first two given terms before trusting it for the missing term.

Alphabet Positional Transformations

Alphabet series often rely on positional arithmetic modulo 26. The basic mapping A=1 … Z=26 allows conversion of any letter to a number, after which standard number‑series techniques apply. Common transformations include constant forward or backward shifts (Caesar cipher), alternating shifts (+2, –1, +2, –1), and multiplicative shifts (position × k mod 26). Because the alphabet wraps, a shift that exceeds 26 continues from A; equivalently, compute (position + shift – 1) mod 26 + 1. Examiners also use the reverse alphabet (Z=1, Y=2 … A=26) which is equivalent to the transformation 27 – position.

More advanced patterns combine two independent sequences on odd and even positions. For instance, the series A, C, E, G, ? on odd positions follows +2, while the even positions B, D, F, H follow +2 as well, but the two subsequences may have different starting points or step sizes. Another frequent device is the “prime‑position” series: letters whose positions are prime numbers (2, 3, 5, 7, 11, 13, 17, 19, 23) appear in order – B, C, E, G, K, M, Q, S, W. Recognising prime positions requires memorising primes up to 26.

Letter‑pair series (e.g., AB, CD, EF, ?) treat each pair as a single unit; the pattern may be a shift of the whole pair or an internal transformation (first letter +1, second letter +2). When pairs are given, convert each letter separately, then look for a consistent vector (Δ₁, Δ₂) applied to each pair. If the vector changes, examine the sequence of vectors as a secondary series.

Combined Number‑Alphabet Coding

Hybrid series intermix numbers and letters, often representing a single underlying rule applied to a combined alphabet‑numeric sequence such as A1, B2, C3, … or a matrix coordinate system (row letter, column number). The most common coding is “letter = position, number = position²” or “letter = position, number = position + constant”. To decode, write the parallel numeric series for letters and numbers side by side, then search for a relationship linking the two columns. For example, A2, C5, E10, G17, ? yields letter positions 1,3,5,7 (odd numbers) and numbers 2,5,10,17 (n²+1). The next letter position is 9 → I, next number 5²+1 = 26 → I26.

Another pattern uses the ASCII/Unicode code points: ‘A’=65, ‘B’=66 …; the series may present the decimal codes directly (65, 66, 68, 71, ?) where the differences follow a known number series. Converting back to characters after solving the numeric part is a quick verification step. Examiners also employ “columnar transposition” where a keyword determines the order of letters; the series then shows the keyword letters followed by the remaining alphabet in order. Recognising a keyword requires spotting a non‑alphabetical block at the start of the series.

When a series alternates between a pure number and a pure letter (e.g., 2, B, 4, D, 6, ?), treat them as two independent sequences: even numbers 2,4,6,… and even‑position letters B, D, F,… The missing term is the next letter F. Always separate the two streams before hunting for a cross‑stream rule; cross‑stream rules are rare and usually explicitly hinted (“each number indicates the shift for the following letter”).

Series with Modular Arithmetic and Wrapping

Modular arithmetic appears explicitly when a series is defined “mod m”. The most frequent modulus in alphabet questions is 26; in number series, mod 10 (units digit) or mod 9 (digital root) are common. A term defined as Tn = (a·n + b) mod m produces a repeating cycle of length m/gcd(a,m). For instance, Tn = (3n + 1) mod 10 yields 4, 7, 0, 3, 6, 9, 2, 5, 8, 1, then repeats. Recognising the cycle length allows instant prediction of any far‑away term without generating all intermediate terms.

Wrapping in alphabet series is a direct application of mod 26. A shift of +30 is equivalent to +4 because 30 ≡ 4 (mod 26). When a series uses a variable shift that itself follows a pattern (e.g., shift = n² mod 26), compute the shift sequence first, then apply cumulatively. Cumulative modular sums appear in “running total” series: start at A (1), add 2 → C (3), add 3 → F (6), add 5 → K (11), add 7 → R (18) – the added numbers are primes. The position after each step is (previous position + prime) mod 26.

Digital‑root series (mod 9) are popular in number‑only questions: each term is replaced by the sum of its digits until a single digit remains. The series 19, 28, 37, 46, ? all have digital root 1; the next number with digital root 1 is 55. A shortcut: the digital root of n is 1 + ((n‑1) mod 9). Use this to test candidate answers quickly.

  • Assuming a constant difference when the second‑order difference is constant (quadratic) or when the ratio of successive terms grows linearly (factorial).
  • Ignoring the wrap‑around in alphabet shifts and treating Z + 1 as a non‑existent symbol instead of A.
  • Applying a single recurrence to a mixed number‑letter series without separating the two streams first.
  • Overlooking the initial conditions of a recursive definition, leading to a wrong projection after the first missing term.
  • Confusing digital‑root (mod 9) with units‑digit (mod 10) patterns when the series contains numbers ending in zero.
  • Treating a prime‑position alphabet series as a simple +2 step and missing the irregular gaps after 23.
  • Failing to verify a hypothesised formula against at least three given terms before using it to compute the answer.

Matrix‑Coordinate Series and Grid Traversal

Matrix‑coordinate series treat each term as a cell in a two‑dimensional grid. The grid may be square (n × n) or rectangular, and the series follows a deterministic traversal rule such as row‑major order, column‑major order, diagonal sweeps, knight‑move jumps, or spiral paths. The first step in solving such a series is to reconstruct the implicit grid dimensions. If the series supplies explicit coordinates (e.g., A1, B3, C5) the row letter and column number can be converted to numeric indices (row = 1…n, column = 1…m). When only a single alphanumeric token appears (e.g., B2, D4, F6) the pattern often encodes a vector (Δrow, Δcol) that repeats or evolves. A constant vector produces an arithmetic progression on the grid; a vector that itself follows a secondary series (e.g., Δrow = 1,2,3,… and Δcol = 2,2,2,…) yields a quadratic trajectory. Spiral traversals are common in examinations: starting at the centre or a corner, the path moves right, up, left, down with step lengths 1,1,2,2,3,3,… Recognising the step‑length pattern allows direct computation of the k‑th coordinate without simulating the whole spiral. Knight‑move series (Δrow,Δcol) ∈ {(±2,±1),(±1,±2)} appear in chess‑themed questions; the sequence of moves may follow a fixed order (e.g., all eight moves cyclically) or a pattern derived from a number series (e.g., move = nth prime mod 8). In all cases, separating the row and column streams, converting letters to 1‑based indices, and analysing each stream independently before recombining is the most reliable method.

Exceptions arise when the grid is not fully populated. Sparse grids may contain “holes” that the series skips, effectively applying a filter such as “only cells whose row + col is prime”. The filter can be detected by listing the first few coordinates, computing the skipped indices, and testing simple arithmetic properties (primality, parity, digital root). Another twist is a toroidal grid where moving off one edge wraps to the opposite edge (modular arithmetic on both axes). This is equivalent to performing all coordinate arithmetic modulo the grid dimensions. When wrapping is present, the series never terminates; the period is the least common multiple of the row‑period and column‑period. A practical shortcut: compute the row and column sequences modulo their respective dimensions, then combine the results using the Chinese Remainder Theorem if the two moduli are coprime. Finally, some series encode the grid coordinates in a single integer using a mixed‑radix representation (e.g., index = (row − 1) × m + col). In that case the problem reduces to a pure number series, and the grid interpretation is only a verification layer.

Examiners frequently combine matrix traversal with alphabet positional transformations. For instance, a series may list cells as “A1, C3, E5, …” where the letter increments by 2 and the number increments by 2, but the underlying grid is 8 × 8 and the series stops at the edge. The next term would wrap to the next row if a toroidal rule is stated, or the series would end if the grid is bounded. Always read the wording for “continues indefinitely” versus “within the grid”. A bounded grid without wrapping produces a finite series; the missing term may be the last valid cell before the boundary. In such cases, compute the maximum steps possible in the current direction before hitting the edge, then apply the direction‑change rule (turn right, reverse, etc.) to find the next cell.

When the series presents only the alphanumeric labels without explicit grid size, infer the dimensions from the range of letters and numbers observed. If letters go up to H and numbers up to 8, an 8 × 8 board is implied. If the range is asymmetric (letters A‑J, numbers 1‑5), the grid is 10 × 5. Once dimensions are fixed, test the simplest traversal hypotheses in order: row‑major, column‑major, diagonal, spiral, knight. The first hypothesis that reproduces all given terms is the intended rule. Document the vector or turn sequence for each hypothesis; this systematic elimination avoids the common trap of over‑fitting a complex rule to a short sample.

Base‑Conversion and Mixed‑Radix Patterns

Base‑conversion series exploit the fact that a single integer can be written in many bases. A term may be shown in decimal, the next in binary, the next in octal, and so on, while the underlying numeric value follows a simple arithmetic or geometric progression. The solver must recognise the base of each term, convert all terms to a common base (usually decimal), solve the numeric pattern, then reconvert the answer to the base required by the question. Typical bases encountered are 2, 3, 4, 5, 8, 10, 12, 16. Hexadecimal digits A‑F appear as part of the term; they must be treated as values 10‑15. A frequent examiner trick is to omit the base indicator and rely on the digit set to reveal it: a term containing only 0‑1 is binary, only 0‑7 is octal, 0‑9 plus A‑F is hexadecimal. When a term contains digits 8 or 9, the base is at least 10. Mixed‑radix systems extend this idea: each position has its own base, as in time (hours base 24, minutes base 60, seconds base 60) or calendar dates (day base 31, month base 12, year unbounded). A series may present timestamps like 12:59:58, 13:00:00, 13:00:02 where the second component increments by 2 while the minute and hour roll over according to their radices. The pattern is most easily analysed by converting the whole timestamp to a single integer count of seconds (or the smallest unit), detecting the numeric pattern, then converting back.

Another mixed‑radix variant uses factorial number system (factoradic) where the i‑th digit (from right, starting at 1) has base i + 1. Factoradic representations are unique for each integer and are useful for permutation indexing. A series that lists factoradic strings (e.g., 10, 100, 110, 200, …) hides a simple decimal progression (1, 2, 3, 4, …) once decoded. Recognising factoradic requires spotting the strictly increasing maximum digit: the rightmost digit ≤ 1, next ≤ 2, next ≤ 3, etc. If the series shows such a pattern, convert each term to decimal by Σ digit_i × i! and then analyse the decimal series. Conversely, a decimal series that follows n! + k may be presented directly in factoradic to obscure the factorial growth.

Examiners also combine base conversion with alphabetic coding. For example, a term may be “B3” where B is a hexadecimal digit (value 11) and 3 is a decimal digit, and the series rule is “add 5 in decimal, then write the result in base 12 using 0‑9, A, B”. The solver must maintain a consistent internal representation (decimal) throughout the computation, only converting for input and output. A systematic approach: (1) parse each given term, detecting its base from context or explicit notation; (2) convert all to decimal; (3) find the numeric pattern (difference, ratio, polynomial, recursive); (4) compute the required term in decimal; (5) convert the answer to the base demanded by the question (often the same base as the last given term, or a base indicated in the instructions). When the output base is not specified, the safest assumption is the base of the last term, but always verify with the pattern of bases used in the series (e.g., bases cycling 2,8,10,16).

Common pitfalls include treating a hexadecimal “A” as the letter A (position 1) instead of value 10, and forgetting that mixed‑radix roll‑over is not a simple modulo on the whole number but a cascade of carries. For instance, adding 2 seconds to 12:59:59 yields 13:00:01, not 12:59:61. The cascade must be simulated or the whole timestamp converted to a linear count. In factoradic, a carry propagates when a digit exceeds its position‑specific maximum; the conversion algorithm handles this automatically. Finally, when a series alternates between two bases (e.g., binary, decimal, binary, decimal), treat the two subsequences independently: the binary‑position terms form one numeric series, the decimal‑position terms another. Only if a cross‑base rule is explicitly hinted (e.g., “each binary term is the decimal term written in base 2”) should the streams be linked.

Worked Example: Mixed‑Radix Timestamp Series
Find the next term: 23:59:58, 00:00:00, 00:00:02, 00:00:04, ?
Convert each timestamp to total seconds from an arbitrary epoch (e.g., start of day). 23:59:58 = 23×3600 + 59×60 + 58 = 86398 s. 00:00:00 = 0 s (next day). 00:00:02 = 2 s. 00:00:04 = 4 s. The decimal series is 86398, 0, 2, 4. The jump from 86398 to 0 is a day roll‑over (+2 s modulo 86400). Thereafter the series increments by 2 seconds each step. The next term in seconds = 4 + 2 = 6 s. Convert 6 s back to hh:mm:ss: 0 h, 0 min, 6 s → 00:00:06. Answer: 00:00:06.
Exam‑Day Strategy for Base‑Conversion Series
Write a quick reference table of the first 16 values in bases 2, 8, 10, 12, 16 on your rough sheet. When a term contains letters A‑F, immediately flag it as hexadecimal. For mixed‑radix timestamps, convert the first two terms to total seconds; the difference reveals the step size and whether a day boundary is crossed. If the step is constant after the first roll‑over, you can project forward without further conversions. Always keep the internal arithmetic in decimal; only convert for the final answer.

Prime‑Factorisation Driven Number Series

Prime‑factorisation series generate each term from the prime factorisation of the preceding term. The most common rule is “next term = sum of distinct prime factors” or “next term = product of prime factors with multiplicities”. For example, starting with 60 = 2² × 3 × 5, the sum of distinct primes is 2 + 3 + 5 = 10, the product with multiplicities is 2 × 2 × 3 × 5 = 60 (a fixed point). A series that uses the sum of distinct primes produces 60, 10, 7, 7, … because 10 = 2 × 5 → sum = 7, and 7 is prime → sum = 7. Recognising a fixed point or a short cycle (e.g., 4 → 2 → 2) allows instant prediction of far‑away terms. Another variant uses the number of prime factors (Ω(n) counting multiplicities) or the number of distinct prime factors (ω(n)). The series 12, 3, 2, 1, 0, … follows ω(n): 12 has primes {2,3} → ω=2, but if the rule is Ω(n) then 12=2²×3 → Ω=3, next term 3 (prime) → Ω=1, then 1 → Ω=0. The examiner may ask for the 10th term; once the sequence hits 0 or 1 it stays constant, so the answer is trivial after detecting the convergence.

More sophisticated rules combine factorisation with arithmetic operations. A term may be “n + largest prime factor of n” or “n − smallest prime factor of n”. For n = 30, largest prime factor = 5 → next = 35; smallest = 2 → next = 28. These rules produce monotonic sequences that can be analysed by tracking the prime factor of each term. Because the largest prime factor of a composite number is at most n/2, the increment is bounded, and the series grows roughly linearly. The smallest prime factor is at least 2, so the decrement is at least 2, leading to a quick descent to a prime or 1. When the series reaches a prime p, the largest and smallest prime factors are both p, so the next term becomes 2p or 0 respectively. The 0 case terminates; the 2p case yields an even composite whose smallest prime factor is 2, so the series then subtracts 2 repeatedly until another prime appears. This alternating behaviour creates a saw‑tooth pattern that can be modelled piecewise.

Examiners also embed factorisation inside a larger numeric pattern. For instance, a series may present terms that are the product of the first k primes (primorials): 2, 6, 30, 210, 2310, … Recognising primorials requires knowing the first few primes and the growth rate (approximately e(1+o(1)) k log k). A related series uses the sum of the first k primes: 2, 5, 10, 17, 28, 41, … The differences are the primes themselves. If the given series matches either pattern, the next term is obtained by adding the next prime. Another hidden factorisation pattern appears in “highly composite numbers” where each term has more divisors than any smaller number. The sequence 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, … can be identified by the divisor‑count function τ(n). While τ(n) is not a simple arithmetic function, the highly composite numbers are tabulated and can be memorised up to 10⁴ for exam purposes.

When a series mixes factorisation with modular arithmetic, the rule may be “next term = (sum of prime factors) mod m”. For m = 10, the series 60 → 10 → 7 → 7 … becomes 0, 0, 7, 7 … after modulo. The modulo can create cycles even when the raw factorisation sum converges. Detecting the modulus is done by observing that terms never exceed m − 1. If the series shows values only up to 9, suspect mod 10; up to 12, suspect mod 13 (prime) or mod 12. Always test the raw factorisation sum on the first two terms; if the raw sum exceeds the observed term, a modulo is likely applied. Finally, some series use the prime factorisation of the term’s position index n rather than the term itself. For example, term n = product of distinct primes dividing n. This yields 1, 2, 3, 2, 5, 6, 7, 2, 3, 10, … Recognising this requires computing the factorisation of the index, not the previous term. The clue is that the series does not depend on the previous value; each term can be computed independently from n.

Fibonacci‑Lucas Hybrid Transformations

Fibonacci (Fₙ) and Lucas (Lₙ) sequences share the recurrence Xₙ = Xₙ₋₁ + Xₙ₋₂ but differ in seeds: F₀=0, F₁=1; L₀=2, L₁=1. Examiners frequently construct series where the shift applied to an alphabet or a number is drawn alternately from Fibonacci and Lucas numbers, or where the term itself is a linear combination a·Fₙ + b·Lₙ. Because both sequences satisfy the same recurrence, any linear combination also satisfies it. Thus a hybrid series Hₙ = α·Fₙ + β·Lₙ follows Hₙ = Hₙ₋₁ + Hₙ₋₂ with initial values H₀ = 2β, H₁ = α + β. Recognising a hybrid series is easier when the first few terms are given: compute successive differences; if the second‑order difference is constant (i.e., the sequence obeys a second‑order linear recurrence with characteristic equation x² = x + 1), the sequence is a Fibonacci‑type progression. The closed form involves powers of the golden ratio φ = (1+√5)/2 and its conjugate ψ = (1−√5)/2. For exam speed, memorise the first 12 Fibonacci numbers (0,1,1,2,3,5,8,13,21,34,55,89) and Lucas numbers (2,1,3,4,7,11,18,29,47,76,123,199). Any term up to the 12th can be verified by direct lookup.

A common pattern uses Fibonacci numbers as incremental shifts on an alphabet series. For example, start at A (position 1). Add F₁=1 → B, add F₂=1 → C, add F₃=2 → E, add F₄=3 → H, add F₅=5 → M, … The resulting letters are A, B, C, E, H, M, … The position sequence is 1, 2, 3, 5, 8, 13, … which is exactly the Fibonacci numbers offset by one. If the series continues, the next shift is F₆=8 → position 21 → U. The reverse problem (given letters, find the rule) is solved by converting letters to positions, computing successive differences, and checking whether the differences match Fibonacci or Lucas numbers. Because the Fibonacci numbers grow exponentially, the alphabet will wrap after a few steps (mod 26). The wrap‑around must be handled with modular arithmetic: position = (previous position + Fₙ) mod 26, with 0 mapped to 26 (Z). The period of Fibonacci modulo 26 is 84 (Pisano period). Knowing this period allows direct computation of the nth letter without iterating all steps.

Lucas‑based shifts produce a different trajectory because L₁=1, L₂=3, L₃=4, L₄=7, L₅=11, … The gaps are larger, so wrapping occurs sooner. A hybrid shift might alternate: odd steps use Fibonacci, even steps use Lucas. The combined shift sequence then is 1, 3, 2, 7, 5, 18, 13, 47, … which does not follow a simple recurrence but can be generated by two parallel recurrences. When the series presents the resulting letters, the solver extracts the shift sequence by differencing positions (mod 26), then attempts to match the shift sequence to known Fibonacci/Lucas patterns. If the shift sequence itself follows a second‑order recurrence, the underlying rule is a linear combination of the two base sequences.

Another examiner device is to embed Fibonacci numbers as the terms of a number series, but with a missing term that is not the next Fibonacci number. For instance, 2, 3, 5, 8, ?, 21. The missing term is 13, but the series might be “prime Fibonacci numbers” (2,3,5,13,89,…) or “Fibonacci numbers with even index” (1,3,8,21,…). The presence of 2,3,5,8 suggests the standard sequence, but the jump to 21 after the gap could indicate a skip of one term (13) or a different subsequence. The safe method: compute the standard Fibonacci numbers around the given terms, then test each hypothesis (standard, every‑other, prime‑only, modulo‑filtered) against all given terms. The hypothesis that fits all terms without exception is the intended one. When the series mixes Fibonacci with arithmetic operations (e.g., term = Fₙ + n²), the second‑order difference will not be constant; instead, the sequence of differences will follow a pattern that combines the Fibonacci recurrence with a polynomial. In such cases, compute the first few terms of the suspected component sequences separately, then combine them to see if they reproduce the given series.

Conditional Alternating Operations in Series

Conditional alternating operations apply different arithmetic or geometric rules depending on a property of the current term or its index. The most frequent condition is parity: even‑indexed terms follow one rule, odd‑indexed terms another. For example, a series may be defined as: if n is odd, Tₙ = Tₙ₋₁ + 3; if n is even, Tₙ = Tₙ₋₁ × 2. Starting with T₁ = 1, the series becomes 1, 2, 5, 10, 13, 26, 29, 58, … The odd positions (1,3,5,…) increase by 3; the even positions are double the preceding odd term. To solve, separate the series into two subsequences: odd‑indexed terms Oₖ = T₂ₖ₋₁ and even‑indexed terms Eₖ = T₂ₖ. Derive recurrences for each subsequence. In the example, Oₖ₊₁ = Oₖ + 3 (since Oₖ₊₁ = T₂ₖ₊₁ = T₂ₖ + 3 = 2·Oₖ + 3) and Eₖ = 2·Oₖ. This yields closed forms Oₖ = 1 + 3(k‑1) + 2·Σi=1k‑1 O_i? Actually easier: compute a few terms, spot the pattern, then project. The key is to write the first 6‑8 terms, then separate by index parity.

Another condition uses the value of the term itself: “if the term is prime, add 5; otherwise multiply by 2”. Starting with 4 → 8 → 16 → 32 → 64 … (never prime) yields pure doubling. Starting with 3 → 8 → 16 … (3 is prime, add 5 → 8, then composite). The series behaviour changes dramatically at the first prime encounter. To analyse, simulate the first few steps until a cycle or steady growth is evident. Because primality testing is required, the series length in exams is usually limited to 5‑6 terms. Memorise primes up to 100 for quick checks. A related condition uses digital root: “if digital root is 1, subtract 2; else add 3”. Digital root cycles every 9, so the condition creates a periodic pattern that can be modelled with a state machine of 9 states.

Index‑based conditions may involve modular classes other than parity, such as n mod 3 = 0,1,2. A three‑way alternating rule: n≡1 → +2, n≡2 → ×3, n≡0 → −1. The series then has period 3 in its operation pattern. Separate the series into three subsequences by index modulo 3, solve each independently, then interleave. This technique generalises to any modulus m: write m subsequences, each with its own recurrence. The overall period of the combined series is the least common multiple of the individual subsequence periods (if they are periodic) or the growth rates dominate.

Examiners also hide the condition in the wording: “each term is obtained from the previous term by adding the number of letters in the English word of the previous term”. This is a value‑dependent condition because the word length varies (e.g., “four” has 4 letters, “five” has 4, “six” has 3). The series becomes a linguistic‑numeric hybrid. The practical approach: write the English words for the first few numbers, compute their lengths, and generate the series manually. Because the word‑length function is bounded (3‑10 for numbers up to 99), the series eventually enters a short cycle. Detect the cycle by tracking visited values; once a value repeats, the subsequent terms repeat. The missing term can then be read from the cycle. Always verify the cycle length by generating at least two full cycles before concluding.

When a series combines multiple conditions (e.g., parity and primality), the operation tree branches. The systematic method is to construct a decision table for the first 10‑12 indices, listing index, term, condition outcomes, and operation applied. This table reveals whether the conditions are independent or nested. If nested (e.g., “if even index then if term is prime …”), the table still captures the exact rule for each observed step. From the table, infer the subsequence recurrences. In the exam, time is limited; therefore, prioritize the simplest condition that explains all given terms. Over‑engineering a multi‑condition rule when a single parity split suffices is a common trap. After hypothesising a rule, test it on the third and fourth given terms before using it to compute the answer.

  • Assuming a single uniform operation when the series actually alternates by index parity or modulo class.
  • Failing to separate subsequences before searching for a pattern, leading to spurious polynomial fits.
  • Ignoring the wrap‑around effect in alphabet series driven by Fibonacci or Lucas shifts, treating Z + 1 as undefined.
  • Misidentifying the base of a term because of mixed‑radix notation (e.g., reading “1A” as decimal 110 instead of hexadecimal 26).
  • Overlooking the convergence of prime‑factorisation sequences to a fixed point, and continuing to compute unnecessary steps.
  • Treating a conditional rule as deterministic for all terms without verifying the condition on the third given term.
  • Neglecting to convert all terms to a common base before analysing a base‑conversion series, causing arithmetic errors.

Practice Questions

← Syllogism Direction & Distance →