Let $S$ be the set of all real numbers. $A$ relation $R$ has been defined on $S$ by $a R b \Leftrightarrow |a-b| \leq 1$. Then $R$ is:

  • A
    reflexive and transitive but not symmetric
  • B
    an equivalence relation
  • C
    symmetric and transitive but not reflexive
  • D
    reflexive and symmetric but not transitive

Explore More

Similar Questions

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

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

Let $R = \{(x, y) \in N \times N : \log_e(x + y) \leq 2\}$. Then the minimum number of elements, required to be added in $R$ to make it a transitive relation, is . . . . . . .

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

The minimum number of elements that must be added to the relation $R = \{(a, b), (b, c)\}$ on the set $\{a, b, c\}$ so that it becomes symmetric and transitive is:

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