Sets and Relations

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} $

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)\}$

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

$\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}$

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.

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.

$\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}$

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}$

$\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}$

$ \begin{aligned} & A=\{1,2,3,4\} \\\\ & R=\{(1,2),(2,3),(1,4)\} \end{aligned} $

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

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

To determine the number of elements in the given set, we need to find how many natural numbers $n$ between $10$ and $100$ (inclusive) satisfy the condition that $3^n - 3$ is a multiple of $7$.

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

$ 2a + 3b = 4c + 5d $

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.

$ \begin{aligned} A & =\{-4,-3,-2,0,1,3,4\} \\\\ R= & \{(-4,4),(-3,3),(0,0),(1,1) \\ & (3,3),(4,4),(0,1),(3,-2)\} \end{aligned} $

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$

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. R₁ = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)}

Here, none of (2,1), (3,2), (3,1) are in R₁.

2. R₂ = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3), (2,1)}

Here, only (2,1) is in R₂, and neither (3,2) nor (3,1) are in R₂.

3. R₃ = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3), (3,2)}

Here, only (3,2) is in R₃, and neither (2,1) nor (3,1) are in R₃.

Given, $\left|n^2-10 n+19\right|<6$

$\Rightarrow-6 < n^2-10 n+19 < 6$

Take, $-6 < n^2-10 n+19$ and $n^2-10 n+19 < 6$

$ \begin{array}{ll} \Rightarrow n^2-10 n+25 > 0 & \text { and }\quad n^2-10 n+13 < 0 \\\\ \Rightarrow(n-5)^2 > 0 & \text { and } n=\frac{10 \pm \sqrt{100-52}}{2}<0 \end{array} $

$\Rightarrow n \in \mathbb{Z}-\{5\}$

$ \begin{array}{lr} & \therefore n \in[5-2 \sqrt{3}, 5+2 \sqrt{3}] \\\\ & \therefore n \in[13,8.3] \\\\ & \therefore n=2,3,4,5,6,7,8 \end{array} $

Thus, number of element in the set is ' 6 '

We have, $A=\{0,3,4,6,7,8,9,10\}$

Case I : $x-y$ is odd, if one is odd and one is even and $x>y$.

$\therefore$ Possibilites are $\{(3,0),(4,3),(6,3),(7,6),(7,4)$, $(7,0),(8,7),(8,3),(9,8),(9,6),(9,4),(9,0),(10,9),(10$, $7),(10,3)\}$

No. of cases $=15$

Case II : $x-y=2$

$\therefore$ Possibilities are $\{(6,4),(8,6),(9,7),(10,8)\}$

$\therefore$ No. of cases $=4$

So, minimum ordered pair to be added $=15+4=19$

Given sets :

A={1,2,3,4, ............,10}

B={0,1,2,3,4}

We are looking for pairs $(a,b) \in A \times A$ such that :

$ 2(a-b)^2 + 3(a-b) \in B $

Let's break down the relation :

Case 1 : $ a-b = 0 $

$ 2(a-b)^2 + 3(a-b) = 0 $

Pairs : $(1,1), (2,2), (3,3), \ldots, (10,10)$ which gives 10 pairs.

Case 2 : $ a-b = 1 $

$ 2(a-b)^2 + 3(a-b) = 2(1) + 3(1) = 5 $

But 5 is not in B, so no pairs for this case.

Case 3 : $ a-b = -1 $

$ 2(a-b)^2 + 3(a-b) = 2(1) - 3(1) = -1 $

This value is not in B, so no pairs for this case.

Case 4 : $ a-b = 2 $

$ 2(a-b)^2 + 3(a-b) = 2(4) + 3(2) = 8+6 = 14 $

Again, 14 is not in B, so no pairs for this case.

Case 5 : $ a-b = -2 $

$ 2(a-b)^2 + 3(a-b) = 2(4) - 3(2) = 8 - 6 = 2 $

Pairs : $(1,3), (2,4), (3,5), (4,6), (5,7), (6,8), (7,9), (8,10)$ which gives 8 pairs.

For any other $ a-b $ value, the quadratic will grow larger than the maximum value in B, so we don't need to consider them.

In total, we have $ 10 + 8 = 18 $ pairs in the relation $ R $.

Therefore, the number of elements in the relation $ R $ is 18.

Elements of the type $3 \mathrm{k}=3$

Elements of the type $3 \mathrm{k}+1=1,7,9$

Elements of the type $3 \mathrm{k}+2=2,5,11$

Subsets containing one element $S_1=1$

Subsets containing two elements

$ S_2={ }^3 C_1 \times{ }^3 C_1=9 $

Subsets containing three elements

$ \mathrm{S}_3={ }^3 \mathrm{C}_1 \times{ }^3 \mathrm{C}_1+1+1=11 $

Subsets containing four elements

$

\mathrm{S}_4={ }^3 \mathrm{C}_3+{ }^3 \mathrm{C}_3+{ }^3 \mathrm{C}_2 \times{ }^3 \mathrm{C}_2=11 $

Subsets containing five elements

$ \mathrm{S}_5={ }^3 \mathrm{C}_2 \times{ }^3 \mathrm{C}_2 \times 1=9 $

Subsets containing six elements $\mathrm{S}_6=1$

Subsets containing seven elements $\mathrm{S}_7=1$

$ \Rightarrow \text { sum }=43 $

$R=\{(a, b)(b, c)(b, d)\}$

$S:\{a, b, c, d\}$

Adding $(a, a),(b, b),(c, c),(d, d)$ make reflexive.

Adding $(b, a),(c, b),(d, b)$ make Symmetric

And adding $(a, d),(a, c)$ to make transitive

Further $(d, a) \&(c, a)$ to be added to make Symmetricity.

Further $(c, d) \&(d, c)$ also be added.

So total 13 elements to be added to make equivalence.

Here $S = \{ 4,6,9\} $

And $T = \{ 9,10,11,\,\,......,\,\,1000\} $.

We have to find all numbers in the form of $4x + 6y + 9z$, where $x,y,z \in \{ 0,1,2,\,......\} $.

If a and b are coprime number then the least number from which all the number more than or equal to it can be express as $ax + by$ where $x,y \in \{ 0,1,2,\,......\} $ is $(a - 1)\,.\,(b - 1)$.

Then for $6y + 9z = 3(2y + 3z)$

All the number from $(2 - 1)\,.\,(3 - 1) = 2$ and above can be express as $2x + 3z$ (say t).

Now $4x + 6y + 9z = 4x + 3(t + 2)$

$ = 4x + 3t + 6$

again by same rule $4x + 3t$, all the number from $(4 - 1)\,(3 - 1) = 6$ and above can be express from $4x + 3t$.

Then $4x + 6y + 9z$ express all the numbers from 12 and above.

again 9 and 10 can be express in form $4x + 6y + 9z$.

Then set $A = \{ 9,10,12,13,\,....,\,1000\} .$

Then $T - A = \{ 11\} $

Only one element 11 is there.

Sum of elements of $T - A = 11$

As C $\cap$ B $\ne$ $\phi$, c must be not be formed by {1, 2, 4, 5}

$\therefore$ Number of subsets of A = 2⁷ = 128

and number of subsets formed by {1, 2, 4, 5} = 16

$\therefore$ Required no. of subsets = 2⁷ $-$ 2⁴ = 128 $-$ 16 = 112

$\because$ $(B \cup C)' = B'\, \cap C'$

B' is a set containing sub sets of A containing element 1 and not containing 2.

And C' is a set containing subsets of A whose sum of elements is not prime.

So, we need to calculate number of subsets of {3, 4, 5, 6, 7} whose sum of elements plus 1 is composite.

Number of such 5 elements subset = 1

Number of such 4 elements subset = 3 (except selecting 3 or 7)

Number of such 3 elements subset = 6 (except selecting {3, 4, 5}, {3, 6, 7}, {4, 5, 7} or {5, 6, 7})

Number of such 2 elements subset = 7 (except selecting {3, 7}, {4, 6}, {5, 7})

Number of such 1 elements subset = 3 (except selecting {4} or {6})

Number of such 0 elements subset = 1

$n(B'\, \cap C') = 21 \Rightarrow n(B \cup C) = {2^7} - 21 = 107$

Given, ${R}_1=\left\{\left(p, p^n\right): p\right.$ is a Prime and $n \geq 0$ is an integer $\}$

and, set $A=\{1,2,3 \ldots \ldots .50\}$

$p$ is a Prime number which can take 15 values $2,3,5,7,11,13,17,19,23,29,31,37,41,43$ and 47

$\therefore$ We can calculate no. of elements in $\mathrm{R}_1$

$ \mathrm{R}_1=\left(2,2^0\right),\left(2,2^1\right),\left(2,2^2\right)\left(2,2^3\right) \ldots \ldots\left(2,2^5\right)=6$ number of ordered pairs

$\left(3,3^0\right),\left(3,3^1\right),\left(3,3^2\right) \ldots \ldots . .\left(3,3^3\right)=4$ number of order paris

$\left(5,5^0\right),\left(5,5^1\right),\left(5,5^2\right) \ldots \ldots \ldots . .=3$ number of order paris

$\left(7,7^0\right) \ldots \ldots .\left(7,7^2\right) \ldots \ldots \ldots=3$ number of order paris

$\left(11,11^0\right)$ and $\left(11,11^1\right)=2$ number of order paris

$\left(13,13^0\right)$ and $\left(13,13^1\right)=2$ number of order paris

$ \therefore $ For the 11 prime numbers ($11,13,17,19,23,29,31,37,41,43$ and 47), $n$ can only be 0, 1 (two pairs each).

$ \therefore n\left(\mathrm{R}_1\right)=6+4+3+3+(2 \times 11)=38 $

$\mathrm{R}_2=\left(p, p^n\right) $, where n = 0 or 1

$ \left(2,2^0\right),\left(2,2^1\right)\left(3,3^0\right)\left(3,3^1\right) \ldots . .\left(47,47^0\right)\left(47,47^1\right) $

Two ordered pairs of each element $n\left({R}_2\right)=2 \times 15=30$ elements

Hence $ R_1-R_2=38-30=8$

Sum of all elements of A $\cap$ B = 2 [Sum of natural numbers upto 100 which are neither divisible by 3 nor by 5]

$ = 2\left[ {{{100 \times 101} \over 2} - 3\left( {{{33 \times 34} \over 2}} \right) - 5\left( {{{20 \times 21} \over 2}} \right) + 15\left( {{{6 \times 7} \over 2}} \right)} \right]$

$ = 10100 - 3366 - 2100 + 630$

$ = 5264$

$\sum\limits_{i = 1}^{10} {\sum\limits_{j = 1}^{10} {\{ i,\,j\} } } $

= {1, 1} {1, 2} {1, 3} ..... {1, 10}

{2, 1} {2, 2} {2, 3} ..... {2, 10}

{3, 1} {3, 2} {3, 3} ..... {3, 10}

$ \vdots $

{10, 1} {10, 2} {10, 3} ..... {10, 10}

Now, $A = \sum\limits_{i = 1}^{10} {\sum\limits_{j = 1}^{10} {min\{ i,\,j\} } } $

= minimum between i and j in all sets and summation of all those values.

and $B = \sum\limits_{i = 1}^{10} {\sum\limits_{j = 1}^{10} {\max \{ i,\,j\} } } $

= maximum between i and j in all sets and summation of all those values.

For 1 :

1 is minimum in sets =

{1, 1}, {1, 2}, {1, 3}, {1, 4}, {1, 5}, {1, 6}, {1, 7}, {1, 8}, {1, 9}, {1, 10}, {2, 1}, {3, 1}, {4, 1}, {5, 1}, {6, 1}, {7, 1}, {8, 1}, {9, 1}, {10, 1}

$\therefore$ 1 is minimum in 19 sets

1 is maximum in {1, 1} sets.

$\therefore$ 1 is maximum and minimum in total 20 sets.

$\therefore$ Sum of 1 in all those sets = 1 $\times$ 20 = 20

For 2 :

2 is minimum in sets =

{2, 2}, {2, 3}, {2, 4}, {2, 5}, {2, 6}, {2, 7}, {2, 8}, {2, 9}, {2, 10}, {3, 2}, {4, 2}, {5, 2}, {6, 2}, {7, 2}, {8, 2}, {9, 2}, {10, 2}

$\therefore$ 2 is minimum in 17 sets

2 is maximum in sets = {1, 2}, {2, 1}, {2, 2}

$\therefore$ 2 is maximum and minimum in 20 sets.

$\therefore$ Sum of 2 in all those sets = 2 $\times$ 20 = 40

Similarly 3 is maximum and minimum in 20 sets.

$\therefore$ Sum of 3 in all those sets = 20 $\times$ 3 = 60

$ \vdots $

Similarly, 10 is maximum and minimum in 20 sets.

$\therefore$ Sum of 10 in all those sets = 20 $\times$ 10 = 200

$\therefore$ A + B = 20 + 20 $\times$ 2 + 20 $\times$ 3 + ....... + 20 $\times$ 10

= 20(1 + 2 + 3 + ...... + 10)

= 20 $\times$ ${{10 \times 11} \over 2}$

= 1100

The numbers upto 24 which gives g.c.d. with 24 equals to 1 are 1, 5, 7, 11, 13, 17, 19 and 23.

Sum of these numbers = 96

There are four such blocks and a number 97 is there upto 100.

$\therefore$ Complete sum

= 96 + (24 $\times$ 8 + 96) + (48 $\times$ 8 + 96) + (72 $\times$ 8 + 96) + 97

= 1633

A = ($-$$\infty$, 1) $\cup$ (3, $\infty$)

B = ($-$$\infty$, $-$2) $\cup$ (2, $\infty$)

C = ($-$$\infty$, 2] $\cup$ [6, $\infty$)

So, A $\cap$ B $\cap$ C = ($-$$\infty$, $-$2) $\cup$ [6, $\infty$)

z $\cap$ (A $\cap$ B $\cap$ C)' = {$-$2, $-$1, 0, $-$1, 2, 3, 4, 5}

Hence, no. of its subsets = 2⁸ = 256.

B $-$ C $ \equiv $ {7, 13, 19, ......, 97, .......}

Now, n² $-$ n $\le$ 100 $\times$ 100

$\Rightarrow$ n(n $-$ 1) $\le$ 100 $\times$ 100

$\Rightarrow$ A = {1, 2, ......., 100}.

So, A$\cap$(B $-$ C) = {7, 13, 19, ......., 97}

Hence, sum = ${{16} \over 2}(7 + 97) = 832$

In this problem, we're dealing with 3-digit numbers in set $A$, and subsets $B$ and $C$ which represent numbers of specific forms.

1. First, we consider the numbers of the form $9k + 2$ (Set $B$) within the 3-digit range, which starts at 101 and ends at 992.

2. We calculate the sum of these numbers, denoted as $s_1$. To calculate $s_1$, you use the formula for the sum of an arithmetic series :

$(n/2) \times (\text{{first term}} + \text{{last term}})$

Here, $n$ is the total count of such numbers. These are 3-digit numbers of the form $9k + 2$, and we can find the total count by subtracting the smallest such number (101) from the largest (992), dividing the result by 9 (because we're considering numbers with a difference of 9), and then adding 1.

The sum $s_1$ is calculated as follows :

$(100/2) \times (101 + 992) = 54650$

3. According to the problem, the sum of all elements of the set $A \cap (B \cup C)$ is $274 \times 400 = 109600$.

Since the set $A \cap (B \cup C)$ is the union of two disjoint sets (the set of all three-digit numbers of form $9k + 2$ and the set of all three-digit numbers of form $9k + l$), we can write this sum as :

$s_1 $(for numbers of the form 9k + 2) + $s_2$ (for numbers of the form 9k + l) = 109600

4. Solving this equation for $s_2$ (the sum of numbers of the form $9k + l$), we get :

$s_2 = 109600 - s_1 = 109600 - 54650 = 54950$

5. The sum $s_2$ can be expressed as $(n/2) \times (\text{{first term}} + \text{{last term}})$, where $n$ is the count of numbers of the form $9k + l$. The first term here is the smallest 3-digit number of this form, which is $99 + l$, and the last term is the largest such number, which is $990 + l$.

We equate this to $s_2$ to solve for $l$ :

$54950 = (100/2)[(99 + l) + (990 + l)]$

6. Simplifying this equation, we get :

$2l + 1089 = 1099$

Solving for $l$, we find :

$l = 5$

So, the correct answer is 5.

Number of subsets of A = 2^m

Number of subsets of B = 2ⁿ

Given = 2^m – 2ⁿ = 112

$ \therefore $ m = 7, n = 4 (2⁷ – 2⁴ = 112)

$ \therefore $ m $ \times $ n = 7 $ \times $ 4 = 28

X = {1, 2, 3, 4, …, 50}

A = {2, 4, 6, 8, …, 50} = 25 elements

B = {7, 14, 21, 28, 35, 42, 49} = 7 elements

Here n(A$ \cup $B) = n(A) + n(B) – n(A$ \cap $B)

= 25 + 7 – 3 = 29