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

Let the relation $R_{1}$ be defined on $R$ as $a R_{1} b$ if $1+ab > 0$. Then

Let $N$ be the set of natural numbers and the relation $R$ on $N \times N$ is defined by $(a, b) R (c, d)$ if $ad(b + c) = bc(a + d)$. Then $R$ is:

Difficult
View Solution

Given the relation $R = \{(1, 2), (2, 3)\}$ on the set $A = \{1, 2, 3\}$,the minimum number of ordered pairs which when added to $R$ make it an equivalence relation is

Let $A = \{1, 2, 3, 4\}$ and $R = \{(1, 2), (2, 3), (1, 4)\}$ be a relation on $A$. Let $S$ be the smallest equivalence relation on $A$ such that $R \subset S$. If the number of elements in $S$ is $n$,then the value of $n$ is:

Let $R$ be a transitive relation on a set $A$ and $I$ be the identity relation on $A$. Then:

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