Comprehensive Course on Sets and Functions

Comprehensive Course on Sets and Functions

1. Numbers and Basic Operations

Definition: Natural Numbers (ℕ)
The set of counting numbers starting from 0.
ℕ = {0, 1, 2, 3, 4, ...}
Definition: Integers (ℤ)
All positive, negative whole numbers, and zero.
ℤ = {..., -3, -2, -1, 0, 1, 2, 3, ...}

1.1 Arithmetic Operations

Definition: Basic Arithmetic Operations
  • Addition (+): Combining two or more numbers into a single number.
  • Subtraction (-): Finding the difference between two numbers.
  • Multiplication (×): Repeated addition of the same number.
  • Division (÷): Repeated subtraction or splitting into equal parts.
  • Modulo (mod): The remainder when one number is divided by another.
Example: Arithmetic Operations
1. 5 + 2 = 7
2. 9 - 4 = 5
3. 3 × 4 = 12 (adding 3 four times)
4. 18 ÷ 3 = 6 (dividing 18 into 3 equal parts)
5. 10 mod 3 = 1 (when 10 is divided by 3, the remainder is 1)

Try These Problems:

  1. Calculate 15 mod 4.
  2. What is the result of 7 × 6?
  3. Simplify (8 + 2) × 3 - 6.

Solutions:

  1. 15 mod 4 = 3 (since 15 = 3 × 4 + 3)
  2. 7 × 6 = 42
  3. (8 + 2) × 3 - 6 = 10 × 3 - 6 = 30 - 6 = 24

1.2 Factors and Multiples

Definition: Factors and Multiples
  • a is a factor of b if b mod a = 0.
  • b is a multiple of a.
Example: Factors and Multiples
1. 2 is a factor of 6 (since 6 mod 2 = 0)
2. 5 is a factor of 10 (since 10 mod 5 = 0)
3. 12 is a multiple of 3 (since 12 = 3 × 4)

1.3 Rational and Real Numbers

Definition: Rational Numbers (ℚ)
Numbers of the form $\frac{p}{q}$, where p, q ∈ ℤ and q ≠ 0.
Example: Rational Numbers
1. $\frac{2}{5}$ is rational
2. $\frac{10}{20} = \frac{1}{2}$ is rational (after reduction)
3. 0.75 = $\frac{3}{4}$ is rational
Definition: Irrational Numbers
Numbers that cannot be written as $\frac{p}{q}$ where p, q are integers.
Examples: $\sqrt{2}$, π, e
Definition: Real Numbers (ℝ)
The set of all rational and irrational numbers.

1.4 Greatest Common Divisor (GCD)

Definition: Greatest Common Divisor
The GCD of two non-zero integers p and q is the largest positive integer that divides both p and q without a remainder.
Example: Finding GCD
1. gcd(9, 12) = 3
2. gcd(15, 45) = 15
3. gcd(0, q) = q (for any non-zero integer q)
4. gcd(1, q) = 1 (for any integer q)
Theorem: Euclidean Algorithm
To find gcd(a, b):
1. If b = 0, then gcd(a, b) = |a|
2. Otherwise, gcd(a, b) = gcd(b, a mod b)

Try These Problems:

  1. Find gcd(18, 24)
  2. Find gcd(35, 42)
  3. Find gcd(17, 23)

Solutions:

  1. gcd(18, 24) = 6
  2. gcd(35, 42) = 7
  3. gcd(17, 23) = 1 (17 and 23 are coprime)

2. Sets

2.1 Definition and Notation

Definition: Set
A set is a collection of well-defined objects, called elements or members of the set.
Set Notation:
  • Roster Form: Listing all elements within curly braces.
    Example: A = {1, 2, 3, 4, 5}
  • Set Builder Form: Describing elements that satisfy certain conditions.
    Example: B = {x | x is an even natural number less than 10}
Example: Sets in Various Notations
1. The set of vowels in English: {a, e, i, o, u}
2. The set of even natural numbers less than 10: {0, 2, 4, 6, 8}
3. The set of perfect squares less than 30: {0, 1, 4, 9, 16, 25}

2.2 Cardinality