Let R be an equivalance relation on a finite set A having n elements. Then, the number of ordered pairs in R is
A
less than n
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
greater than or equal to n
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
less than or equal to n
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
None of these
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is B greater than or equal to n Let A={a1,a2,a3,…,an} There are n elements in A. Since, the relation is reflexive, the number of ordered pairs must be greater than or equal to n, as ∀a∈A⇒(a,a)∈R