Question

In: Advanced Math

Let S={1,2,3,6} and define the relation ~ on S2 by (m,n) ~ (k,l) for m+l=n+k Show...

Let S={1,2,3,6} and define the relation ~ on S2 by (m,n) ~ (k,l) for m+l=n+k

  1. Show that it is an equivalent relation
  2. Find the number of different equivalent classes and write all of them

Solutions

Expert Solution


Related Solutions

Let S = {2 k : k ∈ Z}. Let R be a relation defined on...
Let S = {2 k : k ∈ Z}. Let R be a relation defined on Q− {0} by x R y if x y ∈ S. Prove that R is an equivalence relation. Determine the equivalence class
Let S = {1,2,3,4} and let A = SxS Define a relation R on A by...
Let S = {1,2,3,4} and let A = SxS Define a relation R on A by (a,b)R(c,d) iff ad = bc Write out each equivalence class (by "write out" I mean tell me explicitly which elements of A are in each equivalence class) Hint: |A| = 16 and there are 11 equivalence classes, so there are several equivalence classes that consist of a single element of A.
Let L ⊆ Σ ∗ and define S(L), the suffix-language of L, as S(L) = {w...
Let L ⊆ Σ ∗ and define S(L), the suffix-language of L, as S(L) = {w ∈ Σ ∗ | x = yw for some x ∈ L, y ∈ Σ ∗ } Show that if L is regular, then S(L) is also regular.
Let M be defined as follows M = (K, Σ, s, ∆, F ) for K...
Let M be defined as follows M = (K, Σ, s, ∆, F ) for K = {q0, q1, q2, q3, }, s = q0, Σ = {a, b, c}, F = {q0, q2, q3} and ∆ = {(q0, abc, q0), (q0, a, q1), (q0, e, q3), (q1, bc, q1), (q1, b, q2), (q2, a, q2), (q2, b, q3), (q3, a, q3)}. 1. (1pts) Draw the diagram of M 2. (6pts ) DRAW a diagram of an automata M0 such...
Let K = { s+t * 2^(1/2), such that s, t are Rational}. Show that K...
Let K = { s+t * 2^(1/2), such that s, t are Rational}. Show that K is a Field
1)Let S be the set of all students at a college. Define a relation on the...
1)Let S be the set of all students at a college. Define a relation on the set S by the rule that two people are related if they live less than 2 miles apart. Is this relation an equivalence relation on S? Justify your answer. 2) Define another relation on the set S from problem 5 by defining two people as related if they have the same classification (freshman, sophomore, junior, senior or graduate student). Is this an equivalence relation...
1)Let S be the set of all students at a college. Define a relation on the...
1)Let S be the set of all students at a college. Define a relation on the set S by the rule that two people are related if they live less than 2 miles apart. Is this relation an equivalence relation on S? Justify your answer. 2) Define another relation on the set S from problem 5 by defining two people as related if they have the same classification (freshman, sophomore, junior, senior or graduate student). Is this an equivalence relation...
2. Let D be a relation on the natural numbers N defined by D = {(m,n)...
2. Let D be a relation on the natural numbers N defined by D = {(m,n) : m | n} (i.e., D(m,n) is true when n is divisible by m. For this problem, you’ll be proving that D is a partial order. This means that you’ll need to prove that it is reflexive, anti-symmetric, and transitive. (a) Prove that D is reflexive. (Yes, you already did this problem on one of the minihomework assignments. You don’t have to redo the...
Let X Geom(p). For positive integers n, k define P(X = n + k | X...
Let X Geom(p). For positive integers n, k define P(X = n + k | X > n) = P(X = n + k) / P(X > n) : Show that P(X = n + k | X > n) = P(X = k) and then briefly argue, in words, why this is true for geometric random variables.
Let INFINITE PDA = {<M>|M is a PDA and L(M) is an infinite language}. Show that...
Let INFINITE PDA = {<M>|M is a PDA and L(M) is an infinite language}. Show that INFINITE PDA is decidable.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT