Mathbee CBSE Mathbee · CBSE Class 12 Maths
Class 12 Relations And Functions · Mcq Single Correct1 Markstypes_of_relations

Class 12 Maths · Relations And Functions · Mcq Single Correct #9

Let \(A\) be a finite set with \(n\ge2\) elements. Which bound on the number of ordered pairs in \(R\) is guaranteed for every equivalence relation \(R\) on \(A\)?

✅ Step-by-Step Solution

Final Answer: Option (B): Greater than or equal to \(n\)
  1. Reflexivity requires all \(n\) diagonal pairs, so \(|R|\ge n\).

Master Chapter 1: Relations And Functions

Practise interactive questions, flashcards, visual mind maps, and timed board tests for Relations And Functions.
📘 Chapter Notes & All Exercises 🚀 Open Interactive Workspace →
← Previous Question
Let \(R=\{(1,3),(4,2),(2,4),(2,3),(3,1)\}\) be a relation on the set…
Next Question →
For which real values of \(p\) is the function…

More Practice Questions in Relations And Functions

Related Questions in Relations And Functions