Let $A = \{1, 4, 7\}$ and $B = \{2, 3, 8\}$. Then the number of elements in the relation $R = \{((a_1, b_1), (a_2, b_2)) \in ((A \times B) \times (A \times B)) : a_1 + a_2 \text{ divides } b_2 + b_1\}$ is . . . . . . .

  • A
    $1$
  • B
    $2$
  • C
    $3$
  • D
    $8$

Explore More

Similar Questions

If $f : R \rightarrow R$ is defined by $f(x) = \begin{cases} x + 4, & x < -4 \\ 3x + 2, & -4 \leq x < 4 \\ x - 4, & x \geq 4 \end{cases}$ then the correct matching of List-$I$ from List-$II$ is :
List-$I$
$(A) f(-5) + f(-4)$
$(B) f(|f(-8)|)$
$(C) f(f(-7) + f(3))$
$(D) f(f(f(f(0)))) + 1$
List-$II$
$(i) 14$
$(ii) 4$
$(iii) -11$
$(iv) -1$
$(v) 1$
$(vi) 0$

$f(x) = \frac{x}{\ln x}$ and $g(x) = \frac{\ln x}{x}$. Identify the $CORRECT$ statement.

If $N$ denotes the set of all positive integers and if $f: N \rightarrow N$ is defined by $f(n) = \text{the sum of positive divisors of } n$, then $f(2^k \cdot 3)$, where $k$ is a positive integer, is

If $f(x) = \frac{2^x}{2^x + \sqrt{2}}$,$x \in R$,then $\sum_{k=1}^{81} f\left(\frac{k}{82}\right)$ is equal to :

Let $f:[0,1] \rightarrow \mathbb{R}$ be an injective continuous function that satisfies the condition $-1 < f(0) < f(1) < 1$. Then,the number of functions $g:[-1,1] \rightarrow [0,1]$ such that $(g \circ f)(x) = x$ for all $x \in [0,1]$ 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