Let A={1,2,3,…,20}. Let R1 and R2 two relation on A such that
R1={(a,b):b is divisible by a}R2={(a,b):a is an integral multiple of b}.
Then, number of elements in R1−R2 is equal to \_\_\_\_\_\_\_\_\_\_\_\_\_.
Answer: 46
Solutions · 1
Official solution
To determine the number of elements in R1−R2, let's first articulate the meaning of both relations on set A=1,2,3,…,20:
R1 includes pairs (a,b) where b is divisible by a. This includes pairs like (1,1),(1,2),…,(1,20) for 1; similar series for 2 up to (2,20) (excluding odd numbers); for 3 up to (3,18); and so on, reflecting the divisibility condition.
R1:(1,1),(1,2)…,(1,20),(2,2),(2,4)…,(2,20),(3,3),(3,6)…,(3,18),(4,4),(4,8)…,(4,20),(5,5)(5,10)…,(5,20),(6,6),(6,12),(6,18),(7,7),(7,14),(8,8),(8,16),(9,9),(9,18)(10,10),(10,20),(11,11),(12,12)…,(20,20)n(R1)=66R2 consists of pairs (a,b) where a is an integral multiple of b. Essentially, this relationship is the reverse of R1. However, for the essence of R1−R2, the key overlap comes with pairs where a=b, since those are the pairs that clearly reflect both conditions identically (i.e., a number is always divisible by itself, and it is always a multiple of itself). There are 20 such pairs corresponding to each integer in A from 1 to 20, resulting in the common elements between R1 and R2 (the intersection R1∩R2) being 20 pairs.
R1∩R2=(1,1),(2,2),…(20,20)n(R1∩R2)=20
The difference R1−R2 seeks elements present in R1 but not in R2. Given that R1 and R2 share 20 elements that are identical, to find R1−R2, we subtract these 20 common elements from the total in R1, resulting in 66−20=46 pairs.
n(R1−R2)=n(R1)−n(R1∩R2)=n(R1)−20=66−20R1−R2=46