1.Relation and Function
easy

Let $R$ be an equivalence relation on a finite set $A$ having $n$ elements. Then the number of ordered pairs in $R$ is

A

Less than $n$

B

Greater than or equal to $n$

C

Less than or equal to $n$

D

None of these

Solution

(b) Since $R$ is an equivalence relation on set $A,$

therefore $ (a, a) \in R $ for all $a \in A$. Hence, $R$ has at least $n$ ordered pairs.

Standard 12
Mathematics

Similar Questions

Start a Free Trial Now

Confusing about what to choose? Our team will schedule a demo shortly.