Chandigarh PSC /Quantitative Aptitude

Number system

Arithmetic · free study notes

Number System – Quantitative Aptitude (Chandigarh PSC)

Why it matters
The “Number System” section tests your ability to classify numbers, apply divisibility rules, factorise, work with LCM/GCD, and manipulate numbers in different bases. A solid grasp of these concepts will give you an edge in the PSC quantitative paper.


1. The Hierarchy of Number Sets

Symbol Set Elements Notable Properties
ℕ Natural Numbers 1, 2, 3, … Positive integers
ℤ⁺ Whole Numbers 0, 1, 2, … Adds 0 to ℕ
ℤ Integers …, –2, –1, 0, 1, 2, … Closed under +, –, ×
ℚ Rational Numbers p/q (p,q ∈ ℤ, q≠0) Can be expressed as terminating or repeating decimals
ℝ Real Numbers All points on the number line Includes irrational numbers (π, √2, …)
ℂ Complex Numbers a+bi (a,b ∈ ℝ, i²=–1) Every polynomial equation has a root

Key Insight – Every set is a subset of the next:
ℕ ⊂ ℤ⁺ ⊂ ℤ ⊂ ℚ ⊂ ℝ ⊂ ℂ


2. Classification of Integers

Type Definition Example Key Property
Prime Greater than 1, only 1 and itself divide it 2, 3, 5, 7 Product of primes = composite
Composite Greater than 1, has at least one proper divisor 4, 6, 8, 9 Always has at least one prime factor
Perfect Sum of proper divisors = number 6, 28 Even only (known)
Deficient Sum of proper divisors < number 12
Abundant Sum of proper divisors > number 12, 18

Important Note – 1 is neither prime nor composite.


3. Divisibility Rules (Quick Reference)

Divisor Rule
2 Last digit even
3 Sum of digits divisible by 3
4 Last two digits divisible by 4
5 Last digit 0 or 5
6 Divisible by 2 and 3
7 Double the last digit, subtract from remaining; repeat
8 Last three digits divisible by 8
9 Sum of digits divisible by 9
10 Last digit 0
11 Alternating sum of digits divisible by 11
12 Divisible by 3 and 4
13 4×last digit + remaining; repeat
16 Last four digits divisible by 16
17 5×last digit + remaining; repeat
18 Divisible by 2, 3, and 9
19 2×last digit + remaining; repeat
21 Divisible by 3 and 7
22 Divisible by 2 and 11
24 Divisible by 3 and 8
27 Sum of digits divisible by 9 and 3
28 Divisible by 4 and 7

Tricky Point – For 11, remember the alternating sum:
((d_1 - d_2 + d_3 - d_4 + …))


4. GCD & LCM – Key Formulae

Concept Formula Example
Greatest Common Divisor (GCD) Euclidean Algorithm: ( \gcd(a,b) = \gcd(b,,a\bmod b) ) (\gcd(48,18)=6)
Least Common Multiple (LCM) ( \operatorname{lcm}(a,b) = \frac{ a\times b
LCM of several numbers Pairwise: (\operatorname{lcm}(a,b,c)=\operatorname{lcm}(\operatorname{lcm}(a,b),c)) (\operatorname{lcm}(4,6,8)=24)

Quick Trick – For multiples of 12,

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.