Number System – Study Notes
Topic: Number System
Program: NIA Recruitment
Subject: Quantitative Aptitude
1. Simple Explanation
The number system is the foundation of all arithmetic. It defines what symbols we use to represent digits and how we combine them to form numbers.
- Base (Radix) – the number of unique symbols (including zero) used.
- Place value – the value of a digit depends on its position relative to the decimal point.
- Common bases –
- Decimal (base‑10) : digits 0‑9.
- Binary (base‑2) : digits 0,1.
- Octal (base‑8) : digits 0‑7.
- Hexadecimal (base‑16) : digits 0‑9 and letters A‑F (10‑15).
Understanding bases helps in converting numbers, simplifying calculations, and solving aptitude problems that involve patterns, divisibility, or digital sums.
2. Key Points
| Concept | Details | Quick Tip |
|---|---|---|
| Place Value | Value of a digit = digit × (base)^(position). Positions counted from right to left starting at 0. | Remember 10^0, 10^1, 10^2… for decimal; similarly 2^0, 2^1… for binary. |
| Conversion (Decimal ↔ other bases) | To base b: repeatedly divide by b, record remainders (reverse order). To decimal: sum digit × b^position. |
Practice with small numbers first; use a table to keep track. |
| Divisibility Rules | - Base‑10: 3 & 9 → sum of digits, 2 & 5 → last digit, 4 → last two digits, 6 → divisible by 2 & 3, 8 → last three digits. - Base‑2: Even numbers end in 0. |
Helps in quick checks for large numbers. |
| Digit Sum (Digital Root) | Repeatedly sum digits until a single digit remains. In base‑10, it's congruent to the number mod 9 (and mod 3). | Useful for checking calculations and spotting errors. |
| Complementary Numbers | In base‑10, 9’s complement = 9‑digit; 10’s complement = 10‑digit. In base‑2, 1’s and 2’s complements. | Handy for subtraction and error detection. |
| Patterns in Powers | Recognize repeating cycles in units digit (e.g., 3^1=3, 3^2=9, 3^3=27→7, 3^4=81→1, cycle length 4). | Helps in last‑digit questions. |
| Binary Operations | Addition, subtraction, multiplication follow the same carry/borrow rules but with base 2. | Binary addition: 1+1=10 (carry 1). |
3. Worked Example
Problem (Typical NIA Recruitment Question)
The number 3,456,789 is written in base‑10. Find its value in base‑2 (binary) and then determine the sum of its binary digits.
Step 1: Convert 3,456,789 to binary
- Divide by 2, keep remainder.
- Repeat with quotient until quotient = 0.
- Read remainders in reverse.
| Division | Quotient | Remainder |
|---|---|---|
| 3,456,789 ÷ 2 | 1,728,394 | 1 |
| 1,728,394 ÷ 2 | 864,197 | 0 |
| 864,197 ÷ 2 | 432,098 | 1 |
| 432,098 ÷ 2 | 216,049 | 0 |
| 216,049 ÷ 2 | 108,024 | 1 |
| 108,024 ÷ 2 | 54,012 | 0 |
| 54,012 ÷ 2 | 27,006 | 0 |
| 27,006 ÷ 2 | 13,503 | 0 |
| 13,503 ÷ 2 | 6,751 | 1 |
| 6,751 ÷ 2 | 3,375 | 1 |
| 3,375 ÷ 2 | 1,687 | 1 |
| 1,687 ÷ 2 | 843 | 1 |
| 843 ÷ 2 | 421 | 1 |
| 421 ÷ 2 | 210 | 1 |
| 210 ÷ 2 | 105 | 0 |
| 105 ÷ 2 | 52 | 1 |
| 52 ÷ 2 | 26 | 0 |
| 26 ÷ 2 | 13 | 0 |
| 13 ÷ 2 | 6 | 1 |
| 6 ÷ 2 | 3 | 0 |
| 3 ÷ 2 | 1 | 1 |
| 1 ÷ 2 | 0 | 1 |
Reading remainders from bottom to top gives:
Binary Representation:
110101011010110100101001
(You can verify using a calculator or a conversion tool.)
Step 2: Sum of Binary Digits
Count the number of 1s:
110101011010110100101001
↑ ↑ ↑ ↑ ↑ ↑ ↑
There are 12 ones.
Answer: The binary sum of digits is 12.
4. Quick Revision Summary
- Base & Place Value – understand digits × base^position.
- Conversions – divide by base for
→other base; multiply digit × base^pos for→decimal. - Divisibility – use digit sums for 3 & 9; last digit for 2 & 5; last two/three digits for 4 & 8.
- Digital Root – reduces large numbers to a single digit (mod 9).
- Binary Basics – addition carry 1, subtraction borrow 1; use for quick logic checks.
- Patterns – remember unit digit cycles for powers (length 4 in base‑10).
Practice Question
If a base‑10 number ends with the digits 1234, what is its remainder when divided by 4?
Answer: Look at last two digits → 34. 34 ÷ 4 = 8 remainder 2. So remainder = 2.
Use these notes to master number systems and ace