SRMJEEE /Aptitude

Number Systems & Percentages

Quantitative Aptitude - Arithmetic · free study notes

📚 SRMJEEE – Aptitude: Number Systems & Percentages

Audience – Students preparing for competitive exams (SRMJEEE, JEE, JEE‑Main, GATE, GRE, GMAT).
Goal – Build a deep understanding from first principles, with rigorous reasoning, edge‑case awareness, and a challenging exercise that ties the two topics together.

📌 Tip: Work through the examples, then attempt the Challenging Problem before reading the solution.


1. Number Systems

Base Common Symbols Usable Characters Typical Application
2 0,1 – Computer logic, binary arithmetic
8 0–7 – Octal is rarely used today
10 0–9 – Human‑readable decimal
16 0–9, A–F – Hexadecimal, memory addresses

1.1 Positional Notation – The First Principle

A number in base (b) is expressed as: [ N = \sum_{k=0}^{m-1} d_k b^k \quad \text{with}; 0 \le d_k < b ]

  • (d_k) are the digits (coefficients).
  • (b^k) is the place value for the (k)-th digit from the right (least significant digit, LSD).

Proof of Uniqueness

Suppose two different digit sequences represent the same integer (N).
Let the sequences have lengths (m) and (n) with (m>n).
The representation with the larger length must contain a non‑zero leading digit (d_{m-1}\ge1).
Then: [ N \ge d_{m-1} b^{m-1} \ge b^{m-1} ] But the shorter representation satisfies: [ N < b^{n} \le b^{m-1} ] Contradiction → representation is unique.

1.2 Converting Between Bases

(a) Decimal → Base (b) (Repeated Division)

  1. Divide the decimal number (N) by (b).
  2. Record the remainder (r_0).
  3. Repeat with the quotient until it becomes 0.
  4. The base‑(b) digits are (r_{k-1} r_{k-2}\dots r_0) (reversed order).

(b) Base (b) → Decimal (Repeated Multiplication)

[ N = \sum_{k=0}^{m-1} d_k b^k = d_0 + d_1 b + d_2 b^2 + \dots ]

(c) Direct Base‑(b_1) → Base‑(b_2) (Using Decimal Intermediate)

  • Convert to decimal (or a common intermediate).
  • Then convert from decimal to target base.

Edge Cases

  • Zero: Representation is (0) in any base.
  • Negative numbers: Use sign-magnitude, two’s complement, or ones’ complement (see §1.3).
  • Large numbers: Use big‑integer algorithms or logarithmic bounds:
    [ \log_b N \approx \frac{\ln N}{\ln b} ] gives the digit count.

1.3 Signed Number Representations

Representation Encoding of -0 Range (for (w) bits) Comment
Sign‑Magnitude +0 / –0 ([-(2^{w-1}-1), 2^{w-1}-1]) Two zeros
Two’s Complement –0 absent ([-2^{w-1}, 2^{w-1}-1]) Preferred in digital systems
Ones’ Complement –0 present ([-(2^{w-1}-1), 2^{w-1}-1]) Rare

Two’s Complement Arithmetic

  • Addition: Add bits with carry; ignore overflow beyond (w) bits.
  • Subtraction: Add the two’s complement of the subtrahend.
  • Proof: For any two (w)-bit numbers (a, b), [ a + b \equiv a + b \pmod{2^w} ] thus the result is correctly wrapped.

Edge Cases

Your note

Page 1

Doubt hai is topic me?

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