Let $r$ be a relation on the set $N \times N$ defined by $(a, b)r(c, d) \Rightarrow a + d = b + c$. Then $r$ is:

  • A
    Reflexive only
  • B
    Symmetric only
  • C
    Transitive only
  • D
    An equivalence relation

Explore More

Similar Questions

Let $R$ be a relation from $N$ to $N$ defined by $R = \{(a, b) : a, b \in N \text{ and } a = b^2\}$. Is the following statement true?
$(a, a) \in R$,for all $a \in N$

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 . . . . . . .

The relation "is subset of" on the power set $P(A)$ of a set $A$ is

Let $A = \{2, 3, 5, 7, 9\}$. Let $R$ be the relation on $A$ defined by $xRy$ if and only if $2x \le 3y$. Let $l$ be the number of elements in $R$, and $m$ be the minimum number of elements required to be added in $R$ to make it a symmetric relation. Then $l + m$ is equal to:

How many reflexive relations are there on a set with $3$ elements?

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