The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
110 views

asked in Set Theory & Algebra by Loyal (4.3k points) | 110 views
answer is C?
Don't know the answer :( .. What is your approach?

Let no of elements in each equivalence class be 'n'.

Now, asper handshaking theorem, there will be nP2 elemnts in the relation R corresponding to single equivalence class. Similarly , nPfor the remaining 2 classes.

So, total elements = (nP2)3

Here, in the options, only option (C) is proper cube. So, I think (C) is the answer.

Did not get the Handshaing Theorem in this context .. can u plz provide any link or resources on this part?

Handshaking means ordered pairs.

Sorry, it wont be nP2. It would be n2

e.g if the equivalence class is {1,2,3} then the ordered pairs will be n2 = 32 = 9

i.e R will contain ordered pairs

1,1

2,2

3,3

1,2

2,1

2,3

3,2

1,3

3,1

Right?

That's okay but did not get " total elements = (nP2)3 "

It should be (n2)3

why (n2)3 ?

did not understand the cube part..

There are 3 equivalence classes of same size. Thts why. Read the question carefully.

at least 3 equivalence class not exactly 3 is mentioned even if we consider 3 equivalence classes then total number of ordered pairs (according to your previous explanation) becomes 3*n^2 not (n2)3

Oops...I read the question wrong. But still consider

#total elements = k. n2        

Now, try to find the factors of any of the answers and check if we can get a perfect square. Since,

 k >= 3

we can take k=4 so that we get (D) as the answer.

 

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,101 questions
36,904 answers
91,826 comments
34,770 users