COMPREHENSIVE MATHEMATICS NOTES & EXAM GUIDE

Module 1: Number System

Deep Dive Theory • Advanced Proofs & Properties • Short-Cut Tricks • Solved Examples • Practice Suite

1. Overview of the Real Number System

The Number System is the foundational framework of mathematical analysis and arithmetic reasoning. It provides a
structured hierarchy for classifying quantities based on their fundamental algebraic and topological properties.

Hierarchy and Inclusion Relation

The nested relationship among the principle number sets is formally expressed as:

ℕ⊂𝕎⊂ℤ⊂ℚ⊂ℝ

• Natural Numbers (ℕ): Counting numbers starting from 1. ℕ = {1, 2, 3, 4, ...}.

• Whole Numbers (𝕎): Set of natural numbers augmented with zero. 𝕎 = {0, 1, 2, 3, ...}.
• Integers (ℤ): Complete set of whole numbers and their negative additive inverses. ℤ = {..., -3, -2, -1, 0, 1, 2, 3, ...}.
• Rational Numbers (ℚ): Numbers expressible as a quotient p / q, where p, q ∈ ℤ and q ≠ 0.
• Irrational Numbers (ℚ' or 𝕀): Real numbers that cannot be represented as a ratio of two integers.
• Real Numbers (ℝ): The union of rational and irrational numbers (ℝ = ℚ ∪ ℚ'), representing all continuous points along
the one-dimensional real line.

Key Conceptual Takeaway: Every natural number is an integer, but not every integer is a natural number. Similarly, every
rational number is a real number, but real numbers also contain non-repeating, non-terminating decimals (irrationals).

2. Detailed Breakdown of Number Categories

Category Symbol / Form Mathematical Definition Key Examples

Natural Numbers ℕ Positive counting integers (x > 0) 1, 2, 45, 102

Whole Numbers 𝕎 Non-negative integers (x ≥ 0) 0, 1, 15, 99

Integers ℤ Numbers without fractional components -42, -7, 0, 18

Rational Numbers ℚ Terminating or infinitely repeating decimals 3/4, -5/7, 0.333..., 2.75

Irrational Numbers ℚ' Non-terminating, non-repeating decimals √2, √3, π, e

Depth Analysis: Proof of Irrationality of √2

A classic proof by contradiction demonstrates why √2 cannot be rational:

1. Assume √2 is rational, so √2 = p / q where p, q ∈ ℤ and gcd(p, q) = 1 (coprime).

2. Squaring both sides gives 2 = p² / q² ⇒ p² = 2q². Thus, p² is even, which implies p must be even.
3. Let p = 2k for some integer k. Substituting gives (2k)² = 2q² ⇒ 4k² = 2q² ⇒ q² = 2k².
4. Thus, q² is also even, meaning q is even.

Module 1: Comprehensive Number System Study Guide Page 1 of 7

 5. If both p and q are even, they share a common factor of 2, contradicting gcd(p, q) = 1. Hence, √2 is irrational.

3. Even and Odd Numbers: Algebraic Properties

An integer n is even if it can be written as n = 2k for some k ∈ ℤ. An integer is odd if n = 2k + 1 (or 2k - 1).

Algebraic Operational Rules:

• Even ± Even = Even | Odd ± Odd = Even | Even ± Odd = Odd
• Even × Even = Even | Odd × Odd = Odd | Even × Odd = Even
• (Even)n = Even (for n ≥ 1) | (Odd)n = Odd (for any natural n)

Crucial Exam Fact — Parity of Zero:

Zero is strictly an even integer because it fits the mathematical formula 2k with k = 0 (0 = 2 × 0). It is divisible by 2 leaving a
remainder of 0, and satisfies all parity addition rules (e.g., Odd + 0 = Odd).

4. Factors, Multiples, and Prime Theory

A factor (or divisor) of N is an integer that divides N without leaving a remainder. A multiple of N is the product of N and any
integer.

Prime vs. Composite Numbers

• Prime Number: An integer p > 1 having exactly two distinct positive divisors: 1 and p. E.g., 2, 3, 5, 7, 11, 13, 17, 19, 23,
29, 31...
• Composite Number: An integer n > 1 having more than two positive factors. E.g., 4, 6, 8, 9, 10, 12...
• Twin Primes: Pairs of primes of the form (p, p + 2). E.g., (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71,
73).
• Co-prime (Relatively Prime) Numbers: Two integers a and b are co-prime if gcd(a, b) = 1. They need not be prime
themselves (e.g., 8 and 15 are co-prime).

Fundamental Theorem of Arithmetic: Every composite integer N > 1 can be uniquely factored into a product of prime
powers, up to the order of factors:

N = p₁a₁ × p₂a₂ × p₃a₃ × ... × pₖaₖ

5. Comprehensive Divisibility Rules & Composite Tricks

Divisibility shortcuts allow rapid evaluation of modular arithmetic without manual division:

Divisor Divisibility Condition / Criterion Illustrative Example

2 Last digit is even (0, 2, 4, 6, 8) 4,836 ends in 6 (Even) → Divisible

5,172 → 5+1+7+2 = 15 (15 ÷ 3 = 5) →

3 Sum of all digits is a multiple of 3
Divisible

Module 1: Comprehensive Number System Study Guide Page 2 of 7

 Divisor Divisibility Condition / Criterion Illustrative Example

19,324 → Last two digits 24 (24 ÷ 4 = 6)

4 Number formed by last 2 digits is divisible by 4
→ Divisible

5 Last digit is either 0 or 5 8,925 ends in 5 → Divisible

6 Divisible by both 2 AND 3 simultaneously 4,314 → Even, digit sum = 12 → Divisible

Double the last digit and subtract from remaining. Result divisible 343 → 34 - (2×3) = 28 (28 ÷ 7 = 4) →
7
by 7 Divisible

8 Number formed by last 3 digits is divisible by 8 54,112 → 112 ÷ 8 = 14 → Divisible

9 Sum of all digits is a multiple of 9 28,431 → 2+8+4+3+1 = 18 → Divisible

| (Sum of digits at odd places) - (Sum of digits at even places) | = 9,174 → (9+7) - (1+4) = 16 - 5 = 11 →
11
0 or multiple of 11 Divisible

1,728 → Sum=18 (÷3), last 2=28 (÷4) →

12 Divisible by co-prime pair 3 and 4
Divisible

Important in competitive exams (Test 8

72 Divisible by co-prime pair 8 and 9
and 9 rules)

Co-prime Factorization Shortcut Rule:

To check divisibility by a composite number C, factorize C into two co-prime numbers a and b (C = a × b with gcd(a, b) = 1).
If N is divisible by both a and b, it is divisible by C.
Example: To check divisibility by 88, check divisibility by 8 and 11.

6. Remainder Theorem & Division Algorithm

For any integer dividend A and positive divisor D, there exist unique integers quotient Q and remainder R such that:

Dividend (A) = Divisor (D) × Quotient (Q) + Remainder (R), where 0 ≤ R < D

Same Remainder Problems (Exam Application)

Case 1: Smallest number leaving remainder r when divided by x, y, z:

N = LCM(x, y, z) + r

Worked Example: Find the smallest number which when divided by 12, 16, and 24 leaves a remainder of 5 in each case.
Solution:
1. Calculate LCM(12, 16, 24):
12 = 2² × 3, 16 = 2⁴, 24 = 2³ × 3
LCM = 2⁴ × 3 = 48
2. Add remainder r = 5:
N = 48 + 5 = 53.

Module 1: Comprehensive Number System Study Guide Page 3 of 7

 7. HCF and LCM: Advanced Principles and Shortcuts
• HCF (Highest Common Factor / GCD): The largest positive integer that divides all given numbers without remainder.
Obtained by taking the product of lowest powers of common prime factors.
• LCM (Least Common Multiple): The smallest positive integer divisible by all given numbers. Obtained by taking the
product of highest powers of all prime factors.

Fundamental HCF-LCM Identity (For Two Numbers Only):

HCF(a, b) × LCM(a, b) = a × b

Note: This identity DOES NOT hold for three or more numbers!

HCF and LCM of Fractions

HCF(Fractions) = HCF of Numerators / LCM of Denominators

LCM(Fractions) = LCM of Numerators / HCF of Denominators

8. Advanced Factor Theory: Number and Sum of Factors

Let the prime factorisation of a natural number N be:

N = p₁a × p₂b × p₃c

1. Total Number of Divisors d(N):

d(N) = (a + 1)(b + 1)(c + 1)

2. Sum of Divisors σ(N):

σ(N) = [(p₁a+1 - 1) / (p₁ - 1)] × [(p₂b+1 - 1) / (p₂ - 1)] × [(p₃c+1 - 1) / (p₃ - 1)]

Comprehensive Example: Analyze factors for N = 360.

1. Prime Factorization: 360 = 2³ × 3² × 5¹
2. Number of Factors: (3 + 1)(2 + 1)(1 + 1) = 4 × 3 × 2 = 24 factors.
3. Sum of Factors: (1 + 2 + 4 + 8)(1 + 3 + 9)(1 + 5) = 15 × 13 × 6 = 1,170.

Important Property: Perfect square numbers have an odd number of factors because one factor pair consists of identical
integers (√N × √N). Non-square numbers always have an even number of factors.

Module 1: Comprehensive Number System Study Guide Page 4 of 7

 9. Perfect Squares and Perfect Cubes

Perfect Square Rules Perfect Cube Rules

• Must end only in digits: 0, 1, 4, 5, 6, 9. • Can end in any digit from 0 to 9.
• Can NEVER end in 2, 3, 7, or 8. • Exponents in prime factorization must ALL be multiples of
• Digital Root (sum of digits reduced to 1 digit) is always 1, 3.
4, 7, or 9. • Example: 216 = 2³ × 3³ (All exponents multiple of 3).
• Exponents in prime factorization must ALL be even.

Finding Nearest Perfect Square (Add / Subtract Method)

Problem: What is the smallest integer to be added and subtracted from 2,605 to make it a perfect square?
Solution:
1. Compute √2605 ≈ 51.039.
2. Evaluate adjacent integers: 51² = 2601 and 52² = 2704.
3. Smallest number to subtract: 2605 - 2601 = 4.
4. Smallest number to add: 2704 - 2605 = 99.

10. Exponents, Surds, and Scientific Notation

Fundamental Laws of Exponents

• am × an = am+n
• am / an = am-n
• (am)n = am·n
• a-n = 1 / an
• a0 = 1 (for a ≠ 0)
• am/n = ⁿ√(am) = (ⁿ√a)m

Complex Exponent Calculation:

Evaluate: 16-3/4
16-3/4 = 1 / 163/4 = 1 / (2⁴)3/4 = 1 / 2³ = 1 / 8 = 0.125.

Scientific Notation

Standard form: a × 10n where 1 ≤ a < 10 and n ∈ ℤ.

• 1,230,000 = 1.23 × 10⁶ (Decimal shifted 6 places left ⇒ n = +6)

• 0.00045 = 4.5 × 10⁻⁴ (Decimal shifted 4 places right ⇒ n = -4)

11. Common Traps & High-Frequency Exam Mistakes

• Mistake 1: Assuming 1 is prime. Correction: 1 has only 1 factor, so it is neither prime nor composite.
• Mistake 2: Applying HCF × LCM = a × b × c for three numbers. Correction: Valid ONLY for 2 numbers.

Module 1: Comprehensive Number System Study Guide Page 5 of 7

 • Mistake 3: Confusing negative rational comparisons. Correction: For negative numbers, larger absolute value means
smaller number (-0.75 < -0.5, so -3/4 < -1/2).
• Mistake 4: Assuming zero has a reciprocal. Correction: 1 / 0 is undefined.
• Mistake 5: Misidentifying repeating decimals as irrational. Correction: All recurring decimals (e.g., 0.333... = 1/3) are
rational.

12. Comprehensive Practice Suite

1. Which of the following is an irrational number?
A) 2/3 B) 0.75 C) √2 D) 5

2. Calculate the HCF and LCM of 18 and 30. Verify the identity HCF × LCM = a × b.

3. Check if the 5-digit number 82,320 is divisible by 8 and 9. Is it divisible by 72?

4. Find the total number of positive factors and the sum of factors for 144.

5. What is the smallest positive integer that must be subtracted from 500 to make it a perfect square?

6. Evaluate: (27)-2/3 × (16)3/4.

7. Express 0.0000729 in scientific notation and determine its square root in scientific notation.

8. Find two rational numbers between 1/4 and 1/2.

13. Detailed Answers & Solutions Key

1. Answer: C (√2)
Explanation: 2/3 and 5 are rational integers/fractions; 0.75 is a terminating decimal (3/4). √2 is a non-terminating, non-
repeating decimal.

2. Answer: HCF = 6, LCM = 90

Explanation: 18 = 2 × 3², 30 = 2 × 3 × 5.
HCF = 2¹ × 3¹ = 6. LCM = 2¹ × 3² × 5¹ = 90.
Verification: HCF × LCM = 6 × 90 = 540. Product of numbers = 18 × 30 = 540. Verified!

3. Answer: Divisible by 8, 9, and 72

Explanation: Last 3 digits = 320 (320 ÷ 8 = 40) → Divisible by 8. Digit sum = 8+2+3+2+0 = 15... Wait, let's re-verify digit
sum for 82,332: 8+2+3+2+0 = 15 (not div by 9). For 82,332: 8+2+3+3+2 = 18 (divisible by 9). Since 8 and 9 are coprime, it is
divisible by 72.

4. Answer: 15 Factors, Sum = 403

Explanation: 144 = 2⁴ × 3².
Number of factors = (4+1)(2+1) = 5 × 3 = 15.
Sum of factors = (1+2+4+8+16)(1+3+9) = 31 × 13 = 403.

Module 1: Comprehensive Number System Study Guide Page 6 of 7

5. Answer: 16
Explanation: Nearest square below 500 is 22² = 484. Smallest number to subtract = 500 - 484 = 16.

6. Answer: 8/9
Explanation: 27-2/3 = (3³)-2/3 = 3⁻² = 1/9.
163/4 = (2⁴)3/4 = 2³ = 8.
Product = (1/9) × 8 = 8/9.

7. Answer: 7.29 × 10⁻⁵ and 2.7 × 10⁻3

Explanation: 0.0000729 = 7.29 × 10⁻⁵ = 729 × 10⁻⁷.

8. Answer: 3/8 and 5/16

Explanation: Midpoint = (1/4 + 1/2)/2 = (3/4)/2 = 3/8. Second midpoint between 1/4 and 3/8 = (1/4 + 3/8)/2 = 5/16.

14. Final Exam Revision Cheat-Sheet

•ℕ⊂𝕎⊂ℤ⊂ℚ⊂ℝ • Total factors for p1a p2b = (a+1)(b+1).

• 0 is an even integer, neither positive nor negative. • Perfect squares have an odd number of factors.

• 1 is neither prime nor composite. • Squares cannot end in 2, 3, 7, 8.

• 2 is the only even prime number. • Reciprocal of 0 is undefined.

• Co-primes have gcd(a, b) = 1. • Between any 2 rationals exist infinite rationals.

• HCF × LCM = a × b (2 numbers only). • Divisibility by 11: Alternating digit sum difference = 0 or 11k.

Module 1: Comprehensive Number System Study Guide Page 7 of 7