Number system

Arithmetic · free study notes · Updated

📚 Study Notes – Number System

(For the Andaman & Nicobar Islands Forest Guard – Quantitative Aptitude)


1. Simple Explanation

Number system refers to the way we represent numbers using a set of digits and a base (radix).

  • Base (radix): The number of unique digits, including zero, that a positional numeral system uses.
  • Positional notation: The value of a digit depends on its position (place value).

Common bases:

  • Binary (base‑2) – digits 0,1
  • Octal (base‑8) – digits 0–7
  • Decimal (base‑10) – digits 0–9 (our everyday system)
  • Hexadecimal (base‑16) – digits 0–9 and letters A–F

2. Key Points

Concept What It Means Quick Tip
Place Value ( \text{digit} \times \text{base}^{\text{position}} ) Right‑most digit = ( \text{base}^0 )
Converting from base‑10 to another base Repeated division by the new base; remainders give digits (right‑to‑left). Keep remainders in a stack / list.
Converting to base‑10 Sum of each digit × base^position. Useful for verifying conversions.
Adding/Subtracting in any base Same as decimal; carry/borrow > base. Remember carry = 1 when sum ≥ base.
Multiplication Long multiplication with carries; each intermediate product may be > base. Use “carry‑over” rule: carry = ⌊product/base⌋
Division Long division; bring down digits; quotient digit < base. Remainders < base.
Powers of 2, 5, 10 2ⁿ → binary, 5ⁿ → decimal ends with 5^n zeros, 10ⁿ → decimal ends with n zeros. Helps in mental arithmetic.
Greatest Common Divisor (GCD) / Least Common Multiple (LCM) Use Euclidean algorithm; works in any base if you work in base‑10 internally. Convert to base‑10 for calculations, then back.
Prime Factorization Break number into primes; use for GCD/LCM, divisibility tests. e.g., 12 = 2² × 3.
Divisibility Rules Quick checks for divisibility by 2,3,5,7,9,11, etc. Example: sum of digits divisible by 3 → number divisible by 3.
Modular Arithmetic Remainder after division; useful for cyclic patterns. 7 mod 3 = 1.

3. Worked Example

Problem
Convert the decimal number 345 to binary, octal, and hexadecimal. Then add the binary and octal results.

Step 1: Convert 345 to Binary

Repeated division by 2:

Division Quotient Remainder
345 ÷ 2 172 1
172 ÷ 2 86 0
86 ÷ 2 43 0
43 ÷ 2 21 1
21 ÷ 2 10 1
10 ÷ 2 5 0
5 ÷ 2 2 1
2 ÷ 2 1 0
1 ÷ 2 0 1

Read remainders bottom‑up: 101011001₂

Step 2: Convert 345 to Octal

Repeated division by 8:

Division Quotient Remainder
345 ÷ 8 43 1
43 ÷ 8 5 3
5 ÷ 8 0 5

Read bottom‑up: 531₈

Step 3: Convert 345 to Hexadecimal

Repeated division by 16:

Division Quotient Remainder
345 ÷ 16 21 9
21 ÷ 16 1 5
1 ÷ 16 0 1

Read bottom‑up: 159₁₆

Step 4: Add Binary and Octal Results

First, write both numbers in binary:

  • Binary of Octal 531₈ → convert each octal digit to 3 binary digits:
    5 → 101, 3 → 011, 1 → 001 → 101011001₂

  • Binary of Decimal 345 is already 101011001₂.

Add them (binary addition):

  101011001
+ 101011001
------------
 1010110010

Result in binary: 1010110010₂
Convert back to decimal:
(1×2^9 + 0×2^8 + 1×2^7 + 0×2^6 + 1×2^5 + 1×2^4 + 0×2^3 + 0×2^2 + 1×2^1 + 0×2^0 = 682)

Answer: 682 in decimal.


4. Quick Revision Summary

  • Place value: digit × base^position.
  • Base conversion:
    • To another base – divide by new base, record remainders.
    • From another base – sum digit × base^position.
  • Arithmetic: carry/borrow rules use the base.
  • Divisibility: use digit sums, last digits, etc.
  • Modulus: remainder after division; useful for patterns.
  • Prime factorisation: essential for GCD/LCM, divisibility checks.

Tips for the Exam

  1. Always write down the base when you’re converting or adding.
  2. Check your work by converting back to decimal.
  3. Practice quick conversions (e.g., 5 in binary = 101, 7 in octal = 7).
  4. Use divisibility rules to avoid full division.
  5. Keep a small table of common conversions handy (e.g., 15

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.