Number System – Uttarakhand Forest Guard – Quantitative Aptitude
Objective – Understand the different types of numbers, their properties, basic operations, and conversion techniques that frequently appear in the Forest Guard exam.
1. Simple Explanation
The Number System is the set of all numbers that we use in mathematics.
It is divided into several sub‑systems, each with its own set of rules and applications.
- Natural Numbers – 1, 2, 3, … (no zero).
- Whole Numbers – 0, 1, 2, 3, …
- Integers – …, –3, –2, –1, 0, 1, 2, 3, …
- Rational Numbers – numbers expressible as a fraction
p/q(p, q integers, q ≠ 0). - Irrational Numbers – numbers that cannot be expressed as a simple fraction (π, √2, …).
- Real Numbers – union of rational and irrational numbers.
- Complex Numbers –
a + biwherei² = –1. - Prime & Composite Numbers – Prime numbers have exactly two distinct divisors (1 and itself); composite numbers have more than two.
In competitive exams, the focus is mainly on integers, fractions, decimals, prime/composite checks, GCD/LCM, divisibility, and base‑system conversions.
2. Key Points
| Topic | What to Memorise | Quick Tips |
|---|---|---|
| Divisibility Rules | 2,3,4,5,6,7,8,9,10,11,12,15,18,20,25,27,30,36,40,45,50,55,60,72,80,90,100 | Use sum of digits for 3 & 9; last digit for 2 & 5; last two digits for 4 & 25; last three digits for 8. |
| Prime Checking | Test divisibility up to √n. | Use 2,3,5,7,11,13,17,19… only. |
| LCM & GCD | Use prime factorisation or Euclid’s algorithm. | LCM × GCD = product of numbers. |
| Factorisation | Break numbers into prime factors. | Useful for simplifying fractions, finding divisors. |
| Place Value | Units, tens, hundreds, etc. | Helps in digit sum, reversing numbers. |
| Decimal & Fraction Conversion | ( \frac{a}{b} = 0.\overline{c} ) or terminating. | Multiply numerator & denominator to make denominator a power of 10 for terminating decimals. |
| Number System Conversions | Binary (base‑2), Octal (base‑8), Decimal (base‑10), Hexadecimal (base‑16). | Use repeated division for conversion to decimal; repeated multiplication for reverse. |
| Special Numbers | Perfect squares, cubes, triangular numbers. | Use formulas ( n^2, n^3, \frac{n(n+1)}{2} ). |
| Odd / Even | Even ➜ last digit 0,2,4,6,8. | Odd ➜ last digit 1,3,5,7,9. |
3. Worked Example
Problem
Find the Least Common Multiple (LCM) and Greatest Common Divisor (GCD) of 168 and 225. Then convert the decimal number 93 into binary.
Step 1: Prime Factorisation
| Number | Prime Factors |
|---|---|
| 168 | ( 2^3 \times 3 \times 7 ) |
| 225 | ( 3^2 \times 5^2 ) |
Step 2: GCD
Take the smallest power of common primes.
Common prime: 3 (smallest power = (3^1))
[ \text{GCD} = 3 ]
Step 3: LCM
Take the largest power of each prime appearing in either factorisation.
[ \text{LCM} = 2^3 \times 3^2 \times 5^2 \times 7 = 8 \times 9 \times 25 \times 7 = 12,600 ]
Step 4: Binary Conversion of 93
Divide by 2 repeatedly and note remainders (bottom‑up).
| Division | Quotient | Remainder |
|---|---|---|
| 93 ÷ 2 | 46 | 1 |
| 46 ÷ 2 | 23 | 0 |
| 23 ÷ 2 | 11 | 1 |
| 11 ÷ 2 | 5 | 1 |
| 5 ÷ 2 | 2 | 1 |
| 2 ÷ 2 | 1 | 0 |
| 1 ÷ 2 | 0 | 1 |
Reading remainders from bottom to top: 1011101₂
Answer
- GCD(168,225) = 3
- LCM(168,225) = 12 600
- 93 in binary = 1011101₂
4. Quick Revision Summary
| Concept | Quick Check |
|---|---|
| Divisibility | 2 – last digit even; 3 & 9 – digit sum; 5 – last digit 0/5; 7 – 2×last digit subtracted from rest; |