Quantitative Aptitude – Number System
Advanced University‑level (MIT‑style) Notes
Target: B.Ed Entrance, Quantitative Aptitude
1. Introduction
A number system is a set equipped with operations that obey algebraic laws.
In aptitude problems we usually work with:
| Symbol | Set | Definition | Example |
|---|---|---|---|
| ℕ | Natural Numbers | (1,2,3,\dots) | 5 |
| ℤ | Integers | ( \dots,-2,-1,0,1,2,\dots) | –3 |
| ℚ | Rationals | (\frac{p}{q}, p,q\in\mathbb Z,,q\neq0) | (\frac12) |
| ℝ | Reals | All limits of Cauchy sequences of ℚ | (\sqrt2) |
| ℂ | Complex | (a+bi,,a,b\in\mathbb R) | (3-5i) |
Why these matter?
Many aptitude questions involve integer arithmetic, prime factorisation, modular relations, or base‑conversion. A firm grasp of the underlying sets and operations lets you solve problems quickly and avoid pitfalls.
2. Fundamental Properties of Numbers
| Property | Statement | Consequence in Aptitude | Edge‑case note |
|---|---|---|---|
| Closure | (a,b\in S \implies a\pm b,,ab\in S). | Enables “carry‑over” reasoning. | In ℕ, subtraction may leave ℤ. |
| Associativity | ((a+b)+c=a+(b+c)). | Simplifies grouping of digits. | None. |
| Commutativity | (a+b=b+a). | Reordering of terms. | None. |
| Distributivity | (a(b+c)=ab+ac). | Key in expanding polynomial forms. | None. |
| Identity Elements | (0) for addition, (1) for multiplication. | Setting up equations. | 0 is not invertible in ℤ. |
| Inverses | (-a) for addition; (a^{-1}) for multiplication (if (a\neq0)). | Division problems. | Rational inverses are rational. |
| Euclidean Algorithm | For (a,b\in\mathbb Z,) there exist (q,r) with (a=bq+r,\ 0\le r< | b | ). |
| Fundamental Theorem of Arithmetic | Every integer (>1) has a unique prime factorisation. | Basis for problems on divisibility, lcm/gcd. | Edge case: prime (2). |
3. Number Representation & Bases
3.1 Base‑(k) Notation
A number (N) in base (k) ((k\ge2)) is written
[ N = \sum_{i=0}^{m} d_i k^i,\qquad 0\le d_i < k ]
- Digits (d_i) are integers.
- The most significant digit (MSD) is (d_m).
3.2 Converting Between Bases
Algorithm (decimal → base‑(k))
while N>0:
d = N mod k
prepend d to list
N = floor(N/k)
Algorithm (base‑(k) → decimal)
[
N = \sum d_i k^i
]
3.3 Special Bases
| Base | Remark | Typical Uses |
|---|---|---|
| 2 | Binary; used in computer science | Even–odd tests, parity |
| 8 | Octal | Early computer systems |
| 10 | Decimal | Everyday math |
| 16 | Hexadecimal | Computer memory addresses |
3.4 Edge Cases
| Case | Issue | Handling |
|---|---|---|
| Leading zeros | Do not change value | Strip them |
| Negative numbers | Represent as (-N) or two’s complement in binary | Keep sign separate |
| Infinite series | e.g. (0.\overline{1}) in base 10 → (1/9) | Recognise repeating decimals |
| Non‑integral bases | e.g. base 1.5 | Not used in aptitude |
4. Divisibility & Modular Arithmetic
4.1 Divisibility Tests
| Divisor | Test | Rationale |
|---|---|---|
| 2 | Evenness | Last digit even |
| 3 | Sum of digits divisible by 3 | (10\equiv1\pmod3) |
| 4 | Last two digits divisible by 4 | (100\equiv0\pmod4) |
| 5 | Last digit 0 or 5 | (10\equiv0\pmod5) |
| 6 | Divisible by 2 & 3 | LCM(2,3)=6 |
| 9 | Sum of digits divisible by 9 | (10\equiv1\pmod9) |
| 11 | Alternating sum divisible by 11 | (10\equiv-1\pmod{11}) |
| 12 | Divisible by 3 & 4 | LCM(3,4)=12 |
Proof sketch (3, 9, 11)
For digit sum test: (N=\sum d_i 10^i). Mod 3, (10^i\equiv1^i\equiv1), so (N\equiv\sum d_i\pmod3). Similar for 9.
For 11, (