Let S be the set of binary strings {010, 100, 110, 111,1110,01110,10111,11110,11111}. A relation R on S is defined as fol- lows: (a,b) ∈ R if and only if a ∈ S has the same number of 0’s as b ∈ S. Prove that R is an equivalence relation. Determine the partition of S that corresponds to R. (That is, determine all equivalence classes that form the partition)

Let S be the set of binary strings {010, 100, 110, 111,1110,01110,10111,11110,11111}. A relation R on S is defined as fol- lows: (a,b) ∈ R if and only if a ∈ S has the same number of 0’s as b ∈ S. Prove that R is an equivalence relation. Determine the partition of S that corresponds to R. (That is, determine all equivalence classes that form the partition)

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Sketch a digraph for a relation on the set {a, b, c, d} that is irreflexive and symmetricbut not transitive.
) 7. Let A = {1,2,3,4}×{1,2,3,4}. Define an equivalence relation - by (x1,x2) ~ (X3,x4) iff x1x2 = xx4. List the elements of the equivalence class [(2,2)].
Let X be the set {1, 2, 3, 4, 5} and Rthe "less than" relation on X, that is x Ryif and only if x
1. Define a relation on R by a - b iff a4 – 62 = b4 - a². Show that - is an equivalence relation. (b) Determine the equivalence class [-1]. (c) Prove or disprove: Every equivalence class in R/ ~ contains exactly 2 real numbers.
3. Let R be a relation defined on the set A = N × N where (a, b) R (c, d) if að = cd. Show R is an equivalence relation. Then, list the elements of the equivalence class [(9, 2)].
5) Let R be the relation on the integers where a Rb means a² = b². a) Is this an equivalence relation? Prove or disprove. b) Is this relation antisymmetric? Prove or disprove.
Let X be the set of nonempty sets of {-1, 0, 1} and define a relation R on X as follows: For all sets s and tin X, s R t⇒ the sum of the elements in s equals the sum of the elements in t. It is a fact that R is an equivalence relation on X. Use set-roster notation to list the distinct equivalence classes of R. (Enter your answer as a comma-separated list of sets. Enter EMPTY or Ø for the empty set.)
Let R be the relation on the set of all people who have visited a particular Web page such that x Ry if and only if person x and person y have followed the same set of links starting at this Web page (going from Web page to Web page until they stop using theWeb). Show that R is an equivalence relation.
Let S be a nonempty subset of Z and let R be a relation defined on S by xRy if 3 | (x + 2y). If S = {−7, −6, −2, 0, 1, 4, 5, 7}, then what are the distinct equivalence classes in this case? Please show how you find them
8. Let A be a set of nonzero integers and let R be a relation on A × A defined by (a, b)R(c, d) whenever ad = bc. Show that R is an equivalence relation. That is, R is reflexive, symmetric, and transitive.