Let $A={-3,-2,-1,0,1,2,3}$ and $R$ be a relation on $A$ defined by $xRy$ iff $2x-y\in{0,1}$. Let $l$ be the number of elements in $R$. Let $m$ and $n$ be the minimum number of elements required to be added in $R$ to make it reflexive and symmetric relations, respectively. Then $l+m+n$ is equal to
Let $R=\{(1,2),(2,3),(3,3)\}$ be a relation on the set $\{1,2,3,4\}$. The minimum number of ordered pairs that must be added to $R$ so that it becomes an equivalence relation is:
Let $P(S)$ denote the power set of $S=\{1,2,3,\ldots,10\}$. Define the relations $R_{1}$ and $R_{2}$ on $P(S)$ as
$A\,R_{1}\,B \iff (A\cap B^{c})\cup(B\cap A^{c})=\varnothing$ and
$A\,R_{2}\,B \iff A\cup B^{c}=B\cup A^{c}$, for all $A,B\in P(S)$. Then:
Let X = ℝ × ℝ. Define a relation R on X by
(a₁,b₁) R (a₂,b₂) ⇔ b₁ = b₂.
Statement I: R is an equivalence relation.
Statement II: For some (a,b) ∈ X, the set S = { (x,y) ∈ X : (x,y) R (a,b) } represents a line parallel to y = x.
$ \text{Let } R_1 \text{ and } R_2 \text{ be two relations defined on } \mathbb{R} \text{ by } a R_1 b \Leftrightarrow ab \ge 0 \text{ and } aR_2b \Leftrightarrow a \ge b. \text{ Then,}$
For $\alpha \in \mathbb{N}$, consider a relation $R$ on $\mathbb{N}$ given by
$R={(x,y):3x+\alpha y \text{ is a multiple of } 7}$.
The relation $R$ is an equivalence relation if and only if:
Let $A={,x\in(0,\pi)-{\tfrac{\pi}{2}}: \log_{(2/\pi)}|\sin x|+\log_{(2/\pi)}|\cos x|=2,}$ and $B={,x\ge 0:\sqrt{x}(\sqrt{x}-4)-3|\sqrt{x}-2|+6=0,}$. Then $n(A\cup B)$ is equal to
Let $A$ and $B$ be two finite sets with $m$ and $n$ elements respectively.
The total number of subsets of the set $A$ is $56$ more than the total number of subsets of $B$.
Then the distance of the point $P(m,n)$ from the point $Q(-2,-3)$ is:
Let the number of elements in sets and be five and two respectively. Then the number of subsets of X B each having at least 3 and at most 6 elements is :
Let $R$ be a relation from the set ${1,2,3,\dots,60}$ to itself such that
R={(a,b):b=pq, where p,q≥3 are prime numbers}.R = \{(a,b) : b = pq, \;\; \text{where $p,q \geq 3$ are prime numbers} \}.R={(a,b):b=pq,where p,q≥3 are prime numbers}.
Then, the number of elements in $R$ is :
Let the relations $R_1$ and $R_2$ on the set $X={1,2,3,\ldots,20}$ be given by
$R_1={(x,y):,2x-3y=2}$ and $R_2={(x,y):,-5x+4y=0}$. If $M$ and $N$ are the minimum numbers of ordered pairs that must be added to $R_1$ and $R_2$, respectively, to make them symmetric, then $M+N$ equals:
Let Z be the set of all integers,$A = \{ (x,y) \in Z \times Z:{(x - 2)^2} + {y^2} \le 4\} $, $B = \{ (x,y) \in Z \times Z:{x^2} + {y^2} \le 4\} $, $C = \{ (x,y) \in Z \times Z:{(x - 2)^2} + {(y - 2)^2} \le 4\} $, If the total number of relation from A $\cap$ B to A $\cap$ C is 2p, then the value of p is :
Let $A = \{ 1,2,3,....,10\} $ and $$f:A \to A$$ be defined as $f(k) = \left\{ {\matrix{ {k + 1} & {if\,k\,is\,odd} \cr k & {if\,k\,is\,even} \cr } } \right. $ Then the number of possible functions $g:A \to A$ such that $gof = f$ is :
Let $A={1,2,3,4,5}$. Let $R$ be a relation on $A$ defined by $xRy$ iff $4x \le 5y$.
Let $m$ be the number of elements in $R$, and $n$ be the minimum number of elements from $A \times A$ that are required to be added to $R$ to make it symmetric. Then $m+n$ is equal to:
Let $\mathbb{N}$ denote the set of all natural numbers. Define two binary relations on $\mathbb{N}$ as
$R_1 = {(x,y) \in \mathbb{N} \times \mathbb{N} : 2x + y = 10}$ and
$R_2 = {(x,y) \in \mathbb{N} \times \mathbb{N} : x + 2y = 10}$. Then:
Let $A = \{2, 3, 4\}$ and $B = \{8, 9, 12\}$.
Then the number of elements in the relation
$R = \{ ((a_1, b_1), (a_2, b_2)) \in (A \times B, A \times B) : a_1 \text{ divides } b_2 \text{ and } a_2 \text{ divides } b_1 \}$ is:
Let $A={0,1,2,3,4,5}$. Let $R$ be a relation on $A$ defined by $(x,y)\in R$ iff $\max{x,y}\in{3,4}$. Then among the statements
$(S_1):$ The number of elements in $R$ is $18$,
$(S_2):$ The relation $R$ is symmetric but neither reflexive nor transitive,
choose the correct option:
Let A = {2, 3, 4, 5, ....., 30} and '$ \simeq $' be an equivalence relation on A $\times$ A, defined by (a, b) $ \simeq $ (c, d), if and only if ad = bc. Then the number of ordered pairs which satisfy this equivalence relation with ordered pair (4, 3) is equal to :
Let $A=\{1,3,4,6,9\}$ and $B=\{2,4,5,8,10\}$.
Let $R$ be a relation defined on $A\times B$ such that
$R=\{\,((a_1,b_1),(a_2,b_2)) : a_1 \le b_2 \text{ and } b_1 \le a_2 \,\}$.
Then the number of elements in the set $R$ is:
In a school, there are three types of games to be played. Some of the students play two types of games, but none play all the three games. Which Venn diagrams can justify the above statement?
Let $A={2,3,6,8,9,11}$ and $B={1,4,5,10,15}$.
Let $R$ be a relation on $A\times B$ defined by
(
?
,
?
)
?
(
?
,
?
)
⟺
3
?
?
−
7
?
?
is an even integer.
(a,b)R(c,d)⟺3ad−7bc is an even integer.
Then the relation $R$ is:
Let R1 and R2 be two relation defined asfollows : R1 = {(a, b) $ \in $ R2 : a2 + b2 $ \in $ Q} and R2 = {(a, b) $ \in $ R2 : a2 + b2 $ \notin $ Q}, where Q is theset of all rational numbers. Then :
Define a relation R over a class of n $\times$ n real matrices A and B as "ARB iff there exists a non-singular matrix P such that PAP$-$1 = B". Then which of the following is true?
Two newspapers $A$ and $B$ are published in a city. It is known that $25%$ of the city population reads $A$ and $20%$ reads $B$ while $8%$ reads both $A$ and $B$. Further, $30%$ of those who read $A$ but not $B$ look into advertisements and $40%$ of those who read $B$ but not $A$ also look into advertisements, while $50%$ of those who read both $A$ and $B$ look into advertisements. Then the percentage of the population who look into advertisements is:
Let a set $A = A_1 \cup A_2 \cup \cdots \cup A_k$, where $A_i \cap A_j = \phi$ for $i \ne j$, $1 \le i, j \le k$. Define the relation $R$ from $A$ to $A$ by $R = {(x,y) : y \in A_i \text{ if and only if } x \in A_i, ; 1 \le i \le k}$. Then, $R$ is :
Let $A = {1, 2, 3, \ldots, 100}$ and $R$ be a relation on $A$ such that
$R = {(a, b) : a = 2b + 1}$.
Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), \ldots, (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair.
Then the largest integer $k$, for which such a sequence exists, is equal to:
A survey shows that 63% of the people in a city read newspaper A whereas 76% read newspaper B. If x% of the people read both the newspapers, then a possible value of x can be:
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:
Let $\mathrm{A}=\{-3,-2,-1,0,1,2,3\}$. Let R be a relation on A defined by $x \mathrm{R} y$ if and only if $0 \leq x^2+2 y \leq 4$. 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 reflexive relation. Then $l+m$ is equal to
Let $A=\{1,2,3, \ldots, 10\}$ and $B=\left\{\frac{m}{n}: m, n \in A, m< n\right.$ and $\left.\operatorname{gcd}(m, n)=1\right\}$. Then $n(B)$ is equal to :
Let $\mathop \cup \limits_{i = 1}^{50} {X_i} = \mathop \cup \limits_{i = 1}^n {Y_i} = T$ where each Xi contains 10 elements and each Yi contains 5 elements. If each element of the set T is an element of exactly 20 of sets Xi’s and exactly 6 of sets Yi’s, then n is equal to :
Let $f(x)=x^{2},\ x\in\mathbb{R}$. For any $A\subseteq\mathbb{R}$, define $g(A)={,x\in\mathbb{R}:\ f(x)\in A,}$. If $S=[0,4]$, then which one of the following statements is not true?
Consider the relations $R_1$ and $R_2$ defined as
$a\,R_1\,b \iff a^2 + b^2 = 1$ for all $a,b\in\mathbb{R}$,
and
$(a,b)\,R_2\,(c,d) \iff a + d = b + c$ for all $(a,b),(c,d)\in\mathbb{N}\times\mathbb{N}$.
Then:
Let $\mathrm{R}$ be a relation on $\mathbb{N}\times\mathbb{N}$ defined by $(a,b)\,\mathrm{R}\,(c,d)$ if and only if $ad(b-c)=bc(a-d)$. Then $\mathrm{R}$ is:
A survey shows that 73% of the persons working in an office like coffee, whereas 65% like tea. If x denotes the percentage of them, who like both coffee and tea, then x cannot be :
Let $A={-2,-1,0,1,2,3}$. Let $R$ be a relation on $A$ defined by $xRy$ iff $y=\max{x,1}$. Let $l$ be the number of elements in $R$. Let $m$ and $n$ be the minimum number of elements required to be added in $R$ to make it reflexive and symmetric relations, respectively. Then $l+m+n$ is equal to
In a class of $140$ students numbered $1$ to $140$, all even–numbered students opted Mathematics, those whose number is divisible by $3$ opted Physics, and those whose number is divisible by $5$ opted Chemistry. The number of students who did not opt for any of the three courses is:
Let $A={1,6,11,16,\ldots}$ and $B={9,16,23,30,\ldots}$ be the sets consisting of the first $2025$ terms of two arithmetic progressions. Then $n(A\cup B)$ is