Question

Let R be a relation on a set of integers, which is represented by: a R...

Let R be a relation on a set of integers, which is represented by:
a R b if and only if a = 2 ^ k.b, for some integer k.
Check if the relation R is an equivalent relation!

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

For a relation to be equivalence, it should be reflexive , symmetric and transitive.

A relation is said to be reflexive if aRa for all a in R.

That is, each integer in R should be related to itself. Like (1, 1) (2, 2).....

The given function is a = 2^k.b

Here we cannot have aRa possible. For example 1 2^k.b for any value of k and b.

Thus here since the given relation is not reflexive, it is not equivalent.

If you have any questions comment down. Please don't simply downvote and leave. If you are satisfied with answer, please? upvote thanks

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
2. Let R be a relation on the set of integers ℤ defined by ? =...
2. Let R be a relation on the set of integers ℤ defined by ? = {(?, ?): a2 + ?2 ?? ? ??????? ??????} Is this relation reflexive? Symmetric? transitive?
Let A be the set of all integers, and let R be the relation "m divides...
Let A be the set of all integers, and let R be the relation "m divides n." Determine whether or not the given relation R, on the set A, is reflexive, symmetric, antisymmetric, or transitive.
I have a discrete math question. let R be a relation on the set of all...
I have a discrete math question. let R be a relation on the set of all real numbers given by cry if and only if x-y = 2piK for some integer K. prove that R is an equivalence relation.
5. Prove or disprove the following statements: (a) Let R be a relation on the set...
5. Prove or disprove the following statements: (a) Let R be a relation on the set Z of integers such that xRy if and only if xy ≥ 1. Then, R is irreflexive. (b) Let R be a relation on the set Z of integers such that xRy if and only if x = y + 1 or x = y − 1. Then, R is irreflexive. (c) Let R and S be reflexive relations on a set A. Then,...
Let R be the relation on the integers given by (a, b) ∈ R ⇐⇒ a...
Let R be the relation on the integers given by (a, b) ∈ R ⇐⇒ a − b is even. 1. Show that R is an equivalence relation 2. List teh equivalence classes for the relation Can anyone help?
Let N* be the set of positive integers. The relation ∼ on N* is defined as...
Let N* be the set of positive integers. The relation ∼ on N* is defined as follows: m ∼ n ⇐⇒ ∃k ∈ N* mn = k2 (a) Prove that ∼ is an equivalence relation. (b) Find the equivalence classes of 2, 4, and 6.
a) Let R be an equivalence relation defined on some set A. Prove using induction that...
a) Let R be an equivalence relation defined on some set A. Prove using induction that R^n is also an equivalence relation. Note: In order to prove transitivity, you may use the fact that R is transitive if and only if R^n⊆R for ever positive integer ​n b) Prove or disprove that a partial order cannot have a cycle.
Disprove: The following relation R on set Q is either reflexive, symmetric, or transitive. Let t...
Disprove: The following relation R on set Q is either reflexive, symmetric, or transitive. Let t and z be elements of Q. then t R z if and only if t = (z+1) * n for some integer n.
Determine which property(s) the following relation R on the set of all integers satisfy(s)? ( a...
Determine which property(s) the following relation R on the set of all integers satisfy(s)? ( a , b ) ∈ R iff a b ≥ 1 .
Let Z be the set of integers. Define ~ to be a relation on Z by...
Let Z be the set of integers. Define ~ to be a relation on Z by x~y if and only if |xy|=1. Show that ~ is symmetric and transitive, but is neither reflexvie nor antisymmetric.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT