Get 2 FREE Instant-Explanations on Filo with code FILOAPP

Let R be a reflexive relation in a finite set having n element

Question

Let $R$ be a reflexive relation in a finite set having $n$ elements and let there be $m$ ordered pairs in $R$ . Then,

m \geq n

m \leq n

m = n

None of these

Views: 544 students

Found 6 tutors discussing this question

Luna Discussed

Let

R

be a reflexive relation in a finite set having

n

elements and let there be

m

ordered pairs in

R

. Then,

7 mins ago

Discuss this question LIVE

7 mins ago

Text solutionVerified

(n v a l u es p oss ib l e) ↓ a R a

n e l e m e n t s ↓ a \in A

Given m ordered pairs. [We know n values possible that is at least n values cut of m]

∴ m \geq n

Was this solution helpful?

150

Report

One destination to cover all your homework and assignment needs

Learn Practice Revision Succeed

Instant 1:1 help, 24x7

60, 000+ Expert tutors

Textbook solutions

Big idea maths, McGraw-Hill Education etc

Essay review

Get expert feedback on your essay

Schedule classes

High dosage tutoring from Dedicated 3 experts

Trusted by 4 million+ students

Stuck on the question or explanation?

Connect with our maths tutors online and get step by step solution of this question.

231 students are taking LIVE classes

Question Text	Let $R$ be a reflexive relation in a finite set having $n$ elements and let there be $m$ ordered pairs in $R$ . Then,
Answer Type	Text solution:1
Upvotes	150