📚 Jharkhand TET – Quantitative Aptitude
📌 Topic: Number System
Objective:
Build a solid foundation on various number systems, efficient conversion techniques, and key properties that frequently appear in competitive exams like IIT‑JEE, JEE‑Mains, and state‐level teacher eligibility tests.
1. Overview of Number Systems
| System | Base | Notation | Typical Applications |
|---|---|---|---|
| Decimal (Base‑10) | 10 | 0–9 | Everyday arithmetic |
| Binary (Base‑2) | 2 | 0, 1 | Computer logic |
| Octal (Base‑8) | 8 | 0–7 | Legacy computer systems |
| Hexadecimal (Base‑16) | 16 | 0–9, A–F | Memory addresses, color codes |
Why learn other bases?
- Problem simplification – many computational tasks are easier in binary/hex.
- Pattern detection – many divisibility tests rely on base‑specific properties.
- Competitive advantage – conversion questions are frequent in TET, JEE‑Mains, and IIT‑JEE.
2. Converting Between Number Systems
2.1 Decimal → Other Bases
| Step | Description | Example |
|---|---|---|
| 1 | Divide the decimal number by the target base. | 100 ÷ 2 = 50 remainder 0 |
| 2 | Record the remainder (least significant digit). | Remainder 0 → LSB |
| 3 | Use the quotient as the new number; repeat until quotient = 0. | 50 ÷ 2 = 25 rem 0; 25 ÷ 2 = 12 rem 1; … |
| 4 | Read remainders in reverse order (last remainder is the MSB). | 1100100₂ |
General formula (for base b):
[ N = \sum_{i=0}^{k} d_i,b^i \quad\text{where}\quad 0 \le d_i < b ]
2.2 Other Bases → Decimal
Iterative method:
[ N_{\text{dec}} = a_k,b^k + a_{k-1},b^{k-1} + \dots + a_1,b + a_0 ]
Example (binary to decimal):
10110₂
[
= 1\cdot2^4 + 0\cdot2^3 + 1\cdot2^2 + 1\cdot2^1 + 0\cdot2^0 = 16+0+4+2+0 = 22
]
2.3 Cross‑Base Conversion (Avoiding Decimal)
| Step | Procedure | Example |
|---|---|---|
| 1 | Convert source to decimal (or any intermediate base). | 1011₂ → 11₁₀ |
| 2 | Convert decimal to target base. | 11₁₀ → 23₈ |
Shortcut – Convert directly using repeated division in the target base on the decimal value of the source.
For instance,111₁₀ → 110111₁₀(binary) →77₈(octal) without ever writing the decimal intermediate.
2.4 Converting Fractions
| Fraction | Binary Representation |
|---|---|
| 0.5 | 0.1₂ |
| 0.25 | 0.01₂ |
| 0.125 | 0.001₂ |
General rule: Multiply the fractional part by the base, keep the integer part as the next digit, repeat with the new fractional part.
Example (decimal 0.3 to binary)
0.3 × 2 = 0.6→ digit0
0.6 × 2 = 1.2→ digit1
0.2 × 2 = 0.4→ digit0
0.4 × 2 = 0.8→ digit0
0.8 × 2 = 1.6→ digit1
Stop after 4–5 digits (or detect repetition).
3. Key Properties & Patterns
| Property | Description | Use‑Case |
|---|---|---|
| Even/Odd in Binary | Least significant bit (LSB) decides parity. | Divisibility tests, bit‑wise operations |
| Divisibility by 3 (Decimal) | Sum of digits divisible by 3 → number divisible by 3. | Quick check |
| Divisibility by 9 | Sum of digits divisible by 9 → number divisible by 9. | Similar |
| Divisibility by 11 | Alternating sum of digits divisible by 11 → number divisible by 11. | Useful in JEE‑Mains |
| Modular Arithmetic | (a \equiv b \pmod m) if (m) divides (a-b). | Simplify large‑number calculations |
| Powers of Two | (2^n) has only one 1 in binary. | Recognizing binary patterns |
| Place Values |