Q6I need correct and perfect soloution plz take ur time and solve perfectly plz and show neat and clean handwriting plz QUESTION 6.Let A = {-42, -7, -6, -2, 1, 10, 11, 29} be a set.Define a binary relation R on A as follows:For all x, y € A, xRy if and only if x = y (mod 9).Given that R is an equivalence relation on A, which one of the following sets P is a partitionof A into equivalence classes of R?A. P = {{-42}, {-6}, {-7, 11}, {29,-2}, {1}, {10}}B. P ={{-42, -7, -6, -2, 1, 10, 11, 29}}C. P ={{-42, -7,-6}, {-2, 1}, {10, 11,29}}D. P ={{-42,-6}, {-7, 11,29}, {-2}, {1, 10}}E. P ={{-42, -6, -7}, {11, 29}, {-2}, {1, 10}}F. P ={{-42,-6}, {11, 29}, {-7, -2}, {1,10}}

Answered: Image /qna-images/answer/e7d828a8-405c-45f5-bef3-8a89fb18e895.jpg

Let A = {-42, -7, -6, -2, 1, 10, 11, 29} be a set. Define a binary relation R on A as follows: For all x, y € A, TRy if and only if x = y (mod 9). Given that R is an equivalence relation on A, which one of the following sets P is a partition of A into equivalence classes of R? A. P ={{-42}, {-6}, {-7, 11}, {29,-2}, {1}, {10}} B. P ={{-42, -7, -6, -2, 1, 10, 11, 29}} C. P ={{-42, -7,-6}, {-2, 1}, {10, 11,29}} D. P ={{-42,-6}, {-7, 11,29}, {-2}, {1, 10}} E. P ={{-42, -6, -7}, {11,29}, {-2}, {1, 10}} F. P = {{-42,-6}, {11, 29}, {−7, −2}, {1,10}}

Let A = {-42, -7, -6, -2, 1, 10, 11, 29} be a set. Define a binary relation R on A as follows: For all x, y € A, TRy if and only if x = y (mod 9). Given that R is an equivalence relation on A, which one of the following sets P is a partition of A into equivalence classes of R? A. P ={{-42}, {-6}, {-7, 11}, {29,-2}, {1}, {10}} B. P ={{-42, -7, -6, -2, 1, 10, 11, 29}} C. P ={{-42, -7,-6}, {-2, 1}, {10, 11,29}} D. P ={{-42,-6}, {-7, 11,29}, {-2}, {1, 10}} E. P ={{-42, -6, -7}, {11,29}, {-2}, {1, 10}} F. P = {{-42,-6}, {11, 29}, {−7, −2}, {1,10}}

Elements Of Modern Algebra

8th Edition

ISBN:9781285463230

Author:Gilbert, Linda, Jimmie

Publisher:Gilbert, Linda, Jimmie

Chapter1: Fundamentals

Section1.7: Relations

Problem 27E: Prove Theorem 1.40: If is an equivalence relation on the nonempty set , then the distinct...

See similar textbooks

Similar questions

Give an example of a relation R on a nonempty set A that is symmetric and transitive, but not reflexive.
In Exercises 610, a relation R is defined on the set Z of all integers. In each case, prove that R is an equivalence relation. Find the distinct equivalence classes of R and list at least four members of each. xRy if and only if x+3y is a multiple of 4.
True or False Label each of the following statements as either true or false. Let be an equivalence relation on a nonempty setand let and be in. If, then.
Label each of the following statements as either true or false. If R is an equivalence relation on a nonempty set A, then any two equivalence classes of R contain the same number of element.
In Exercises , a relation is defined on the set of all integers. In each case, prove that is an equivalence relation. Find the distinct equivalence classes of and list at least four members of each. 10. if and only if .
a. Let R be the equivalence relation defined on Z in Example 2, and write out the elements of the equivalence class [ 3 ]. b. Let R be the equivalence relation congruence modulo 4 that is defined on Z in Example 4. For this R, list five members of equivalence class [ 7 ].