$A$ relation $R$ on the set of natural numbers is defined as $\{(a, b) : |a - b| = 3\}$. Then $R$ is:

  • A
    $\{(1, 4), (2, 5), (3, 6), \dots \}$
  • B
    $\{(4, 1), (5, 2), (6, 3), \dots \}$
  • C
    $\{(1, 4), (4, 1), (2, 5), (5, 2), (3, 6), (6, 3), \dots \}$
  • D
    None of these

Explore More

Similar Questions

On the power set $P(A)$ of a set $A$,the relation "is a subset of" $(\subseteq)$ is:

For a set $A = \{1, 2, 3\}$,a relation $R = \{(1, 2), (2, 3)\}$ is defined. What is the minimum number of ordered pairs that must be added to $R$ to make it an equivalence relation?

Show that the relation $R$ in the set $\{1, 2, 3\}$ given by $R = \{(1, 2), (2, 1)\}$ is symmetric but neither reflexive nor transitive.

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

Let $A = \{-3, -2, -1, 0, 1, 2, 3\}$. Let $R$ be a relation on $A$ defined by $x R y$ if and only if $0 \leq x^2 + 2y \leq 4$. Let $l$ be the number of elements in $R$ and $m$ be the minimum number of elements required to be added to $R$ to make it a reflexive relation. Then $l+m$ is equal to

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