Number System – Study Notes
(Tamil Nadu Forest Guard – Quantitative Aptitude)
1. Simple Explanation
The number system deals with the way numbers are represented, understood, and manipulated.
In the context of the Forest Guard exam, you’ll mainly encounter:
| System | Base | Typical Use | Example |
|---|---|---|---|
| Decimal | 10 | Everyday counting | 456 |
| Binary | 2 | Computer logic | 1011 |
| Octal | 8 | Some legacy systems | 327 |
| Hexadecimal | 16 | Programming, memory addresses | 1A3F |
| Modulo arithmetic | – | Remainders, divisibility | 23 mod 5 = 3 |
Key ideas:
- Place value – each position represents a power of the base.
- Conversion – converting between bases (e.g., decimal → binary) by repeated division or multiplication.
- Properties – divisibility rules, parity (odd/even), and patterns in base‑specific numbers.
2. Key Points
| Concept | What to remember | Quick test |
|---|---|---|
| Place value | In base b, digit dₙdₙ₋₁…d₀ = Σ dᵢ × bⁱ | What is the value of 321₂? |
| Decimal → Binary | Divide by 2, record remainders (bottom‑to‑top) | Convert 13₁₀ → ? |
| Binary → Decimal | Σ (bit × 2ⁱ) | What is 10101₂ in decimal? |
| Binary Multiplication | 1×X = X, 0×X = 0; add shifted copies | 110₁₂ × 101₁₂ = ? |
| Octal/Hex | Similar to binary; groups of 3 or 4 bits | 7F₁₆ to decimal? |
| Divisibility (Decimal) | 2: last digit even; 3: sum digits ÷3; 9: sum digits ÷9; 5: last digit 0/5 | Is 12345 divisible by 5? |
| Modular Arithmetic | (a + b) mod m = ((a mod m)+(b mod m)) mod m | (17+23) mod 5 = ? |
| Patterns | Powers of 2: 1,2,4,8,16…; Powers of 10: 10,100,1000… | What is 2⁸? |
| Conversion Tips | Use powers of base; or iterative division/multiplication | Convert 255₁₀ to hex? |
3. Worked Example
Problem
A forest guard receives a code in octal: 147₈.
- Convert it to decimal.
- Add 23₁₀ to the result.
- Give the final answer in binary.
Solution
Step 1 – Octal to Decimal
147₈ = 1×8² + 4×8¹ + 7×8⁰
= 1×64 + 4×8 + 7×1
= 64 + 32 + 7
= 103₁₀
Step 2 – Add 23₁₀
103 + 23 = 126₁₀
Step 3 – Decimal to Binary
Divide by 2 and keep remainders:
| Division | Quotient | Remainder |
|---|---|---|
| 126 ÷ 2 | 63 | 0 |
| 63 ÷ 2 | 31 | 1 |
| 31 ÷ 2 | 15 | 1 |
| 15 ÷ 2 | 7 | 1 |
| 7 ÷ 2 | 3 | 1 |
| 3 ÷ 2 | 1 | 1 |
| 1 ÷ 2 | 0 | 1 |
Read remainders bottom‑to‑top: 1111110₂
Answer: The decoded binary code is 1111110₂.
4. Quick Revision Summary
- Place Value – each digit × baseⁱ.
- Base Conversion –
- Decimal → Binary: repeated division by 2.
- Binary → Decimal: Σ bit × 2ⁱ.
- Octal/Hex: same idea, base 8 or 16.
- Divisibility Rules – check last digit, digit sums, etc.
- Modulo Arithmetic – useful for remainders, cycles.
- Patterns – powers of 2, 10, 8, 16 help quick mental checks.
Use these points as a quick reference while practicing forest guard quantitative problems!