Number System
π Log in to trackDivisibility, remainders, unit digits, factors and recurring decimals β the base layer every other Quant topic uses. CGL asks 1β3 direct questions per Tier 1 shift (missing-digit divisibility, remainders and unit digit are near-certain) and a few more in Tier 2.
One page per subtopic: detailed notes, every question type, formulas, tricks and practice sets.
Every formula on one printable page, grouped by subtopic.
5 exam-level questions worked step by step.
97 questions β untimed practice or a timed test with analysis.
Track record in the exam
Questions per shift in recent SSC CGL papers.
Test difficulty mix (97 questions)
Question patterns exams keep repeating
Taken from previous-year papers. If a pattern is marked "very common", expect to see it in your exam.
Missing digits for divisibility (11, 72, 88, 99)
very commonA number with one or two blanks (x, y) and the words 'is divisible by'. The options are digits or x + y.
How to solve: Split a composite divisor into co-prime parts (72 = 8 Γ 9, 88 = 8 Γ 11). Apply the rule with fewest choices first β the last-three-digits rule of 8 or the alternating-sum rule of 11 β then the digit-sum rule. List the few cases; the asked quantity is usually the same in all of them.
Example: If 8x6y4 is divisible by 88, find x + y.
Rule of 8: 6y4 β y = 2 or 6. Rule of 11: β .
Remainder when the new divisor is a factor of the old one
very common'A number divided by 527 leaves 64. What is the remainder when it is divided by 17?'
How to solve: Check that the new divisor divides the old one. If it does, just divide the old remainder by the new divisor. This is a 20-second question.
Example: N Γ· 195 leaves 47. Find N Γ· 15.
; .
Remainder of large powers and products
very commonHuge powers such as , or products like divided by a small number.
How to solve: Replace every number by its remainder (negative remainders are allowed). For powers, find a small power that leaves 1 or β1 and split the exponent. If the final result is negative, add the divisor.
Example: Remainder of divided by 68?
, so .
Unit digit of powers, products and sums
very common'Find the unit digit of ' or of a sum/difference of powers or a factorial sum.
How to solve: Keep only the unit digit of each base and the exponent mod 4 (remainder 0 means the 4th power). Multiply or add the unit digits. For a negative difference add 10. Factorials from 5! end in 0.
Example: Unit digit of ?
β β 9.
Number of factors, odd/even factors, sum of factors
very common'How many factors does 720 have?', 'how many even factors β¦', 'sum of all factors of 360'.
How to solve: Prime-factorise. Number of factors = product of (power + 1). Odd factors: drop the 2. Sum of factors = product of brackets (1 + p + β¦ + p^a).
Example: How many odd factors does 3600 have?
β odd factors .
Trailing zeros and highest power in n!
common'How many zeros are at the end of 125!?', 'largest n such that divides 100!'.
How to solve: Successively divide n by 5 (for zeros) or by the prime p and add all quotients. For a composite like 12 find the exponent of each prime part and take the smallest after dividing by the needed power.
Example: Zeros at the end of 125!?
.
Algebraic divisibility of a^n Β± b^n
commonExpressions like or with 'is divisible by'.
How to solve: Odd power sum β divisible by (a + b). Difference β always divisible by (a β b), and by (a + b) too when the power is even. Match these with the options.
Example: is divisible by?
Even power difference β both 19 β 11 = 8 and 19 + 11 = 30.
Recurring decimals to fractions and their sums
commonBarred decimals like or .
How to solve: Pure recurring: repeating digits over 9s. Mixed: (all digits β non-repeating digits) over (9s then 0s). Convert every term to a fraction before adding.
Example:
.
Counting multiples in a range and series sums
common'How many numbers between 200 and 600 are divisible by 4, 5 and 6?', 'sum of all three-digit multiples of 7'.
How to solve: Use floor division: multiples of k from a to b = βb/kβ β β(aβ1)/kβ. 'And' means LCM; 'or' means inclusionβexclusion. For sums use n/2 Γ (first + last).
Example: How many integers from 1 to 1000 are divisible by neither 4 nor 6?
.
Two-digit numbers with reversed digits
occasional'If the digits are reversed the number increases by 27', 'a number is 4 times the sum of its digits'.
How to solve: Write the number as 10a + b. Difference with the reverse is 9(a β b); sum with the reverse is 11(a + b). Or test the options quickly.
Example: A two-digit number is 4 times its digit sum; adding 27 reverses it. Find it.
and β 36.