Number Series
Inspect difference, ratio, powers, products, digits and mixed operations.
Complete notes for SSC Combined Graduate Level examinations
Inspect difference, ratio, powers, products, digits and mixed operations.
Odd positions and even positions may form two independent tracks; sometimes three tracks repeat.
Translate letters into positions; solve the letter track and number track separately.
Track each feature: orientation, movement, count, size, shading and shape substitution.
Arrange by chronology, process, intensity, hierarchy, size or a natural life cycle.
A candidate must satisfy the rule from both directions, not merely continue the left side.
A wrong interior term usually corrupts the gap before and after it—the “two broken gaps” clue.
Recognise rising, falling, cyclic, alternating and periodic behaviour before calculating.
A series is an ordered list whose terms follow one or more consistent relationships. The term at position \(n\) is written \(a_n\).
| Order | Question to ask | Strong signal | Likely family |
|---|---|---|---|
| 1 | Are terms generally rising, falling or oscillating? | Steady direction or periodic return | Difference, ratio or cyclic trend |
| 2 | Are adjacent gaps constant or patterned? | \(\Delta a_n=a_{n+1}-a_n\) | Arithmetic or higher differences |
| 3 | Are adjacent ratios clean? | \(a_{n+1}/a_n\) is constant or simple | Geometric or multiply–adjust |
| 4 | Do odd and even positions behave separately? | One gap row looks chaotic but two tracks look clean | Alternating / interleaved |
| 5 | Are terms near familiar numbers? | Squares, cubes, primes, factorials | Known sequence with adjustment |
| 6 | Do digits themselves transform? | Reversal, append, digit sum/product | Digit-operation series |
| 7 | Does every transition verify? | No exception or rule-switch | Accepted pattern |
A constant difference \(d\) gives an arithmetic progression:
Example: \(11,18,25,32,\ldots\) has \(d=7\), so \(a_6=11+5(7)=46\).
Descending lists simply have \(d\lt0\).
Write successive difference rows:
Gaps themselves may be \(+2,+4,+6,\ldots\), consecutive odd numbers, primes, squares or cubes.
Example: \(3,5,9,15,23,\ldots\) adds \(2,4,6,8\); next is \(23+10=33\).
A constant ratio \(r\) gives:
Example: \(5,15,45,135,\ldots\) has \(r=3\), so the next term is \(405\).
For falling positive terms, often \(0\lt r\lt1\).
Many TCS patterns combine two operations: multiply, then add or subtract.
Example: \(2,7,22,67,\ldots\) follows \(a_{n+1}=3a_n+1\); next is \(202\).
Test exact or adjusted squares/cubes:
Example: \(3,8,15,24,35\) is \(n^2-1\) for \(n=2,3,4,5,6\).
| Family | Definition / formula | Opening terms | Recognition cue |
|---|---|---|---|
| Natural / multiples | \(a_n=kn+c\) | Example: \(4,8,12,16,\ldots\) | Constant gap |
| Odd / even | \(2n-1\), \(2n\) | \(1,3,5,7,\ldots\) / \(2,4,6,8,\ldots\) | Gap \(2\) |
| Prime | Positive integers with exactly two positive divisors | \(2,3,5,7,11,13,\ldots\) | Irregular small increasing gaps |
| Square | \(n^2\) | \(1,4,9,16,25,36,\ldots\) | Odd gaps \(3,5,7,9,\ldots\) |
| Cube | \(n^3\) | \(1,8,27,64,125,\ldots\) | Rapid growth; familiar cubes |
| Triangular | \(T_n=\dfrac{n(n+1)}{2}\) | \(1,3,6,10,15,21,\ldots\) | Add \(2,3,4,5,\ldots\) |
| Consecutive product | \(n(n+1)\) | \(2,6,12,20,30,42,\ldots\) | Add \(4,6,8,10,\ldots\) |
| Fibonacci type | \(a_n=a_{n-1}+a_{n-2}\) | \(1,1,2,3,5,8,\ldots\) | Each term uses preceding terms |
| Factorial | \(n!=1\cdot2\cdot3\cdots n\) | \(1,2,6,24,120,720,\ldots\) | Multipliers \(2,3,4,5,\ldots\) |
| Powers of a base | \(b^n\) | Example: \(2,4,8,16,32,\ldots\) | Constant ratio \(b\) |
Split by position:
Example: \(2,20,5,17,8,14,11,\ldots\). Odd positions add \(3\); even positions subtract \(3\). The next term is \(11\).
Other forms alternate operations, signs, or two families such as square–cube–square–cube.
Example: \(\frac12,\frac24,\frac38,\frac4{16},\ldots\) has numerator \(n\) and denominator \(2^n\); next is \(\frac5{32}\).
Possible generators include digit sum, digit product, reversal, repetition, or appending a changing digit.
Example: \(12,21,13,31,14,41,\ldots\) alternates a two-digit number with its reversal; next is \(15\).
Example: \(B,E,I,N,T,\ldots\) moves by \(+3,+4,+5,+6\); next shift is \(+7\), wrapping to \(A\).
Separate every term into components. In \(A2,C6,F12,J20,\ldots\), letter positions increase by \(+2,+3,+4,\ldots\), while numbers follow \(n(n+1)\).
Only after solving each track should you test an interaction between them.
The connector is meaning, not spelling:
Make a feature ledger for every frame:
Rotation, reflection, movement, addition/deletion, growth, shading and alternation can operate simultaneously but on different features.
| Feature | Questions | Typical repeat | Do not confuse with |
|---|---|---|---|
| Orientation | What angle and direction? | Constant turn such as \(90^\circ\) clockwise | Mirror reflection |
| Position | Which corner, edge or sector? | Clockwise movement through fixed places | Rotation of the object itself |
| Count | How many lines, dots, sides or compartments? | Add or remove a fixed/patterned number | Overlapping hidden elements |
| Shading | Which region is filled? | Alternate, circulate or invert | Change of shape |
| Size | Growing, shrinking, or alternating? | Monotone or cyclic scale change | Perspective illusion |
| Substitution | Does one symbol become another? | Fixed cycle \(A\to B\to C\to A\) | Simple movement |
Example: \(4,9,16,\square,36\) are consecutive squares, so \(\square=25\); both neighbours confirm it.
Example: \(3,8,15,25,35,48\). Intended form \(n^2-1\) gives \(3,8,15,24,35,48\); therefore \(25\) is wrong.
Always non-decreasing or always non-increasing.
Two states or rules take turns.
A complete state repeats after a fixed period \(p\): \(a_{n+p}=a_n\).
Terms move up and down around a level or between tracks.
For moderate values, check differences first; for explosive or fractional growth, check ratios first. If both look untidy, split alternate positions.
Writing the gap row turns visual guessing into data. Odd-number gaps immediately reveal consecutive squares.
When one row seems irregular, read \(1^{st},3^{rd},5^{th}\) terms and \(2^{nd},4^{th},6^{th}\) terms separately.
For \(24,35,48,63\), notice proximity to \(25,36,49,64\): each is \(n^2-1\). Test a constant adjustment before inventing a complex rule.
Memorise \(A=1\), \(M=13\), \(N=14\), \(Z=26\). Derive nearby positions instead of recounting from \(A\).
Mirror pairs \((A,Z),(B,Y),(C,X),\ldots\) always have position sum \(27\). Opposite of position \(p\) is \(27-p\).
An incorrect middle term normally damages two adjacent comparisons. The common endpoint of those two broken gaps is the prime suspect.
For a missing interior term, insert options and test both neighbouring links. Reject as soon as one link fails.
In each frame record only: position, direction, count, shade, size. The unchanged features eliminate distractors instantly.
Ask “what must happen before what?” Causal and process order is stronger than loose association.
For forward alphabet shift \(k\), use cyclic position:
Find the smallest block that repeats completely. For position \(n\) in period \(p\), use remainder \(n\bmod p\); remainder \(0\) means the last member of the block.
| Pattern | Formula / test | Fast cue |
|---|---|---|
| Arithmetic | \(a_n=a+(n-1)d\) | Constant \(\Delta\) |
| Geometric | \(a_n=ar^{n-1}\) | Constant ratio |
| Quadratic-type | Constant \(\Delta^2\) | First gaps form an AP |
| Triangular | \(T_n=\dfrac{n(n+1)}2\) | Add consecutive integers |
| Consecutive product | \(n(n+1)\) | Even gaps rise by \(2\) |
| Fibonacci-type | \(a_n=a_{n-1}+a_{n-2}\) | Sum preceding terms |
| Periodic | \(a_{n+p}=a_n\) | Repeated block length \(p\) |
| Opposite letters | \(p+q=27\) | Mirror alphabet pair |
| Alphabet wrap | \(p'=((p-1+k)\bmod26)+1\) | Forward cyclic shift \(k\) |
| Alternating | Solve \(a_{2m-1}\) and \(a_{2m}\) separately | Odd–even split |
If gaps are not constant, do not discard the difference method—inspect the gap sequence itself or its second differences.
Almost any two transitions can be fitted. Accept a rule only when it explains the entire list cleanly and predicts an option.
A valid alternating rule repeats predictably. “Multiply here, add there” is not a pattern unless the operation cycle itself is systematic.
A wrong term makes the next gap look wrong too. Reconstruct the suspected term from both neighbours before choosing.
If adjacent comparison is noisy but values alternate high–low or family–family, separate positions immediately.
Check whether the question’s sequence logically cycles after \(Z\). Both refusing and inventing wrap can create a distractor.
Alphabet series normally uses positions; figural questions may use symmetry, strokes or enclosed spaces. Decide which domain the stem tests.
Separate numerator and denominator first, then verify whether a common index connects them. Simplifying too early may erase the intended structure.
Rotation preserves handedness; reflection reverses it. Track an asymmetric mark or corner dot to tell them apart.
TCS distractors often match the count but fail shading or position. Verify every varying feature, not just the most obvious.
Related words need not form a series. Search for an arrow of time, hierarchy, magnitude or process that gives one defensible order.
A contrived high-degree formula can fit finite data, but SSC expects a familiar, economical pattern supported by options and all transitions.
Difference → Ratio → Split → Powers. This is the fastest numerical search order for most SSC series.
If adjacent terms look crazy, imagine odd terms driving in one lane and even terms in another.
Consecutive square gaps are odd numbers: \((n+1)^2-n^2=2n+1\).
The ball multiplies by the next integer: \(1\xrightarrow{\times2}2\xrightarrow{\times3}6\xrightarrow{\times4}24\).
Alphabet opposites always sum to \(27\). A mirror turns \(p\) into \(27-p\).
When two neighbouring links fail, inspect their shared middle term.
Count five features on your fingers: place, direction, number, shade, size.
For semantic order, narrate: what begins, what changes, what results. A coherent story exposes random associations.