SOLUTION: Let S be the relation on N such that xSy means xy is not prime. Is S an equivalence relation? If yes, write down all numbers no greater than 10 from one of its equiavalence classes
Algebra.Com
Question 1033750: Let S be the relation on N such that xSy means xy is not prime. Is S an equivalence relation? If yes, write down all numbers no greater than 10 from one of its equiavalence classes.
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
S is not an equivalence relation because it fails to satisfy transitivity.
E.g. let x = 5, y = 10, z = 1. Then xSy and ySz (since 50 and 10 are not prime), but it is not true that xSz.
RELATED QUESTIONS
Let S be the relation on N such that xSy means xy is a perfect square. Show that S is an... (answered by robertb)
The following relations are on {prime numbers less than 10}. Let r be the relation xry... (answered by ikleyn)
Let P be the set of all triangles in a plane and R be the relation defined on P as aRb... (answered by ikleyn)
Can you help me solving this Q , I have problem with understand it
Let A be the set... (answered by mathmate)
Let n be a fixed positive integer in Z. Define the relation ≡n on Z by
x ≡n y if and (answered by math_tutor2020)
Let A = {0, 1, 2, 3, 4, 5} and ∼ be a relation on A defined by x ∼ y if
and only if... (answered by math_tutor2020)
1. Show that the set of real numbers is dense
2. Show that the set of odd positive... (answered by EdenWolf)
Let R be the relation on N defined by the rule that xRy means x + y is not divisible by... (answered by robertb)
Consider the set Z of all Integers and an integer m > 1. For all integers x and y... (answered by solver91311)