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 #55

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

✅ Step-by-Step Solution

Final Answer: Option (A): \(m\ge n\)
  1. The \(n\) diagonal pairs are compulsory, so \(m\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\) be the relation on \(\mathbb{N}\) defined by \(nRm\iff…
Next Question →
A mapping \(f:\mathbb{N}\to\mathbb{N}\) is defined by…

More Practice Questions in Relations And Functions

Related Questions in Relations And Functions