PYQ Vault

SSC CGL Tier II Quantitative Aptitude · Formula sheet

Number System formulas

8 formulas and 8 common traps for SSC CGL Tier II Quantitative Aptitude Number System, grouped by subtopic.

Full notes with worked examples

Divisibility Tests

Learn this subtopic in the notes

Divisibility rules

Combining two tests

a∣N,  b∣N,  gcd⁡(a,b)=1  ⇒  ab∣Na \mid N,\; b \mid N,\; \gcd(a, b) = 1 \;\Rightarrow\; ab \mid N

Finding a missing digit

The two tests that fix most blanks

8∣last three digits,9∣sum of the digits8 \mid \text{last three digits}, \quad 9 \mid \text{sum of the digits}

Common traps

Combining factors that share a factor

A number divisible by both 4 and 6 need not be divisible by 24: 12 is divisible by both. Use 8 and 3, which share nothing.

Stopping at the first digit that works

Two tests can each allow several digits. When the question asks for the greatest value or a product, list every pair the tests allow, then choose.

Factorisation, HCF and LCM

Learn this subtopic in the notes

HCF and LCM

Two numbers

HCF(a,b)×LCM(a,b)=a×b\text{HCF}(a, b) \times \text{LCM}(a, b) = a \times b

Remainder recipes

A number with a fixed remainder

N=m×LCM+rN = m \times \text{LCM} + r

Counting divisors

Number of divisors

N=paqbrc  ⇒  (a+1)(b+1)(c+1) divisorsN = p^a q^b r^c \;\Rightarrow\; (a + 1)(b + 1)(c + 1) \text{ divisors}

Common traps

Taking the highest powers for the HCF

The HCF takes the LOWEST power of each shared prime and leaves out primes that are not shared. The highest powers of every prime give the LCM.

Taking the HCF of the numbers, not of the differences

For 'the same remainder', the remainders cancel only in the DIFFERENCES. The HCF of 70, 115 and 205 is 5, but the answer is 45.

Forgetting that a prime can be left out

Each power counts from zero, so 232^3 gives 4 choices (1, 2, 4, 8), not 3. That is why every exponent gets 1 added.

Primes, Remainders and Digits

Learn this subtopic in the notes

Primes, squares and cubes

Difference of squares

a2−b2=(a−b)(a+b)a^2 - b^2 = (a - b)(a + b)

Remainders and unit digits

Division

dividend=divisor×quotient+remainder\text{dividend} = \text{divisor} \times \text{quotient} + \text{remainder}

Place value and digit counting

A number and its reverse

(10a+b)−(10b+a)=9(a−b)(10a + b) - (10b + a) = 9(a - b)

Common traps

Counting 1 as prime or composite

1 has only one divisor, so it is neither prime nor composite. Leave it out of both counts.

Reading a remainder of 0 as the start of the cycle

When the index divides exactly by 4, use the FOURTH digit of the cycle: 282^8 ends in 6, not 2.

Counting a number twice

When counting numbers with a 7, 177 has a 7 in two places. Count it once, or the total comes out one too many.

More SSC CGL Tier II Quantitative Aptitude formula sheets