Let a set A = A1 $\cup$ A2 $\cup$ ..... $\cup$ Ak, where Ai $\cap$ Aj = $\phi$ for i $\ne$ j, 1 $\le$ j, j $\le$ k. Define the relation R from A to A by R = {(x, y) : y $\in$ Ai if and only if x $\in$ Ai, 1 $\le$ i $\le$ k}. Then, R is :
Let R1 = {(a, b) $\in$ N $\times$ N : |a $-$ b| $\le$ 13} and
R2 = {(a, b) $\in$ N $\times$ N : |a $-$ b| $\ne$ 13}. Then on N :
"ARB iff there exists a non-singular matrix P such that PAP$-$1 = B".
Then which of the following is true?
R1 = {(a, b) $ \in $ R2 : a2 + b2 $ \in $ Q} and
R2 = {(a, b) $ \in $ R2 : a2 + b2 $ \notin $ Q},
where Q is the set of all rational numbers. Then :
A = {m $ \in $ R : both the roots of
x2 – (m + 1)x + m + 4 = 0 are real}
and B = [–3, 5).
Which of the following is not true?
If A = {x $ \in $ Z : 2(x + 2) (x2 $-$ 5x + 6) = 1} and
B = {x $ \in $ Z : $-$ 3 < 2x $-$ 1 < 9},
then the number of subsets of the set A $ \times $ B, is
A = {($a$, b) $ \in $ R $ \times $ R : |$a$ - 5| < 1 and |b - 5| < 1};
B = {($a$, b) $ \in $ R $ \times $ R : 4($a$ - 6)2 + 9(b - 5)2 $ \le $ 36 };
Then
R1 = {(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)} and
R2 = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}.
Then :
and Q = {$\theta $ : sin$\theta $ + cos$\theta $ = $\sqrt 2 \,\sin \theta $} be two sets. Then
Statement I : $A=\{(x, y) \in R \times R: y-x$ is an integer $\}$ is an equivalence relation on $R$.
Statement II : $ B=\{(x, y) \in R \times R: x=\alpha y$ for some rational number $\alpha\}$ is an equivalence relation on $R$.
$R=\{(x, y) \mid x, y$ are real numbers and $x=w y$ for some rational number $w\}$;
$S=\left\{\left(\frac{m}{n}, \frac{p}{q}\right) \mid m, n, p\right.$ and $q$ are integers such that $n, q \neq 0$ and $q m=p m\}$. Then
$S = \left\{ {(x,y):y = x + 1\,\,and\,\,0 < x < 2} \right\}$
$T = \left\{ {(x,y): x - y\,\,\,is\,\,an\,\,{\mathop{\rm int}} eger\,} \right\}$,
Which one of the following is true ?
$R=\{(x, y) \in W \times W \mid$ the words $x$ and $y$ have at least one letter in common}. Then, $R$ is
Let S be the set of the first 11 natural numbers. Then the number of elements in $A=\{B \subseteq S: n(B) \geqslant 2$ and the product of all elements of $B$ is even $\}$ is $\_\_\_\_$ .
Explanation:
Let $S=\{1,2,\dots,11\}$. The product of all elements of $B$ is even iff $B$ contains at least one even number.
Evens in $S$: $5$ ($2,4,6,8,10$)
Odds in $S$: $6$
Number of subsets containing at least one even:
$ 2^{11}-2^{6}=2048-64=1984 $
(we subtract the subsets made only of odds).
Now enforce $n(B)\ge 2$: subtract the 5 singleton subsets $\{2\},\{4\},\{6\},\{8\},\{10\}$.
$ 1984-5=1979 $
$ \boxed{1979} $
The number of relations on the set $A=\{1,2,3\}$, containing at most 6 elements including $(1,2)$, which are reflexive and transitive but not symmetric, is __________.
Explanation:
Since relation needs to be reflexive the ordered pairs $(1,1),(2,2),(3,3)$ need to be there and $(1,2)$ is also to be included.
Let's call $R_0=\{(1,1),(2,2),(3,3),(1,2)\}$ the base relation.
$\because A \times A$ contain $3 \times 3=9$ ordered pairs, remaining 5 ordered are
$2,1),(1,3),(3,1),(2,3),(3,2)$
We have to add at most two ordered pairs to $R_0$ such that resulting relation is reflexive, transitive but not symmetric.
Following are the only possibilities.
$R=R_0 U\{(1,3)\}$
OR $R_0 U\{(3,2)\}$
OR $R_0 U\{(1,3),(3,1)\}$
OR $R_0 U\{(1,3),(3,2)\}$
OR $R_0 U\{(3,1),(3,2)\}$
For $n \geq 2$, let $S_n$ denote the set of all subsets of $\{1,2, \ldots, n\}$ with no two consecutive numbers. For example $\{1,3,5\} \in S_6$, but $\{1,2,4\} \notin S_6$. Then $n\left(S_5\right)$ is equal to ________
Explanation:
To find $ n(S_5) $, which is the number of subsets of $\{1, 2, 3, 4, 5\}$ with no consecutive numbers, we start by enumerating these subsets.
Let's denote the set $\{1, 2, 3, 4, 5\}$ as $A$. The subsets of $A$ that meet the criteria are:
The empty set: $\{\}$
Single-element sets: $\{1\}$, $\{2\}$, $\{3\}$, $\{4\}$, $\{5\}$
Two-element sets with no consecutive numbers: $\{1, 3\}$, $\{1, 4\}$, $\{1, 5\}$, $\{2, 4\}$, $\{2, 5\}$, $\{3, 5\}$
Three-element set with no consecutive numbers: $\{1, 3, 5\}$
Counting these subsets, we have:
1 subset with zero elements
5 subsets with one element
6 subsets with two elements
1 subset with three elements
Adding these counts, there are $1 + 5 + 6 + 1 = 13$ subsets in total.
Thus, $ n(S_5) = 13 $.
Let $S=\left\{p_1, p_2 \ldots, p_{10}\right\}$ be the set of first ten prime numbers. Let $A=S \cup P$, where $P$ is the set of all possible products of distinct elements of $S$. Then the number of all ordered pairs $(x, y), x \in S$, $y \in A$, such that $x$ divides $y$, is ________ .
Explanation:
$\begin{aligned} & \text { Let } \frac{\mathrm{y}}{\mathrm{x}}=\lambda \\ & \mathrm{y}=\lambda \mathrm{x} \\ & =10 \times\left({ }^9 \mathrm{C}_0+{ }^9 \mathrm{C}_1+{ }^9 \mathrm{C}_2+{ }^9 \mathrm{C}_3+\ldots .+{ }^9 \mathrm{C}_9\right) \\ & =10 \times\left(2^9\right) \\ & 10 \times 512 \\ & 5120 \end{aligned}$
Let $A=\{1,2,3\}$. The number of relations on $A$, containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is _________.
Explanation:
Transitivity
$(1,2) \in \mathrm{R},(2,3) \in \mathrm{R} \Rightarrow(1,3) \in \mathrm{R}$
For reflexive $(1,1),(2,2)(3,3) \in R$
Now $(2,1),(3,2),(3,1)$
$(3,1)$ cannot be taken
(1) $(2,1)$ taken and $(3,2)$ not taken
(2) $(3,2)$ taken and $(2,1)$ not taken
(3) Both not taken
therefore 3 relations are possible.
Let $A=\{2,3,6,7\}$ and $B=\{4,5,6,8\}$. Let $R$ be a relation defined on $A \times B$ by $(a_1, b_1) R(a_2, b_2)$ if and only if $a_1+a_2=b_1+b_2$. Then the number of elements in $R$ is __________.
Explanation:
To find the number of elements in the relation $R$ defined on $A \times B$, we need to determine all pairs $((a_1, b_1), (a_2, b_2))$ such that $a_1 + a_2 = b_1 + b_2$, where $a_1, a_2 \in A$ and $b_1, b_2 \in B$.
First, consider all possible sums of pairs from set $A$ and set $B$.
Possible sums from set $A = \{2, 3, 6, 7\}$:
- $2 + 2 = 4$
- $2 + 3 = 5$
- $2 + 6 = 8$
- $2 + 7 = 9$
- $3 + 2 = 5$
- $3 + 3 = 6$
- $3 + 6 = 9$
- $3 + 7 = 10$
- $6 + 2 = 8$
- $6 + 3 = 9$
- $6 + 6 = 12$
- $6 + 7 = 13$
- $7 + 2 = 9$
- $7 + 3 = 10$
- $7 + 6 = 13$
- $7 + 7 = 14$
Possible sums from set $B = \{4, 5, 6, 8\}$:
- $4 + 4 = 8$
- $4 + 5 = 9$
- $4 + 6 = 10$
- $4 + 8 = 12$
- $5 + 4 = 9$
- $5 + 5 = 10$
- $5 + 6 = 11$
- $5 + 8 = 13$
- $6 + 4 = 10$
- $6 + 5 = 11$
- $6 + 6 = 12$
- $6 + 8 = 14$
- $8 + 4 = 12$
- $8 + 5 = 13$
- $8 + 6 = 14$
- $8 + 8 = 16$
Now, identify the common sums from both sets:
Common sums: $8, 9, 10, 12, 13, 14$
For each common sum, count the pairs from set $A$ and set $B$ that produce these sums:
- Sum = 8: From $A$: {(2,6), (6,2)} - 2 pairs; From $B$: {(4,4)} - 1 pair; Hence, 2 * 1 = 2 pairs
- Sum = 9: From $A$: {(2,7), (3,6), (6,3), (7,2)} - 4 pairs; From $B$: {(4,5), (5,4)} - 2 pairs; Hence, 4 * 2 = 8 pairs
- Sum = 10: From $A$: {(3,7), (7,3)} - 2 pairs; From $B$: {(4,6), (5,5), (6,4)} - 3 pairs; Hence, 2 * 3 = 6 pairs
- Sum = 12: From $A$: {(6,6)} - 1 pair; From $B$: {(4,8), (6,6), (8,4)} - 3 pairs; Hence, 1 * 3 = 3 pairs
- Sum = 13: From $A$: {(6,7), (7,6)} - 2 pairs; From $B$: {(5,8), (8,5)} - 2 pairs; Hence, 2 * 2 = 4 pairs
- Sum = 14: From $A$: {(7,7)} - 1 pair; From $B$: {(6,8), (8,6)} - 2 pairs; Hence, 1 * 2 = 2 pairs
Adding all these, we get the number of elements in the relation $R$:
2 + 8 + 6 + 3 + 4 + 2 = 25
Thus, the number of elements in $R$ is 25.
In a survey of 220 students of a higher secondary school, it was found that at least 125 and at most 130 students studied Mathematics; at least 85 and at most 95 studied Physics; at least 75 and at most 90 studied Chemistry; 30 studied both Physics and Chemistry; 50 studied both Chemistry and Mathematics; 40 studied both Mathematics and Physics and 10 studied none of these subjects. Let $m$ and $n$ respectively be the least and the most number of students who studied all the three subjects. Then $\mathrm{m}+\mathrm{n}$ is equal to ___________.
Explanation:
$\begin{aligned} & 125 \leq \mathrm{m}+90-\mathrm{x} \leq 130 \\\\ & 85 \leq \mathrm{P}+70-\mathrm{x} \leq 95 \\\\ & 75 \leq \mathrm{C}+80-\mathrm{x} \leq 90 \\\\ & \mathrm{~m}+\mathrm{P}+\mathrm{C}+120-2 \mathrm{x}=210 \\\\ & \Rightarrow 15 \leq \mathrm{x} \leq 45 \& 30-\mathrm{x} \geq 0 \\\\ & \Rightarrow 15 \leq \mathrm{x} \leq 30 \\\\ & 30+15=45\end{aligned}$
$R_1=\{(a, b): b$ is divisible by $a\}$
$R_2=\{(a, b): a$ is an integral multiple of $b\}$.
Then, number of elements in $R_1-R_2$ is equal to _____________.
Explanation:
To determine the number of elements in $R_1 - R_2$, let's first articulate the meaning of both relations on set $A = \{1, 2, 3, \ldots, 20\}$:
$R_1$ includes pairs $(a, b)$ where $b$ is divisible by $a$. This includes pairs like $(1,1), (1,2), \ldots, (1,20)$ for $1$; similar series for $2$ up to $(2,20)$ (excluding odd numbers); for $3$ up to $(3,18)$; and so on, reflecting the divisibility condition.
$\begin{aligned} & R_1:\left\{\begin{array}{l}(1,1),(1,2) \ldots,(1,20), \\ (2,2),(2,4) \ldots,(2,20), \\ (3,3),(3,6) \ldots,(3,18), \\ (4,4),(4,8) \ldots,(4,20), \\ (5,5)(5,10) \ldots,(5,20), \\ (6,6),(6,12),(6,18),(7,7),(7,14), \\ (8,8),(8,16),(9,9),(9,18)(10,10), \\ (10,20),(11,11),(12,12) \ldots,(20,20)\end{array}\right\} \\\\ & n\left(R_1\right)=66\end{aligned}$
$R_2$ consists of pairs $(a, b)$ where $a$ is an integral multiple of $b$. Essentially, this relationship is the reverse of $R_1$. However, for the essence of $R_1 - R_2$, the key overlap comes with pairs where $a = b$, since those are the pairs that clearly reflect both conditions identically (i.e., a number is always divisible by itself, and it is always a multiple of itself). There are 20 such pairs corresponding to each integer in $A$ from 1 to 20, resulting in the common elements between $R_1$ and $R_2$ (the intersection $R_1 \cap R_2$) being 20 pairs.
$\begin{aligned} & \mathrm{R}_1 \cap \mathrm{R}_2=\{(1,1),(2,2), \ldots(20,20)\} \\\\ & \mathrm{n}\left(\mathrm{R}_1 \cap \mathrm{R}_2\right)=20 \end{aligned}$
The difference $R_1 - R_2$ seeks elements present in $R_1$ but not in $R_2$. Given that $R_1$ and $R_2$ share 20 elements that are identical, to find $R_1 - R_2$, we subtract these 20 common elements from the total in $R_1$, resulting in $66 - 20 = 46$ pairs.
$\begin{aligned} & \mathrm{n}\left(\mathrm{R}_1-\mathrm{R}_2\right)=\mathrm{n}\left(\mathrm{R}_1\right)-\mathrm{n}\left(\mathrm{R}_1 \cap \mathrm{R}_2\right) \\\\ & =\mathrm{n}\left(\mathrm{R}_1\right)-20 \\\\ & =66-20 \\\\ & \mathrm{R}_1-\mathrm{R}_2=46 \text { Pair }\end{aligned}$
Let $A=\{1,2,3, \ldots \ldots \ldots \ldots, 100\}$. Let $R$ be a relation on $\mathrm{A}$ defined by $(x, y) \in R$ if and only if $2 x=3 y$. Let $R_1$ be a symmetric relation on $A$ such that $R \subset R_1$ and the number of elements in $R_1$ is $\mathrm{n}$. Then, the minimum value of $\mathrm{n}$ is _________.
Explanation:
$\begin{aligned} & \mathrm{R}=\{(3,2),(6,4),(9,6),(12,8), \ldots \ldots \ldots .(99,66)\} \\ & \mathrm{n}(\mathrm{R})=33 \\ & \therefore 66 \end{aligned}$
Let $A=\{1,2,3,4\}$ and $R=\{(1,2),(2,3),(1,4)\}$ be a relation on $\mathrm{A}$. Let $\mathrm{S}$ be the equivalence relation on $\mathrm{A}$ such that $R \subset S$ and the number of elements in $\mathrm{S}$ is $\mathrm{n}$. Then, the minimum value of $n$ is __________.
Explanation:
$S$ is equivalence for $R < S$ and reflexive
$ \{(1,1),(2,2),(3,3),(4,4)\} $
for symmetric
$ \{(2,1),(4,1),(3,2)\} $
for transitive
$ \{(1,3),(3,1),(4,2),(2,4)\} $
Now set $S=\{(1,1),(2,2),(3,3),(4,4),(1,2)$, $(2, 3),(1,4),(4,3),(3,4),(2,1),(4,1),(3,2),(1,3),(3$, 1), $(4,2),(2,4)\}$
$ n(S)=16 $
The number of symmetric relations defined on the set $\{1,2,3,4\}$ which are not reflexive is _________.
Explanation:
To find the number of symmetric relations on the set $\{1,2,3,4\}$ that are not reflexive, we first calculate the total number of symmetric relations and then subtract the count of those that are both symmetric and reflexive.
A symmetric relation involves pairs where if a pair (x, y) is in the relation, then (y, x) is also in the relation. For a set with $n$ elements, there are $\frac{n(n+1)}{2}$ slots in the relation matrix that can independently be occupied or not, corresponding to a total of $2^{\frac{n(n+1)}{2}}$ possible symmetric relations.
A relation is reflexive if every element is related to itself, requiring all diagonal slots of the relation matrix (n of them) to be filled. The remaining $\frac{n(n-1)}{2}$ slots can be filled in any manner, leading to $2^{\frac{n(n-1)}{2}}$ reflexive (and possibly symmetric) relations.
For the set $\{1,2,3,4\}$ ($n=4$):
- Total symmetric relations: $2^{\frac{4(4+1)}{2}} = 2^{10} = 1024$
- Symmetric and reflexive relations: $2^{\frac{4(4-1)}{2}} = 2^{6} = 64$
Therefore, the number of symmetric relations that are not reflexive: $1024 - 64 = 960$.
$\left\{n \in \mathbb{N}: 10 \leq n \leq 100\right.$ and $3^{n}-3$ is a multiple of 7$\}$ is ___________.
Explanation:
Recall that for any integers $a$ and $b$, $a$ is a multiple of $b$ if there exists an integer $k$ such that $a = bk$. So in our case, we need to find how many $n$ satisfy the equation $3^n - 3 = 7k$ for some integer $k$.
Notice that $3^n - 3 = 3(3^{n-1} - 1)$. We want this expression to be a multiple of 7. Let's explore a few powers of 3 modulo 7:
$3^1 \equiv 3 \pmod{7}$
$3^2 \equiv 9 \equiv 2 \pmod{7}$
$3^3 \equiv 27 \equiv 6 \pmod{7}$
$3^4 \equiv 81 \equiv 4 \pmod{7}$
$3^5 \equiv 243 \equiv 5 \pmod{7}$
$3^6 \equiv 729 \equiv 1 \pmod{7}$
We observe that $3^n \pmod{7}$ follows a cycle of length 6. So, $3^{n-1} \pmod{7}$ also follows the same cycle, but shifted:
$3^0 \equiv 1 \pmod{7}$
$3^1 \equiv 3 \pmod{7}$
$3^2 \equiv 2 \pmod{7}$
$3^3 \equiv 6 \pmod{7}$
$3^4 \equiv 4 \pmod{7}$
$3^5 \equiv 5 \pmod{7}$
We want $3(3^{n-1} - 1) \equiv 0 \pmod{7}$, which means that $3^{n-1} - 1 \equiv 0 \pmod{7}$. From the cycle above, we see that this is true when $n-1$ is a multiple of 6, or equivalently, when $n$ is one more than a multiple of 6.
Now let's find the multiples of 6 between 10 and 100:
$12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90, 96$
Adding 1 to each of these values, we get the set of natural numbers $n$ that satisfy the given condition:
$13, 19, 25, 31, 37, 43, 49, 55, 61, 67, 73, 79, 85, 91, 97$
There are 15 elements in this set. Therefore, the number of elements in the given set is $\boxed{15}$.
$R=\{((a, b),(c, d)): 2 a+3 b=4 c+5 d\}$. Then the number of elements in $\mathrm{R}$ is ____________.
Explanation:
Given A = {1, 2, 3, 4}, the maximum value of $2a + 3b$ is 20, when (a, b) = (4, 4), and the minimum value of $4c + 5d$ is 9, when (c, d) = (1, 1). Therefore, the possible values for $2a + 3b = 4c + 5d$ are 9, 13, 14, 17, 18, and 19.
Now, let's find the combinations of (a, b), (c, d) that satisfy the given equation:
1. $2a + 3b = 9 \Rightarrow (a, b) = (3, 1) \Rightarrow (c, d) = (1, 1)$
2. $2a + 3b = 13 \Rightarrow (a, b) = (2, 3) \Rightarrow (c, d) = (2, 1)$
3. $2a + 3b = 14 \Rightarrow (a, b) = (4, 2) \Rightarrow (c, d) = (1, 2)$
4. $2a + 3b = 14 \Rightarrow (a, b) = (1, 4) \Rightarrow (c, d) = (1, 2)$
5. $2a + 3b = 17 \Rightarrow (a, b) = (4, 3) \Rightarrow (c, d) = (3, 1)$
6. $2a + 3b = 18 \Rightarrow (a, b) = (3, 4) \Rightarrow (c, d) = (2, 2)$
There are a total of 6 elements in the relation R for the given equation with the specified values of a, b, c, and d.
Let $\mathrm{A}=\{-4,-3,-2,0,1,3,4\}$ and $\mathrm{R}=\left\{(a, b) \in \mathrm{A} \times \mathrm{A}: b=|a|\right.$ or $\left.b^{2}=a+1\right\}$ be a relation on $\mathrm{A}$. Then the minimum number of elements, that must be added to the relation $\mathrm{R}$ so that it becomes reflexive and symmetric, is __________
Explanation:
Relation to be reflexive $(a, a) \in R \forall a \in A$
$\Rightarrow (-4,-4),(-3,-3),(-2,-2)$ also should be added in $R$.
Relation to be symmetric if $(a, b) \in R$, then $(b, a) \in R \forall a, b \in A$
$\Rightarrow (4,-4),(3,-3),(1,0),(-2,3)$ also should be added in $R$
$\Rightarrow$ Minimum number of elements to be added to $R=3+4=7$
The number of relations, on the set $\{1,2,3\}$ containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is __________.
Explanation:
To find the number of such relations, let's first understand what it means for a relation to be reflexive, transitive, and not symmetric.
A relation $R$ on a set $S$ is reflexive if every element is related to itself. That is, $(a, a) \in R$ for all $a \in S$.
A relation is transitive if whenever $(a, b) \in R$ and $(b, c) \in R$, then it must also be the case that $(a, c) \in R$.
A relation is symmetric if whenever $(a, b) \in R$, then $(b, a) \in R$ also.
Since we are looking for relations that are reflexive and transitive but not symmetric, we will need to include certain elements and exclude others.
First, for the relation to be reflexive on the set $\{1,2,3\}$, it must contain $(1,1), (2,2),$ and $(3,3)$.
Given that the relation must contain $(1,2)$ and $(2,3)$ and be transitive, it must also contain $(1,3)$ because if $(1,2)$ and $(2,3)$ are included, then to maintain transitivity, $(1,3)$ must be included as well.
So far, the must-have elements of the desired relation are:
- For reflexivity: $(1,1), (2,2), (3,3)$
- Given in the problem: $(1,2), (2,3)$
- For transitivity (induced by given elements): $(1,3)$
"To maintain a relation that is reflexive, transitive, and not symmetric, we must carefully select additional pairs beyond the reflexive minimum $(1,1), (2,2), (3,3)$, and the given $(1,2), (2,3)$, which also necessitates $(1,3)$ due to transitivity. While including pairs such as $(2,1)$, $(3,1)$, or $(3,2)$ could potentially introduce symmetry, we can include some of these pairs as long as the resulting relation does not fulfill the condition for symmetry for all elements. This means we can include one or more of these pairs if doing so does not result in every pair being mirrored (i.e., for every $(a,b) \in R$, $(b,a) \in R$ is not required), thus keeping the relation not symmetric. The key is ensuring that the inclusion of any such pair does not lead to a situation where for every $(a,b)$ in the relation, the reverse $(b,a)$ also exists, which would make the relation symmetric, contradicting our requirement."
1. R1 = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)}
Here, none of (2,1), (3,2), (3,1) are in R1.
2. R2 = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3), (2,1)}
Here, only (2,1) is in R2, and neither (3,2) nor (3,1) are in R2.
3. R3 = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3), (3,2)}
Here, only (3,2) is in R3, and neither (2,1) nor (3,1) are in R3.

