Number Series
Learning Objectives
- Understand the fundamental concepts of Number Series
- Apply key formulas and techniques to solve problems
- Practice with exam-level questions to build speed and accuracy
What is Number Series?
Number series questions present a sequence of numbers following a specific pattern. You must identify the pattern and find the next term or the wrong term in the series. These questions are common in SBI Clerk prelims and test your numerical aptitude and pattern recognition speed.
Common Patterns in Number Series
1. Arithmetic Progression (AP): The difference between consecutive terms is constant. Example: 3, 7, 11, 15, 19 (difference +4).
2. Geometric Progression (GP): Each term is multiplied by a fixed number. Example: 2, 6, 18, 54 (multiplied by 3).
3. Square/Cube Series: Terms are squares or cubes of natural numbers. Example: 1, 4, 9, 16, 25 (1², 2², 3², 4², 5²).
4. Prime Number Series: Terms are prime numbers. Example: 2, 3, 5, 7, 11, 13.
5. Mixed Operation Series: Each term is derived by a combination of operations like ×n ± m. Example: 2, 5, 11, 23, 47 (×2+1, ×2+1, ...).
6. Fibonacci Series: Each term is the sum of the two preceding terms. Example: 1, 1, 2, 3, 5, 8, 13.
7. Digit-Based Series: Pattern based on digits of numbers. Example: 12, 21, 13, 31, 14, 41 (swap digits).
Solved Examples
a) 127 b) 125 c) 129 d) 126
a) 185 b) 180 c) 190 d) 175
a) 12 b) 20 c) 42 d) 56
Shortcut Techniques
- First check if differences between consecutive terms are constant (AP) or increasing/decreasing by a pattern.
- If differences don't show a pattern, check ratios — the series could be GP or mixed operation.
- Check for alternate patterns — odd-position terms may follow one pattern, even-position another.
- Learn squares up to 30, cubes up to 15, and prime numbers up to 100 for quick identification.
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
Difference Series and Second‑Order Differences
When the first‑order differences (the gaps between consecutive terms) do not form a constant or simple arithmetic progression, the next diagnostic step is to examine the second‑order differences — the differences of the first‑order differences. If the second‑order differences become constant, the original series follows a quadratic pattern of the form an² + bn + c. For example, the series 2, 6, 12, 20, 30 yields first differences 4, 6, 8, 10 and second differences 2, 2, 2, confirming a quadratic rule n² + n. In many competitive papers the quadratic coefficient a is 1 or ½, so recognising the constant second difference instantly narrows the search to a handful of candidate formulas.
If the second‑order differences themselves form an arithmetic progression, the underlying rule is cubic (an³ + bn² + cn + d). A typical cubic series such as 1, 8, 27, 64, 125 produces first differences 7, 19, 37, 61 and second differences 12, 18, 24 — an arithmetic progression with common difference 6. The constant third difference (6) signals a cubic term with coefficient 1. Examiners often hide the cubic nature by inserting a small linear perturbation (e.g., + n) so that the third difference remains constant but the second differences are not perfectly linear; checking the third difference eliminates this trap.
Higher‑order differences are rarely required beyond the third order in standard banking examinations, but the principle extends indefinitely: a constant k‑th order difference indicates a polynomial of degree k. Practically, aspirants should compute up to third differences within the first 30 seconds; if no constant appears, the series is likely non‑polynomial (exponential, factorial, digit‑based, or mixed). A useful shortcut is to write the terms in a column, subtract downwards, and repeat — this visual “difference table” makes pattern spotting faster than mental arithmetic.
Exceptions arise when the series alternates between two different polynomial rules (interleaved series) or when a polynomial is combined with a multiplicative factor (e.g., n² × 2ⁿ). In such hybrid cases the pure difference method fails after the first few rows because the multiplicative component introduces a geometric growth that contaminates the differences. The remedy is to separate the series into its constituent sub‑series (odd‑position terms, even‑position terms) before applying difference analysis.
Alternate and Interleaved Series
Many number‑series questions conceal two independent progressions running in parallel, one occupying the odd positions (1st, 3rd, 5th …) and the other the even positions (2nd, 4th, 6th …). Recognising an interleaved structure prevents the common error of forcing a single rule on the whole sequence. The first step is to split the given terms into two sub‑series and test each for standard patterns — arithmetic, geometric, quadratic, prime‑based, or digit‑manipulation.
For instance, the series 3, 4, 9, 8, 27, 16, 81 separates into odd‑position terms 3, 9, 27, 81 (×3 each step) and even‑position terms 4, 8, 16 (×2 each step). The next term belongs to the even sub‑series, so the answer is 32. Examiners frequently increase difficulty by letting the two sub‑series share a common operation but with different parameters, e.g., odd terms follow ×2+1 while even terms follow ×2‑1. In such cases the difference table of the combined series shows no regularity, but the split series each reveal a clean linear recurrence.
A second variant uses three interleaved strands (positions 1,4,7…; 2,5,8…; 3,6,9…). The same splitting principle applies: write the terms in three columns and analyse each column independently. This pattern appears in higher‑level clerk mains where time pressure is severe; a quick visual grouping (e.g., circling every third term) saves precious seconds.
Traps include series where the interleaving is not perfectly regular — for example, a missing term in one strand shifts the alignment. Always verify that the split produces equal‑length sub‑series (or differs by at most one term). If the lengths mismatch, the series may be a “broken” interleaving where a term has been omitted deliberately; the missing‑term question then asks for the omitted value, which can be found by reconstructing the intended sub‑series.
Polynomial and Power‑Based Series
Beyond simple quadratics and cubics, examiners embed series generated by explicit polynomial formulas such as n³ + n², 2n² + 3n + 1, or n⁴ − n². The hallmark of a pure polynomial series is that the k‑th order differences become constant at the degree k. For a quartic (degree 4) the fourth differences are constant; however, banking papers rarely go beyond cubic because the numbers explode quickly. When a quartic does appear, the first few terms are usually small (e.g., 1, 16, 81, 256 … = n⁴) and the constant fourth difference equals 24 × leading coefficient.
Power‑based series where the exponent itself varies (e.g., 2¹, 3², 4³, 5⁴ …) are classified as “exponential‑polynomial hybrids”. Their growth outpaces any fixed‑degree polynomial, so the difference table never stabilises. The detection cue is a rapidly widening gap between successive ratios: the ratio of consecutive terms increases rather than approaching a constant. A quick test — compute termₙ₊₁ / termₙ for the first three pairs; if the ratios themselves grow in a regular fashion (e.g., 2, 3, 4 …), the series is likely of the form (n+1)ⁿ or similar.
Another common family uses binomial coefficients: C(n,2), C(n,3), C(n,4) … which produce triangular numbers, tetrahedral numbers, etc. These are polynomial in disguise (degree 2, 3, 4 respectively) and therefore succumb to difference analysis. Recognising the combinatorial origin can shortcut the algebra: the nth triangular number is n(n+1)/2, the nth tetrahedral number is n(n+1)(n+2)/6.
Examiner twists include adding a constant offset to a polynomial (e.g., n² + 5) or multiplying the polynomial by a fixed integer (e.g., 3n²). Both operations preserve the order at which differences become constant, so the difference table remains a reliable diagnostic. However, adding a term that itself follows a different polynomial (e.g., n² + 2ⁿ) destroys the constant‑difference property; such hybrids are treated in the next section.
Series Involving Factorials and Combinatorial Patterns
Factorial growth (1, 2, 6, 24, 120, 720 …) is unmistakable because the ratio of successive terms equals the index: termₙ₊₁ / termₙ = n+1. When a series displays ratios 2, 3, 4, 5 … it is almost certainly factorial or a simple multiple thereof (e.g., 2·n!). A frequent variation multiplies each factorial by a linear factor: n! × (n+1) yields 2, 6, 24, 120, 720 … which coincides with (n+1)!. Recognising the equivalence prevents unnecessary computation.
Combinatorial series such as “choose” numbers appear as C(n, k) for fixed k while n increments. For k = 2 the series is 1, 3, 6, 10, 15 … (triangular numbers). For k = 3 the series is 1, 4, 10, 20, 35 … (tetrahedral numbers). These are polynomial of degree k, so the k‑th differences are constant. A quick identification method: write the first five terms, compute successive differences until a constant row appears; the order of that row equals k.
Mixed factorial‑polynomial series (e.g., n! + n²) are rare but possible in mains‑level papers. Their ratios do not follow a simple integer progression, and difference tables never stabilise because the factorial component dominates. The practical approach is to test the first three terms against known factorial values; if they match n! exactly, assume pure factorial. If they deviate by a predictable polynomial amount, subtract the factorial part and analyse the remainder.
Digit‑factorial hybrids (e.g., sum of factorials of digits) belong to the “digit‑based” family and are covered elsewhere. The key takeaway for factorial series is the ratio test: compute term₂/term₁, term₃/term₂, term₄/term₃. If the results are consecutive integers starting from 2, you have a factorial core.
- Assuming a single polynomial rule when the series is actually interleaved — always split by position first.
- Stopping at first‑order differences; many quadratic and cubic series require second‑ or third‑order checks.
- Misidentifying a factorial series as exponential because the numbers grow fast — verify by ratio test.
- Overlooking a constant offset added to a polynomial; the difference table still works, but the constant term changes the first few values.
- Treating a hybrid factorial‑polynomial as pure factorial and ignoring the polynomial remainder.
- Forgetting that a constant k‑th difference implies a degree‑k polynomial, not necessarily a simple nᵏ.
- Ignoring the possibility of a broken interleaving where a missing term shifts the alignment of sub‑series.
Mastering these advanced patterns equips you to dissect any number series within the time limits of competitive examinations.
Recursive Linear Recurrences and Characteristic Equations
Many banking‑level series are generated by a linear recurrence of order two or three, for example aₙ = p·aₙ₋₁ + q·aₙ₋₂ with constant coefficients p and q. The standard method to obtain a closed form is to write the characteristic equation r² − p·r − q = 0. If the roots r₁ and r₂ are distinct, the general term is aₙ = A·r₁ⁿ + B·r₂ⁿ where A and B are fixed by the first two given terms. When the roots coincide (r₁ = r₂ = r) the solution becomes aₙ = (A + B·n)·rⁿ. A third‑order recurrence aₙ = p·aₙ₋₁ + q·aₙ₋₂ + r·aₙ₋₃ leads to a cubic characteristic equation; the same principle applies — factor the polynomial, write the sum of exponentials (or polynomial‑times‑exponential for repeated roots), and solve for the constants. In examinations the recurrence is rarely given explicitly; instead the first six to eight terms are shown. The candidate must recognise the constant‑coefficient pattern by checking whether the ratios of successive differences settle into a fixed linear combination. A quick diagnostic: compute aₙ₊₁ − p·aₙ for a guessed p; if the result follows a simpler recurrence, the original order is confirmed. Typical traps include a hidden constant term (making the recurrence non‑homogeneous) or a coefficient that changes after a few terms, which converts the series into a piecewise recurrence. Mastery of the characteristic‑equation technique reduces a seemingly opaque series to a handful of algebraic steps.
Modular Arithmetic and Cyclic Patterns in Series
Series that repeat after a fixed period are governed by modular arithmetic. The most common modulus in competitive papers is 10 (units‑digit cycles) or 9 (digital‑root cycles). For any integer base b, the sequence bⁿ mod m is eventually periodic with period dividing φ(m) when b and m are coprime (Euler’s theorem). When b shares a factor with m, the period may be shorter and a pre‑period appears. A classic example: powers of 2 modulo 10 produce the cycle 2, 4, 8, 6 of length 4. If a series presents terms like 2, 4, 8, 6, 2, 4 … the examiner expects the candidate to spot the modulus‑10 cycle and predict the next term instantly. More sophisticated cycles involve two‑step recurrences modulo m, e.g. aₙ = (aₙ₋₁ + aₙ₋₂) mod 100, which generates a Pisano period. The length of the Pisano period for modulus 100 is 300; however, test papers usually restrict themselves to the first 20–30 terms, so the cycle is visible without full period computation. A practical shortcut: write the first 12–15 terms, compute successive differences modulo the suspected base, and look for a repeating block. Once the block length L is identified, the nth term equals the (n mod L)th term of the block (with 0 mapped to L). Candidates must also watch for a “phase shift” where the given series starts inside the cycle rather than at its first element; aligning the index correctly is essential.
Prime‑Based Series and Prime Gap Progressions
Series built from the sequence of prime numbers appear frequently in mains‑level papers. The simplest form lists consecutive primes: 2, 3, 5, 7, 11, 13 … A twist is to use the gaps between successive primes (prime gaps): 1, 2, 2, 4, 2, 4, 6, 2, 6 … The gaps themselves form a series with known statistical properties but no simple closed form; examiners therefore restrict the visible part to the first 8–10 gaps, allowing pattern recognition by inspection. Another common construction multiplies each prime by its index: 2×1, 3×2, 5×3, 7×4, 11×5 … yielding 2, 6, 15, 28, 55 … The nth term is pₙ·n where pₙ is the nth prime. Because the prime‑counting function π(x) ≈ x/ln x, the growth is slightly faster than quadratic but slower than cubic; difference tables will not stabilise, signalling a non‑polynomial origin. A more subtle variant adds the prime to its index: pₙ + n giving 3, 5, 8, 11, 16 … Here the first differences are the prime gaps plus 1, so the second differences mirror the irregularity of prime gaps. Candidates should memorise the first 15 primes (up to 47) and the first 10 prime gaps; this enables instant verification of any prime‑based series without trial division during the test. A frequent trap is a series that starts with a composite number but thereafter follows a prime rule (e.g., 4, 5, 7, 11, 13 … where the first term is 2²). Always check whether the rule applies from the second term onward.
Hybrid Operator Series Combining Arithmetic and Geometric Steps
Hybrid series apply two different operations alternately or in a fixed pattern, such as “multiply by 2, then add 3, then multiply by 2, then add 3 …”. The resulting sequence can be expressed as a piecewise recurrence: for even n, aₙ = 2·aₙ₋₁; for odd n (>1), aₙ = aₙ₋₁ + 3. Solving such a system yields two interleaved subsequences, each following a simple geometric or arithmetic progression. A more complex hybrid uses a cycle of three operations, e.g. ×2, +5, −1 repeated. The period of the operation cycle equals the number of distinct operations; the series can be split into that many subsequences by taking every kth term. Each subsequence then obeys a single‑operation recurrence and can be solved independently. When the operations themselves change magnitude (e.g., multiply by 2, then add 3, then multiply by 3, then add 4 …), the pattern becomes a “growing operator” series. The key to cracking these is to write the operation sequence explicitly alongside the terms, then look for regularity in the operators. Often the operators follow their own arithmetic progression (addends increase by 1, multipliers increase by 1). Once the operator pattern is identified, the original series can be reconstructed forward or backward. A typical examiner twist hides the operator cycle by giving only the resultant terms; the candidate must reverse‑engineer the operators by computing successive ratios and differences alternately.
Digit‑Manipulation Series and Palindromic Constructions
Digit‑based series treat each term as a string of decimal digits and apply transformations such as reversal, digit sum, digit product, or concatenation. A classic example: start with 12, reverse to 21, add → 33, reverse → 33, add → 66 … producing 12, 21, 33, 33, 66, 66 … The pattern alternates between a number and its palindrome. Another family uses the “digit‑factorial” sum: 145 → 1!+4!+5! = 145 (a fixed point). Series that iterate the digit‑factorial function quickly fall into the known cycle 169 → 363601 → 1454 → 169 … Recognising the cycle length (3) allows instant prediction of any later term. Palindromic construction series generate the next term by appending the reverse of the current term minus its first digit: 1 → 11 → 111 → 1111 … or 12 → 1221 → 12211221 … The length doubles each step, so the nth term has 2ⁿ⁻¹ digits; the series is not meant to be written out but to test the candidate’s ability to describe the rule. A frequent trap mixes digit‑sum and digit‑product: 23 → 2+3=5, 2×3=6 → next term 56 → 5+6=11, 5×6=30 → 1130 … The rule alternates between sum and product, and the number of digits grows irregularly. The reliable approach is to write the transformation rule in words, then apply it mechanically to the given terms; do not attempt to find an algebraic formula.
- Assuming a constant‑coefficient recurrence when the coefficients themselves follow a progression.
- Ignoring a pre‑period in modular cycles and aligning the index to the wrong cycle element.
- Treating prime‑gap irregularity as noise instead of the defining pattern.
- Failing to split a hybrid operator series into its constituent subsequences before solving.
- Overlooking a digit‑reversal step that changes the number of digits and breaks polynomial difference analysis.
- Applying a single modulus (e.g., 10) when the series actually cycles modulo 9 or 11.
- Confusing a growing‑operator series with a simple alternating arithmetic‑geometric series.