Answer

Verified

411.3k+ views

**Hint:**In this question, we need to find the type of relation of ‘$\left| {} \right.$’ which denotes that $n\left| m \right.$ means n is a factor of m. To check if the relation is reflexive, we need to check if $n\left| n \right.$ i.e. if n is a factor of n. To check if the relation is symmetric, we need to check that $n\left| m \right.$ implies $m\left| n \right.$. To check if the relation is transitive, we need to check if $n\left| m \right.$ and $m\left| p \right.$ implies $n\left| p \right.$.

**Complete step-by-step solution**

Here, we are given the relation $\left| {} \right.$ according to which $n\left| m \right.$ means n is a factor of m. We need to find the type of relation $\left| {} \right.$.

For reflexive: We need to show that $n\left| m \right.$. Hence, we need to show that n is a factor of n. As we know, every number divides itself, therefore, every number is a factor of itself. Hence, $\left| {} \right.$ is a reflexive relation.

For symmetric: We need to show that if $n\left| m \right.$ then this implies $m\left| n \right.$. Hence, we need to show that, if n is a factor of m, then m is a factor of n.

As we know that, if n is a factor of m, then m is not always a factor of n. For example, if 2 is a factor of 4, then 4 is not a factor of 2.

Hence, relation $\left| {} \right.$ is not a symmetric relation.

For transitive: We need to show that, if $n\left| m \right.$ and $m\left| p \right.$ then $n\left| p \right.$. Hence, we need to show that, if n is a factor of m and m is a factor of p then n is a factor of p.

Since n is a factor of m, therefore $n\cdot k=m$ for some k as an integer. Also, since m is a factor of p, therefore $m\cdot l=p$ for some l as an integer.

From $ml=p,m=\dfrac{p}{l}$. Putting the value of m into $nk=m$ we get $nk=\dfrac{p}{l}\Rightarrow nkl=p$.

Since k and l are integers, so kl is also an integer.

Hence, n is a factor of p. Hence $n\left| p \right.$.

Therefore, relation $\left| {} \right.$ is transitive.

Hence, the relation is reflexive, transitive, and not symmetric.

**So, option D is the correct answer.**

**Note:**Students can get confused between reflexive and symmetric relations. Note that, if a relation is reflexive, symmetric, and transitive, then the relation is said to be an equivalence relation. In mathematical form, we define relation as follows:

(I) Reflexive: $\forall a\in A$ if aRa then relation R is a reflexive relation.

(II) Symmetric: $\forall a,b\in A$ if $aRb\Rightarrow bRa$ then relation R is a symmetric relation.

(III) Transitive: $\forall a,b,c\in A$ if aRb and bRc $\Rightarrow aRc$ then relation R is transitive relation.

Recently Updated Pages

When people say No pun intended what does that mea class 8 english CBSE

Name the states which share their boundary with Indias class 9 social science CBSE

Give an account of the Northern Plains of India class 9 social science CBSE

Change the following sentences into negative and interrogative class 10 english CBSE

Advantages and disadvantages of science

A Paragraph on Pollution in about 100-150 Words

Trending doubts

Which are the Top 10 Largest Countries of the World?

One cusec is equal to how many liters class 8 maths CBSE

Fill the blanks with the suitable prepositions 1 The class 9 english CBSE

Differentiate between homogeneous and heterogeneous class 12 chemistry CBSE

Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE

The Equation xxx + 2 is Satisfied when x is Equal to Class 10 Maths

Give 10 examples for herbs , shrubs , climbers , creepers

Write a letter to the principal requesting him to grant class 10 english CBSE

What organs are located on the left side of your body class 11 biology CBSE