यदि \(A=\{1,2,3,4\}\), \(B=\{1,2,3,4\}\) और \(R=A\times B\) है, तो (R) से कम से कम कितने युग्म हटाने होंगे ताकि कोई भी युग्म ((a,a)) न बचे?
If \(A=\{1,2,3,4\}\), \(B=\{1,2,3,4\}\), and \(R=A\times B\), what is the minimum number of pairs to remove from (R) so that no pair ((a,a)) remains?
Explanation opens after your attempt
Correct Answer
C. (4)
Concept
The diagonal pairs are ((1,1),(2,2),(3,3),(4,4)), so (4) must be removed. The number of diagonal pairs is (|A|).
Why this answer is correct
The correct answer is C. (4). The diagonal pairs are ((1,1),(2,2),(3,3),(4,4)), so (4) must be removed. The number of diagonal pairs is (|A|).
Exam Tip
विकर्ण युग्म ((1,1),(2,2),(3,3),(4,4)) हैं, इसलिए (4) हटाने होंगे। विकर्ण की संख्या (|A|) होती है।
Login to save your score, XP, coins and progress.