We have two ordered pairs (x,y),(z,w)∈A×A where A={2,3,4,5,6}.
For the pair ((x,y),(z,w)) to belong to the relation R, the two conditions are:
• x divides z (x∣z)
• y≤w.
To count all such pairs it is convenient to treat the two coordinates independently.
1. Counting the choices for (x,z) with x∣z.
List all elements of A and the members of A they divide:
• x=2 divides {2,4,6}⇒3 choices for z
• x=3 divides {3,6}⇒2 choices for z
• x=4 divides {4}⇒1 choice for z
• x=5 divides {5}⇒1 choice for z
• x=6 divides {6}⇒1 choice for z
Hence the total number of ordered pairs (x,z) satisfying x∣z is
3+2+1+1+1=8.
Denote this by N1=8.
2. Counting the choices for (y,w) with y≤w.
Arrange A in ascending order: 2,3,4,5,6. For each possible y, count the eligible w:
• y=2: w can be 2,3,4,5,6(5 choices)
• y=3: w can be 3,4,5,6(4 choices)
• y=4: w can be 4,5,6(3 choices)
• y=5: w can be 5,6(2 choices)
• y=6: w can be 6(1 choice)
The total number of ordered pairs (y,w) satisfying y≤w is
5+4+3+2+1=15.
Denote this by N2=15.
3. Combining the two counts.
The conditions on (x,z) and (y,w) are independent, so the total number of ordered pairs ((x,y),(z,w))∈R is the product
N1×N2=8×15=120.
Therefore, the relation R contains 120 elements.