📚 Number System – Study Notes for Competitive Exams (IIT‑JEE / Quantitative Aptitude)
Author: Expert Teacher
Subject: Quantitative Aptitude
Topic: Number System
Exam: Navy AA (Quantitative Aptitude)
Goal: Build a rigorous, exam‑oriented understanding of the number system, covering bases, conversions, divisibility, primes, perfect powers, and other number‑theoretic concepts.
Table of Contents
| Section | Topic | Key Points |
|---|---|---|
| 1 | Introduction & Terminology | Numbers, bases, radix |
| 2 | Representation of Numbers in Different Bases | Binary, Octal, Hexadecimal, Decimal |
| 3 | Conversion Techniques | Direct, Repeated Division, Repeated Multiplication |
| 4 | Properties of Numbers | Even/Odd, Power of 10, Patterns |
| 5 | Divisibility Rules | 2,3,5,9,11,7,13,17,19,23, etc. |
| 6 | Modular Arithmetic & Remainders | Congruence, Chinese Remainder Theorem |
| 7 | Prime Numbers & Special Numbers | Primes, Mersenne, Fibonacci, Catalan |
| 8 | Perfect Powers | Squares, Cubes, Fourth Powers |
| 9 | Tricky Points & Common Mistakes | Carry‑over, leading zeros, negative bases |
| 10 | Hard Practice Question | With detailed solution |
Tip: For every rule or property, try to re‑derive it using modular arithmetic. It not only helps memorisation but also deepens conceptual understanding.
1. Introduction & Terminology
| Term | Definition |
|---|---|
| Number | A mathematical object used for counting, measuring, ordering. |
| Base (Radix) | The number of distinct digits, including zero, used to represent numbers in a positional numeral system. |
| General Representation | For base (b): (\displaystyle N = d_k b^k + d_{k-1} b^{k-1} + \dots + d_1 b + d_0) where (0 \le d_i < b). |
| Positional Value | The digit’s contribution to the whole number = (d_i b^i). |
Why Bases Matter:
- Different bases make arithmetic easier for certain tasks (binary for computers, decimal for humans).
- Understanding base conversions is essential for pattern spotting and solving number‑based puzzles.
2. Representation of Numbers in Different Bases
| Base | Common Digits | Example | Notes |
|---|---|---|---|
| 2 (Binary) | 0,1 | 1011₂ = (1·2^3 + 0·2^2 + 1·2^1 + 1·2^0 = 11_{10}) | Used in digital electronics. |
| 8 (Octal) | 0–7 | 207₈ = (2·8^2 + 0·8^1 + 7·8^0 = 135_{10}) | Historically used in computing. |
| 10 (Decimal) | 0–9 | 278₁₀ | Standard human system. |
| 16 (Hexadecimal) | 0–9, A–F | 1A3₁₆ = (1·16^2 + 10·16^1 + 3 = 419_{10}) | Compact representation of binary data. |
Rule of Thumb:
- In base (b), the highest place value of a (k)-digit number is (b^{k-1}).
- The maximum number representable with (k) digits is (b^k - 1).
3. Conversion Techniques
3.1 Decimal → Other Bases (Division‑by‑(b) Method)
- Divide the decimal number by the target base (b).
- Record the remainder (least significant digit).
- Replace the number by the integer quotient and repeat.
- The remainders read backwards give the representation.
Example (Decimal 156 → Octal):
156 ÷ 8 = 19 r 4 19 ÷ 8 = 2 r 3 2 ÷ 8 = 0 r 2Octal = 234₈.
3.2 Other Bases → Decimal (Direct Method)
Use the positional formula:
[ N_{10} = \sum_{i=0}^{k} d_i b^i ]
Example (Hex 1F₁₆ → Decimal):
[ 1·16^1 + 15·16^0 = 16 + 15 = 31 ]
3.3 Decimal ↔ Binary (Repeated Doubling / Halving)
- Decimal to Binary: Repeated division by 2 (same as Division‑by‑(b)).
- Binary to Decimal: Successive doubling of partial sums.
Example (Binary 110101₂ → Decimal):
[ 1·2^5 + 1·2^4 + 0·2^3 + 1·2^2 + 0·2^1 + 1·2^0 = 32 + 16 + 0 + 4 + 0 + 1 = 53 ]
4. Properties of Numbers
| Property | Quick Test | Example |
|---|---|---|
| Even/Odd | Last digit even → even | 68₁₀ |
| **Divisible by |