333 views
0 votes
0 votes
If R be an equivalence relation on the set, A={6,7,8,9,10} defined by,

R={(6,6),(7,7),(8,8),(9,9),(10,10),(6,7),(7,6),(8,9),(9,8),(9,10),(10,9),(8,10),(10,8)}, its partitions are

a) {{6},{7},{8,9},{10}}

b) {{6,7,8},{9,10}}

c) {{6},{7,8},{9,10}}

d) {{6,7},{8,9,10}}

1 Answer

Best answer
2 votes
2 votes
do the partitionn of any set like.......1.none of the subset having common {non empty disjoint }

2.on combine them actual set should be formed.

and partition of equivalence relation be like..........see how the set elements are relateed with each other

first partition= 6 is related to 6 and 7.........so {6,7}

similarly  2nd =7 is related to 7 and 6 so................. {7,6}
......3rd=..................................................................{8,9,10}

......4th=.................................................................{9,8,10}

........5th=..............................................................{10,9,8}

1st nd 2nd r equivalent

3rd 4th 5th are same..

so only option  d is corret
selected by

Related questions

0 votes
0 votes
0 answers
1
MonikaV asked May 19, 2019
234 views
Which of the following is not true about Turing machine?(a) It can accept any palindrome(b) It can accept any context free language(c) It can accept {a^m b^n c^mn:m,n>=0(...
0 votes
0 votes
0 answers
2
8676rau asked Feb 24, 2019
1,910 views
If inorder traversing a tree results in E A C K F H D B G, the preorder traversal wouldreturn(a) FAEKCDBHG(b) FAEKCDHGB(c) EAFKHDCBG(d) FEAKDCHBG
0 votes
0 votes
0 answers
3
rajks007 asked Feb 25, 2018
756 views
Anyone from this group have experience of attending JNU m-tech(cs) admission interview experience ?if you have any idea or any related link please sharethanks in advance
0 votes
0 votes
0 answers
4
Deepak Yadav asked Aug 23, 2017
347 views
What is the answer of this question with explanation?