Purchase Solution

Equivalence Classes for Relation on N

Not what you're looking for?

Ask Custom Question

5b. Describe the equivalence classes for the following relations on N.

x~y iif x mod 2 = y mod 2 and x mod 4 = y mod 4

Purchase this Solution
Solution Summary

Equivalence classes for relation on N are investigated. The response received a rating of "5" from the student who posted the question.

Solution Preview

By the relations in the problem, we can get 4 equivalent classes on N.
C1={x in ...

Purchase this Solution
Free BrainMass Quizzes
Probability Quiz

Some questions on probability

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

View More Free Quizzes
Related BrainMass Solutions

  • Equivalence Classes

    12967 Equivalence Class Relations Let P, P' be equivalence relations on a set A. Let n, n' be the number of equivalence classes of p, p', respectively.

  • Relations : Properties and Equivalence Classes

    19770 Relations: Properties and Equivalence Classes Please see the attached file for the fully formatted problem. Exercise 5 (4p) R is the relation defined on Z ts follows: for all m,n E Z, m R n <=>4|(m-n) a.

  • Discrete Mathematics and Equivalence Classes

    440225 Listing the distinct equivalence classes Let X={1,2,3,4,5}, Y={1,2}. Define relation R on g(x) by ARB iff AY =BY *Note: g(x) is the power set of x and R is a equivalence relation (no need to prove this)* a) C={2,3}.

  • Equivalence Relations and Classes

    85120 Defining Equivalence Relations and Classes Define a relation R on N × N by (a, b)R(c, d) if and only if a + b = c + d. (i) Prove that R is an equivalence relation on N × N. (ii) Let S denote the set of equivalence classes of R.

  • Equivalence Classes of an Equivalence Relation

    Conversely, given a decomposition of A as a union of mutually disjoint, nonempty subsets, we can define an equivalence relation on A for which these subsets are the distinct equivalence classes.

  • Equivalence Relations and Classes

    94088 Equivalence Relations and Classes For m, n, in N define m~n if m^2 ? n^2 is a multiple of 3. (a.) Show that ~ is an equivalence relation on N. (b.) List four elements in the equivalence class [0].

  • Modular Arithmetic and Equivalence Relations

    A partition of a set S defines on equivalence relation on S. Hint: Define a relation as X - Y if X and Y are elements of the same subset of the partition. 10.) Let n be fixed positive integer greater than 1.

  • Subgroup proof

    I need a detailed and rigorous proof to study for a test please. please see the attached file Let us define as suggested a binary relation on . This is an equivalence relation: it is clearly reflexive, symmetric and transitive.

  • Equivalence Relation vs. Equivalence Class

    From (A)(B)(C), we have shown that the relation ~ is reflexive, symmetric and transitive. So, it is an equivalence relation on Z. Question 2: For the equivalence relation (1), what are the equivalence classes?

View More Related Solutions