Number System – SSC Selection Post (Quantitative Aptitude)
Purpose – To give you a quick, clear understanding of the most common number‑system topics that appear in the SSC Selection Post exam.
Time to study – 20 min (read once, skim again before the exam)
1. Simple Explanation
A number system is a way of writing numbers using a fixed set of symbols (digits) and a base (radix).
The most common systems you’ll encounter:
| System | Base | Digits | Uses | Quick Facts |
|---|---|---|---|---|
| Decimal | 10 | 0‑9 | Everyday arithmetic | Largest base used in exams |
| Binary | 2 | 0,1 | Computer logic | Powers of 2 |
| Octal | 8 | 0‑7 | Legacy computer systems | Powers of 8 |
| Hexadecimal | 16 | 0‑9, A‑F | Computer memory | Powers of 16 |
| Fractional | – | 0‑9 | Rational numbers | Decimal fractions |
Key operations:
- Place value: each position represents a power of the base.
- Conversion: from one base to another by repeated division (to base 10) or multiplication (from base 10).
- Modulus & divisibility rules: help check remainders quickly.
2. Key Points
| Topic | What to know | Example |
|---|---|---|
| Place Value | dₙdₙ₋₁…d₁d₀ → value = Σ dᵢ × baseⁱ |
In octal 345 = 3×8² + 4×8¹ + 5×8⁰ = 229 |
| Converting to Base 10 | Keep dividing by the target base; record remainders | 1011₂ → 1×2³ + 0×2² + 1×2¹ + 1×2⁰ = 11 |
| Converting from Base 10 | Keep multiplying remainder by the new base; read digits backwards | 45₁₀ → 45÷16=2 r13 → 2×16 + 13 → 2D₁₆ |
| Divisibility Rules | • 2 – last digit even. • 3 – sum of digits divisible by 3. • 5 – last digit 0 or 5. • 9 – sum of digits divisible by 9. • 11 – alternating sum difference divisible by 11. |
987654₁₀ divisible by 9? 9+8+7+6+5+4=39 → 3+9=12 → 1+2=3 → not divisible. |
| Remainder by Power of Base | Remainder when dividing by 2ⁿ is the lower n bits (binary). | 13 ÷ 8 → remainder 5 (binary 1101 → lower 3 bits 101 = 5). |
| Patterns in Powers | 2ⁿ ends in 2,4,8,6 cycle. 5ⁿ ends in 5, 7ⁿ ends in 7,3,1,9. | 2⁷ = 128 → ends in 8. |
| Decimal Fractions | Repeating part length = LCM of factors of denominator (2,5) after reducing. | 1/7 = 0.142857… (cycle 6). |
| Common Conversions in Exam | Binary ↔ Decimal, Octal ↔ Decimal, Hex ↔ Decimal, Decimal ↔ Binary. | 0x1A3 → 1×16² + 10×16¹ + 3 = 419 |
3. Worked Example (Full Solution)
Question
Find the remainder when
111110101₂is divided by 8.
Step‑by‑Step
-
Identify the property
Remainder when dividing by 8 (2³) is given by the lower 3 binary digits. -
Extract lower 3 bits
111110101₂→ lower 3 bits =101₂. -
Convert to decimal
101₂ = 1×2² + 0×2¹ + 1×2⁰ = 4 + 0 + 1 = 5. -
Answer
Remainder = 5
4. Quick Revision Summary
| Concept | Quick Check |
|---|---|
| Place value | Multiply each digit by baseⁱ (i = position from right, starting 0). |
| To‑Base‑10 | Divide by base, keep remainders. |
| From‑Base‑10 | Multiply remainder by new base, record digits backwards. |
| Divisibility | 2,3,5,9,11,7,13 – remember the digit/ sum rule. |
| Power patterns | 2ⁿ cycle 2‑4‑8‑6; 5ⁿ always ends in 5; 7ⁿ cycle 7‑9‑3‑1. |
| Remainder by 2ⁿ | Use last n bits. |
| Fraction cycle length | After removing 2s and 5s from denominator, cycle = least common multiple of remaining primes. |
Tip: Practice 5–10 conversion problems each day and flashcard the divisibility rules. Good luck!