Number System – Quantitative Aptitude (IIT‑JEE / Competitive)
Audience – Manipur Police Constable exam candidates
Goal – Master the core concepts of number systems, develop proof‑based reasoning, and solve high‑level problems efficiently.
1. Foundations
| Concept | Symbol | Definition |
|---|---|---|
| Integers | $\mathbb Z$ | $\dots,-3,-2,-1,0,1,2,3,\dots$ |
| Rational | $\mathbb Q$ | $\frac{p}{q},; p,q\in\mathbb Z,; q\neq0$ |
| Irrational | – | Numbers that cannot be expressed as a fraction (e.g., $\sqrt{2}$, $\pi$) |
| Real | $\mathbb R$ | $\mathbb Q\cup{\text{irrational}}$ |
| Complex | $\mathbb C$ | $a+bi,; a,b\in\mathbb R,; i^2=-1$ |
| Prime | – | Integer $>1$ with no positive divisors other than $1$ and itself |
| Composite | – | Integer $>1$ that is not prime |
| Perfect Square | – | $n=k^2$ for some integer $k$ |
| Perfect Cube | – | $n=k^3$ for some integer $k$ |
Key Insight – Many problems reduce to integer properties; always check for primality, square/cube, or divisibility.
2. Positional Number Systems
2.1 General Representation
In base $b$ ($b\ge2$), a number $N$ is represented as
[ N = \sum_{i=0}^{k} a_i,b^i,\qquad 0\le a_i < b. ]
- Digits: $a_i$ are called digits.
- Radix: $b$ is the radix or base.
2.2 Common Bases
| Base | Symbol | Notation | Example |
|---|---|---|---|
| Decimal | 10 | $123_10$ | $1\cdot10^2+2\cdot10+3=123$ |
| Binary | 2 | $1011_2$ | $1\cdot2^3+0\cdot2^2+1\cdot2+1=11$ |
| Octal | 8 | $755_8$ | $7\cdot8^2+5\cdot8+5=485$ |
| Hexadecimal | 16 | $1A3_{16}$ | $1\cdot16^2+10\cdot16+3=419$ |
Tricky Point – In hexadecimal, digits 10–15 are represented by A–F.
3. Conversions
3.1 Decimal → Base $b$
Repeated division:
N / b = q0 remainder r0
q0 / b = q1 remainder r1
...
Digits appear in reverse of remainders: $r_{k-1}r_{k-2}\dots r_0$.
3.2 Base $b$ → Decimal
[ N = \sum_{i=0}^{k} a_i,b^i. ]
3.3 Base $b_1$ ↔ Base $b_2$ (via Decimal)
- Convert from $b_1$ to decimal.
- Convert decimal to $b_2$.
4. Divisibility Rules (Key for Rapid Checking)
| Divisor | Test |
|---|---|
| 2 | Last digit even |
| 3 | Sum of digits divisible by 3 |
| 4 | Last two digits divisible by 4 |
| 5 | Last digit 0 or 5 |
| 6 | Divisible by 2 and 3 |
| 7 | Rule of 2: Remove last digit, double it, subtract from remaining truncated number; repeat. |
| 8 | Last three digits divisible by 8 |
| 9 | Sum of digits divisible by 9 |
| 10 | Last digit 0 |
| 11 | Alternating sum of digits divisible by 11 |
| 12 | Divisible by 3 and 4 |
Tricky Point – For 7, 11, 13, the pattern can be remembered using alternating sums or doubling tricks.
5. Number‑Theory Essentials
5.1 Fundamental Theorem of Arithmetic
Every integer $n>1$ can be written uniquely (up to order) as a product of primes:
[ n = p_1^{e_1}p_2^{e_2}\dots p_k^{e_k}. ]
Use – Factorization is the backbone of GCD, LCM, and many divisibility problems.
5.2 Greatest Common Divisor (GCD) & Least Common Multiple (LCM)
- GCD: $\gcd(a,b) = \max{d: d|a,; d|b}$.
- LCM: $\operatorname{lcm}(a,b) = \frac{|ab|}{\gcd(a,b)}$.
Tricky Point – For large numbers, compute GCD first to reduce overflow.
5.3 Euler’s Totient Function $\phi(n)$
[ \phi(n)=\begin{cases} \prod_{p|n}(