ExamShortcut
high importance~2 Q in Tier 133 formulas⚑ 18 shortcuts6 subtopics

Divisibility, 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.

Track record in the exam

avg 1.0 Q / shift2024: 1–2 Q2025: 1 Q

Questions per shift in recent SSC CGL papers.

Test difficulty mix (97 questions)

31 easy48 medium18 hard

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 common
Spot it:

A 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: 18βˆ’(x+y)∈{0,11}18 - (x + y) \in \{0, 11\} β†’ x+y=7x + y = 7.

Learn this in β€œDivisibility rules” β†’

Remainder when the new divisor is a factor of the old one

very common
Spot it:

'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.

195=15Γ—13195 = 15 \times 13; 47β€Šmodβ€Š15=247 \bmod 15 = 2.

Learn this in β€œRemainders & remainder theorem” β†’

Remainder of large powers and products

very common
Spot it:

Huge powers such as 5705^{70}, 6767+6767^{67} + 67 or products like 1021Γ—1023Γ—10251021 \times 1023 \times 1025 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 6767+6767^{67} + 67 divided by 68?

67β‰‘βˆ’167 \equiv -1, so (βˆ’1)67+67=66(-1)^{67} + 67 = 66.

Learn this in β€œRemainders & remainder theorem” β†’

Unit digit of powers, products and sums

very common
Spot it:

'Find the unit digit of 795Γ—3587^{95} \times 3^{58}' 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 21377542137^{754}?

754β€Šmodβ€Š4=2754 \bmod 4 = 2 β†’ 72=497^2 = 49 β†’ 9.

Learn this in β€œUnit digit & cyclicity” β†’

Number of factors, odd/even factors, sum of factors

very common
Spot it:

'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?

3600=24Γ—32Γ—523600 = 2^4 \times 3^2 \times 5^2 β†’ odd factors =3Γ—3=9= 3 \times 3 = 9.

Learn this in β€œFactors, prime factorisation & trailing zeros” β†’

Trailing zeros and highest power in n!

common
Spot it:

'How many zeros are at the end of 125!?', 'largest n such that 3n3^n 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!?

25+5+1=3125 + 5 + 1 = 31.

Learn this in β€œFactors, prime factorisation & trailing zeros” β†’

Algebraic divisibility of a^n Β± b^n

common
Spot it:

Expressions like 1725+232517^{25} + 23^{25} or 724βˆ’17^{24} - 1 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: 1932βˆ’113219^{32} - 11^{32} is divisible by?

Even power difference β†’ both 19 βˆ’ 11 = 8 and 19 + 11 = 30.

Learn this in β€œDivisibility rules” β†’

Recurring decimals to fractions and their sums

common
Spot it:

Barred decimals like 2.47β€Ύ2.4\overline{7} or 0.6β€Ύ+0.7β€Ύ+0.8β€Ύ0.\overline{6} + 0.\overline{7} + 0.\overline{8}.

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: 0.47β€Ύ+0.35β€Ύ=?0.4\overline{7} + 0.3\overline{5} = ?

4390+3290=7590=56\frac{43}{90} + \frac{32}{90} = \frac{75}{90} = \frac{5}{6}.

Learn this in β€œFractions, decimals & recurring decimals” β†’

Counting multiples in a range and series sums

common
Spot it:

'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?

1000βˆ’(250+166βˆ’83)=6671000 - (250 + 166 - 83) = 667.

Learn this in β€œNumber types, place value & counting” β†’

Two-digit numbers with reversed digits

occasional
Spot it:

'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.

b=2ab = 2a and bβˆ’a=3b - a = 3 β†’ 36.

Learn this in β€œNumber types, place value & counting” β†’

Your next step

New here? Start with subtopic 1 in Learn. Revision mode? Jump straight to the test and let it tell you what to fix.