Number System

1. Complex Numbers (ℂ)

 General form: a + bi, where
o a = real part

o b = imaginary part

o i = √(-1)

 Example: 3 + 2i, -5 + i, 7 (when b=0 → purely real)

➡Types:
 Real Numbers (b = 0)
 Purely Imaginary Numbers (a = 0, e.g. 5i, -7i)

2. Real Numbers (ℝ)

 Numbers that can be represented on the number line.
 Includes Rational + Irrational numbers.
➡Types of Real Numbers:
(a) Rational Numbers (ℚ)
 Form: p/q, where p, q ∈ Integers, q ≠ 0
 Decimal form: terminating or repeating.
 Examples: 1/2, -3/4, 5, 0.333...
 Subtypes:
1. Integers (ℤ) → … -3, -2, -1, 0, 1, 2, 3 …
 Whole Numbers (W) → 0, 1, 2, 3, …

 Natural Numbers (ℕ) → 1, 2, 3, …

2. Fractions → proper, improper, mixed fractions.

3. Recurring Decimals → 0.333…, 2.142142...
(b) Irrational Numbers
 Cannot be expressed as p/q.
 Decimal expansion: non-terminating, non-repeating.
 Examples: √2, √3, π, e.
3. Imaginary Numbers
 Numbers involving √(-1) = i.
 Examples: i, 2i, -7i.

4. Special Sets of Numbers

 Prime Numbers → greater than 1, divisible only by 1 and
itself. (2, 3, 5, 7, 11 …)
 Composite Numbers → more than two factors. (4, 6, 9 …)
 Even Numbers → divisible by 2. (…, -4, -2, 0, 2, 4 …)
 Odd Numbers → not divisible by 2. (…, -3, -1, 1, 3, 5 …)

Divisibility Rules

Quick tests without actual division:

 By 2 → Last digit even (0, 2, 4, 6, 8)
 By 3 → Sum of digits divisible by 3
 By 4 → Last 2 digits divisible by 4
 By 5 → Last digit 0 or 5
 By 6 → Divisible by both 2 and 3
 By 8 → Last 3 digits divisible by 8

  By 9 → Sum of digits divisible by 9
 By 11 → (Sum of odd-position digits – Sum of even-
position digits) divisible by 11

Power Cycle (Last Digit of Powers)

When powers increase, last digits repeat in cycles.

👉 Method:
 Find last digit of base.
 Identify cycle length.
 Divide power by cycle length to find position.
Common Cycles:
 Last digit 2 → 2, 4, 8, 6 (cycle length 4)
 Last digit 3 → 3, 9, 7, 1 (length 4)
 Last digit 4 → 4, 6 (length 2)
 Last digit 7 → 7, 9, 3, 1 (length 4)
 Last digit 8 → 8, 4, 2, 6 (length 4)
 Last digit 9 → 9, 1 (length 2)
Examples
1. Find last digit of 7^{35}
 Cycle for 7 → (7,9,3,1) length 4
 35 ÷ 4 → remainder 3 → 3rd digit = 3
  Find last digit of 12^{58}Last digit = 2 → cycle (2,4,8,6)
 58 ÷ 4 → remainder 2 → 2nd digit = 4

Remainder Cycle:
Remainder cycle is entirely different from unit digit cycle. But
the same process which is used in unit digit cycle can be used to
find out remainder cycle.
𝒙𝒏
i.e., we need to find the pattern for 𝑹 ( ),
𝒚

E.g.: What will be the remainder when 492 is divided by 7?

41
R( ) = 4
7
42
R( ) = 2
7
43
R( ) = 1
7
44
R( ) = 4
7
So, we can say that the remainder series of powers of 4 is 3
i.e., the cycle repeats itself after three values. (4, 2 and 1)
92
R( ) = 2. So, substitute 2 instead of
3
𝟒𝟗𝟐 𝟒𝟐
R( ) = R( ) = 2
𝟕 𝟕

Factors:
Factors of a number are the numbers which will exactly divide
the given number without leaving any remainders
Factors of 12 = {1, 2, 3, 4, 6, 12}

Properties of Factors:
1. Every number has 1 and the number itself as factors.
(e.g., 7 → factors are 1 and 7).
2. Factors are always ≤ the number.
3. Every number has a finite number of factors.
4. If a number has exactly two factors (1 and itself), it is a
prime number.
Multiples

 Definition:
A multiple of a number is obtained by multiplying it with
natural numbers (1, 2, 3, …).
 Example:
Multiples of 4 = {4, 8, 12, 16, 20, …}
Properties of Multiples:
1. The smallest multiple of a number is the number itself.
(e.g., smallest multiple of 7 is 7).
2. Every number has infinite multiples.
3. Zero (0) is a multiple of every number.
4. Multiples are always ≥ the number.

1. Highest Common Factor (HCF)

 Definition:
The largest number that divides exactly (without
remainder) two or more given numbers.
Also called GCD (Greatest Common Divisor).
 Methods to find HCF:
1. Prime Factorization Method:
Write prime factors of each number → Take common
factors with the smallest power → Multiply them.
 Example:
Find HCF of 18, 24.
 18 = 2 × 3²
 24 = 2³ × 3
Common factors = 2¹ × 3¹ = 6

2. Lowest Common Multiple (LCM)

 Definition:
The smallest number that is divisible by two or more given
numbers.
 Methods to find LCM:
1. Prime Factorization Method:
Write prime factors of each number → Take all
factors with the highest powers → Multiply them.
Example:
Find LCM of 18, 24.
 18 = 2 × 3²
 24 = 2³ × 3
LCM = 2³ × 3² = 72
NOTE:

Type Approach
Find the greatest number that HCF (a, b, c)
will exactly divide a, b and c
Find the greatest number that HCF (a - x, b - y, c - z)
will divide a, b and c leaving
remainders of x, y and z
respectively.
Find the greatest number which HCF (a - b, b - c, c - a)
when it divides a, b and c will
leave the same remainder in each
case.
Find the least number which is LCM (a, b, c)
exactly divisible by a, b and c.
Find the least number which LCM (a, b, c) + r
when divided by a, b and c
leaves the same remainder ‘r’ in
each case.
Practice Problems

Q1. Is 735 divisible by 5?

Sol: A number is divisible by 5 if its last digit is 0 or 5. Here last
digit = 5 → divisible.
Q2. Check divisibility of 472 by 11.
Sol: Rule: Difference of (sum of odd place digits) – (sum of
even place digits). = (4+2) – (7) = –1 → Not divisible.
Q3. Find smallest number to be added to 5743 to make it
divisible by 9.
Sol: Sum of digits = 19 → remainder when divided by 9 = 1. So
add = 9–1=8.
Q4. Which is divisible by 8: 624, 917, 1352?
Sol: Last 3 digits check. 624 and 1352 divisible, 917 not.
Q5. Check if 37845 is divisible by 15.
Sol: Rule: Divisible by both 3 & 5. Sum=27 divisible by 3, last
digit=5 divisible by 5 → divisible.
Q6. Find remainder when 3271 is divided by 9.
Sol: Sum=13, remainder=4.
Q7. Find smallest 4-digit number divisible by 21.
Sol: 1000 ÷ 21 = remainder 13, so number = 1008.
Q8. Is 10101 divisible by 99?
Sol: Must be divisible by 9 and 11. Fails divisibility by 9 → not
divisible.
Q9. Find last digit of 7^35.
Sol: Cycle 7,9,3,1 length=4. 35 mod 4 = 3 → 3rd=3.
Q10. Last digit of 9^48?
Sol: Cycle 9,1 length=2. 48 mod 2 = 0 → last digit=1.
Q12. Last digit of 2^121.
Sol: Cycle 2,4,8,6 length=4. 121 mod 4=1 → digit=2.
Q13. Last digit of 15^93.
Sol: Always ends with 5.
Q14. Last digit of 8^67.
Sol: Cycle 8,4,2,6 length=4. 67 mod 4=3 → digit=2.
Q15. Last digit of 11^2025.
Sol: Always ends with 1.
Q17. Find remainder when 2^25 ÷ 7.
Sol: Cycle 2,4,1 length=3. 25 mod 3=1 → remainder=2.
Q18. Remainder of 3^45 ÷ 5.
Sol: Cycle 3,4,2,1 length=4. 45 mod 4=1 → remainder=3.
Q19. Remainder of 7^103 ÷ 12.
Sol: Cycle 7,1 length=2. Odd power → remainder=7.
Q20. Find remainder when 2^100 ÷ 13.
Sol: Cycle length=12. 100 mod 12=4 → remainder=8.
Q21. Find number of factors of 120.
Sol: 120=2^3×3×5. Factors=(3+1)(1+1)(1+1)=16.
Q22. Find sum of factors of 36.
Sol: 36=2^2×3^2. Sum=(1+2+4)(1+3+9)=91.
Q23. Find greatest 3-digit multiple of 27.
Sol: 999 ÷ 27=37 → divisible. Ans=999.
Q24. How many multiples of 9 between 100 and 1000?
Sol: First=108, last=999. Count=(999–108)/9+1=100.
Q25. Find total even factors of 360.
Sol: 360=2^3×3^2×5. Even factors=(3)(3)(2)=18.
Q26. Find HCF of 252 and 198.
Sol: 252=2^2×3^2×7, 198=2×3^2×11. HCF=18.
Q27. Smallest number divisible by 12 and 18.
Sol: LCM=36.
Q28. Find number of factors of 5040.
Sol: 5040=2^4×3^2×5×7. Factors=(5)(3)(2)(2)=60.
Q29. Find HCF of 48 and 64.
Sol: 48=2^4×3, 64=2^6. HCF=16.
Q30. Find LCM of 18 and 24.
Sol: 18=2×3^2, 24=2^3×3. LCM=72.
Q31. Two numbers are 72 and 120. Find HCF×LCM.
Sol: =Product=8640.
Q32. Find HCF of 27, 63, 81.
Sol: 27=3^3, 63=3^2×7, 81=3^4. HCF=9.
Q33. LCM of 25, 30, 40?
Sol: 25=5^2, 30=2×3×5, 40=2^3×5. LCM=600.
Q34. Smallest number divisible by 12,18,24 with remainder 3?
Sol: LCM=72. → 72k+3 → 75.
Q35. Three bells ring 12,15,20 mins. Together again?
Sol: LCM=60. → 1 hr → 8 AM.
Q36. Greatest 4-digit divisible by 15,20,25?
Sol: LCM=300. Largest=9900.