Let $R$ be a relation on the set of real numbers defined by $nm \ge 0$. Then $R$ is:

  • A
    Symmetric and transitive
  • B
    Reflexive and symmetric
  • C
    Partial order relation
  • D
    An equivalence relation

Explore More

Similar Questions

If $R$ is an equivalence relation on a set $A$,then $R^{-1}$ is

Let $A = \{2, 3, 4, 5, \ldots, 30\}$ and $\simeq$ be an equivalence relation on $A \times A$,defined by $(a, b) \simeq (c, d)$ if and only if $ad = bc$. Then the number of ordered pairs $(c, d)$ which satisfy this equivalence relation with the ordered pair $(4, 3)$ is equal to:

Let $R$ be an equivalence relation defined on a set containing $6$ elements. The minimum number of ordered pairs that $R$ should contain is

The maximum number of equivalence relations on the set $A = \{1, 2, 3, 4\}$ is $N$. Then -

Show that the relation $R$ in the set of real numbers $\mathbb{R}$ defined as $R = \{(a, b) : a \leq b\}$ is reflexive and transitive but not symmetric.

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo