search
Log In
0 votes
267 views
in Computer Networks 267 views

1 Answer

0 votes
 
Best answer
Set of all equivalence classes of any equivalence relation forms a partitions.

selected by

Related questions

0 votes
2 answers
1
1 vote
0 answers
2
462 views
Solve. a) Show that satisfies the recurrence relation and the initial condition p(0) = 1. b) Find the number of different equivalence relations on a set with n elements, where n is a positive integer not exceeding 10
asked Nov 30, 2014 in Set Theory & Algebra Sahil Gupta 462 views
1 vote
1 answer
3
1.1k views
Which of these relations on the set of all functions from Z to Z are equivalence relations? (a) $\{(f,g) \mid f(1)=g(1)\}$ (b) $\{(f,g) \mid f(0)=g(0) \text{ or } f(1)=g(1)\}$ ... conditions (Symmetric, Transitive and Reflexive) of equivalence relation. Actually I cannot able to analyze when the relations defined on set of function. If anyone describe a bit it would helpful.
asked Apr 6, 2016 in Set Theory & Algebra SomnathKayal 1.1k views
...