Let and be a relation on the set defined by . Then the number of elements in is _____.
We are given and a relation on defined by:
where . We seek all ordered pairs satisfying .
For the left side the minimum is and the maximum is . For the right side the minimum is and the maximum is . Thus the common range where both sides can be equal is .
Listing all values of for each pair yields:
a=1: b=1 5, b=2 8, b=3 11, b=4 14
a=2: b=1 7, b=2 10, b=3 13, b=4 16
a=3: b=1 9, b=2 12, b=3 15, b=4 18
a=4: b=1 11, b=2 14, b=3 17, b=4 20.
Similarly, listing all values of for each pair and keeping only those in gives:
c=1: d=1 9, d=2 14, d=3 19, d=4 24 (out of range)
c=2: d=1 13, d=2 18, d=3 23 (out), d=4 28 (out)
c=3: d=1 17, d=2 27 (out)
c=4: d=1 21 (out), all others out
Valid RHS values are 9 from , 13 from , 14 from , 17 from , 18 from , 19 from .
Matching LHS and RHS values and counting pairs yields:
Value = 9: LHS pairs with : (1 pair); RHS pairs: (1 pair); number of elements: .
Value = 13: LHS pairs with : (1 pair); RHS pairs: (1 pair); number of elements: .
Value = 14: LHS pairs with : and (2 pairs); RHS pairs: (1 pair); number of elements: .
Value = 17: LHS pairs with : (1 pair); RHS pairs: (1 pair); number of elements: .
Value = 18: LHS pairs with : (1 pair); RHS pairs: (1 pair); number of elements: .
Value = 19: LHS pairs with : no pair gives 19; number of elements: 0.
Adding these counts gives 1 + 1 + 2 + 1 + 1 + 0 = 6.
The number of elements in is 6.
Tagged Cartesian products and counting relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.