Question

9. Define R the binary relation on N x N to mean (a, b)R(c, d) iff b|d and alc (a) R is symmetric but not reflexive. (b) R is
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer

(c) R is reflexive and transitive but not symmetric

Explanation

Reflexive: For every element a in set, (a, a) must be in relation

Every element is divided by itself

Symmetric: If (a, b) is in relation, then should be (b, a)

Let's take an example (2, 3) R (6, 9) but not (6, 9) R (2, 3)

Transitive: If (a, b) and (b, c) is in the relation then should be (a, c)

--------------------------------------
Hit the thumbs up if you are fine with the answer. Happy Learning!

Add a comment
Know the answer?
Add Answer to:
9. Define R the binary relation on N x N to mean (a, b)R(c, d) iff...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Let R be the relation defined on Z (integers): a R b iff a + b...

    Let R be the relation defined on Z (integers): a R b iff a + b is even.  R is an equivalence relation since R is: Group of answer choices Reflexive, Symmetric and Transitive Symmetric and Reflexive or Transitive Reflexive or Transitive Symmetric and Transitive None of the above

  • Let R be the relation defined on Z (integers): a R b iff a + b...

    Let R be the relation defined on Z (integers): a R b iff a + b is even. Suppose that 'even' is replaced by 'odd' . Which of the properties reflexive, symmetric and transitive does R possess? Group of answer choices Reflexive, Symmetric and Transitive Symmetric Symmetric and Reflexive Symmetric and Transitive None of the above

  • . Define a relation ∼ on R 2 by stating that (a, b) ∼ (c, d)...

    . Define a relation ∼ on R 2 by stating that (a, b) ∼ (c, d) if and only if a 2 + b 2 ≤ c 2 + d 2 . Show that ∼ is reflexive and transitive but not symmetric.

  • QI. Let A-(-4-3-2-1,0,1,2,3,4]. R İs defined on A as follows: For all (m, n) E A,...

    QI. Let A-(-4-3-2-1,0,1,2,3,4]. R İs defined on A as follows: For all (m, n) E A, mRn㈠4](rn2_n2) Show that the relation R is an equivalence relation on the set A by drawing the graph of relation Find the distinct equivalence classes of R. Q2. Find examples of relations with the following properties a) Reflexive, but not symmetric and not transitive. b) Symmetric, but not reflexive and not transitive. c) Transitive, but not reflexive and not symmetric. d) Reflexive and symmetric,...

  • probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R =...

    probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R = R(,y) on S is a statement about pairs (x,y) of elements of S. For r,y ES, I is related to y notation: Ry) if R(x,y) is true. A relation Ris: Reflexive if for any I ES, R. Symmetric if for any ry ES, Ry implies y Rr. Transitive if for any r.y.ES, Ry and yRimply R. An equivalence relation is a reflexive, symmetric and...

  • (b) Let be the relation on N define by a ~ b iff there are m,n...

    (b) Let be the relation on N define by a ~ b iff there are m,n e Z+ with albm and bla". Show that is an equivalence relation. on hea infinitolo

  • Search ll 19:15 1.) (a) binomial relation on N x N Define as (a, b) (c, d)<a + d = b + c Is this binary relat...

    Search ll 19:15 1.) (a) binomial relation on N x N Define as (a, b) (c, d)<a + d = b + c Is this binary relation is equivalent relation? If there is an equivalence relation, write three elements of the equivalence class (5,2) to be represented (B)A binary relation on N x N is defined as follows. (a, b)(c, d) a+d<=b + c Will this binary relation be a partial order relation? If it is a partial order relationship,...

  • (17) (20pt) Let F be the set of functions f : R+ → R. Prove that the binary relation "f is 0(g)" on F is: (a) (4pt) Write down the definition for "f is O(g)". (b) (4pt) Prove that the...

    (17) (20pt) Let F be the set of functions f : R+ → R. Prove that the binary relation "f is 0(g)" on F is: (a) (4pt) Write down the definition for "f is O(g)". (b) (4pt) Prove that the relation is reflexive (c) (6pt) Prove that the relation is not symmetric. (d) (6pt) Prove that the relation is transitive. (17) (20pt) Let F be the set of functions f : R+ → R. Prove that the binary relation "f...

  • [Partial Orders - Six Easy Pieces] A binary relation is R is said to be antisymmetric...

    [Partial Orders - Six Easy Pieces] A binary relation is R is said to be antisymmetric if (x,y) ER & (y,x) ER = x=y. For example, the relations on the set of numbers is antisymmetric. Next, R is a partial order if it is reflexive, antisymmetric and transitive. Here are several problems about partial orders. (a) Let Ss{a,b} be a set of strings. Let w denote the length of the string w, i.e. the number of occurrences of letters (a...

  • 4. Let S = {1,2,3). Define a relation R on SxS by (a, b)R(c,d) iff a...

    4. Let S = {1,2,3). Define a relation R on SxS by (a, b)R(c,d) iff a <c and b <d, where is the usual less or equal to on the integers. a. Prove that R is a partial order. Is R a linear order? b. Draw the poset diagram of R.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT