Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is

1 min read

Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is

A

Reflexive and symmetric

B

Transitive and symmetric

C

Equivalence

D

Reflexive, transitive but not symmetric

Answer:

The correct option is D. Reflexive, transitive but not symmetric

Note

Copy

You may like these posts

The number of commutative binary operation that can be defined on a set of 2 elements is
The binary operation * defined on N by a * b = a + b + ab for all a, b ∈ N is
Let us define a relation R in R as aRb if a ≥ b. Then R is
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is
The identity element for the binary operation * defined on Q – {0} as a * b = ab/2 ∀ a, b ∈ Q – {0) is
Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is

Post a Comment