Class JEE Mathematics Sets, Relations, and Functions Q #1053
KNOWLEDGE BASED
APPLY
4 Marks 2020 JEE Main 2020 (Online) 5th September Morning Slot MCQ SINGLE
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 :
(A) $63$
(B) $36$
(C) $54$
(D) $38$
Prev Next
Correct Answer: B
Explanation
Let C be the set of persons who like coffee and T be the set of persons who like tea. Given: $n(C) = 73$ and $n(T) = 65$. Also, $n(C \cup T) \le 100$. Using the formula for the union of two sets: $n(C \cup T) = n(C) + n(T) - n(C \cap T)$. Let $x = n(C \cap T)$ be the percentage of people who like both coffee and tea. So, $n(C \cup T) = 73 + 65 - x \le 100$. This implies $138 - x \le 100$, which gives $x \ge 38$. Also, $x$ must be less than or equal to both $73$ and $65$ since $x$ represents the intersection. So, $x \le 73$ and $x \le 65$. Therefore, $38 \le x \le 65$. Since $x$ must be in the range $[38, 65]$, the value $x=36$ is not possible.

More from this Chapter

NUMERICAL
4 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 _________.
NUMERICAL
Set A has m elements and set B has n elements. If the total number of subsets of A is 112 more than the total number of subsets of B, then the value of m.n is ______.
MCQ_SINGLE
Consider the following two binary relations on the set $A = {a, b, c}$: $R_1 = {(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)}$ and $R_2 = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}$. Then:
NUMERICAL
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 _________.
MCQ_SINGLE
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 :
View All Questions