A relation is any subset of A × B: no rule is needed. This part covers the Cartesian product, roster, set-builder and arrow-diagram forms, domain, range and codomain, counting relations, and the empty, universal, inverse and identity relations.
Video coming soonA × B is the set of all ordered pairs (a, b) with a ∈ A and b ∈ B. If n(A) = p and n(B) = q, then . Order matters: (1, a) is not (a, 1).


A = {1, 4, 5, 6}, B = {1, 2, 7}, x R y when x < y. Roster form: {(1, 2), (1, 7), (4, 7), (5, 7), (6, 7)}. Set-builder form: {(x, y) : x ∈ A, y ∈ B, x < y}. Each pair is one arrow. Each of the pq pairs is in or out, so there are relations from A to B.
The whole-number points on the circle are (0, 5), (3, 4), (4, 3) and (5, 0), so the domain and the range are both {0, 3, 4, 5}. W includes 0: don't drop (0, 5) and (5, 0).


On A = {1, 2, 3, 4, 6}: every number with 1 and itself (9 pairs), plus (4, 2), (6, 2), (6, 3). Twelve pairs; domain and range are all of A.
1. R = {(x, y) : x, y ∈ W, x² + y² = 25}. Find the domain and range.
Domain {0, 3, 4, 5}; range {0, 3, 4, 5}.
2. R₁ = {(x, y) : y = 2x + 7, −5 ≤ x ≤ 5}. Find the domain and range.
Domain [−5, 5]; range [−3, 17].
3. A = {2, 3, 4, 5, 6, 7}, x R y iff gcd(x, y) = 1. Find n(R).
22.
4. On {1, …, 50}, R₁ = {(p, pⁿ) : p prime, n ≥ 0}, R₂ = the same with n = 0 or 1. Find n(R₁ − R₂).
8: (2, 4), (2, 8), (2, 16), (2, 32), (3, 9), (3, 27), (5, 25), (7, 49).
n(A) = 3 and n(B) = 2. The number of relations from A to B is:
n(A × B) = 3 × 2 = 6, so the answer is 2⁶ = 64: option (d).
6 is the number of pairs, not the number of relations.
8 = 2³ uses only n(A), and 32 = 2⁵ adds 3 + 2 instead of multiplying.
12 and 2¹² = 4096.
{(1, 4), (1, 6), (2, 9), (3, 4), (3, 6), (5, 4), (5, 6)}.
R = {(2, 8), (3, 27), (5, 125), (7, 343)}; range {8, 27, 125, 343}.
R⁻¹ = {(2, 1), (4, 2), (6, 3)}; domain {2, 4, 6}, range {1, 2, 3}.