Class JEE Mathematics Sets, Relations, and Functions Q #1061
KNOWLEDGE BASED
APPLY
4 Marks 2019 JEE Main 2019 (Online) 9th April Evening Slot MCQ SINGLE
Two newspapers A and B are published in a city. It is known that $25$% of the city populations 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 advertisement is :-
(A) $13.5$
(B) $13$
(C) $12.8$
(D) $13.9$
Prev Next
Correct Answer: D
Explanation
Let the total population be $100$. Then:

People who read A only: $25 - 8 = 17$

People who read B only: $20 - 8 = 12$

People who read A and look into advertisements: $0.30 \times 17 = 5.1$

People who read B and look into advertisements: $0.40 \times 12 = 4.8$

People who read both A and B and look into advertisements: $0.50 \times 8 = 4$

Total percentage of people who look into advertisements: $5.1 + 4.8 + 4 = 13.9$

Therefore, the percentage of the population who look into advertisement is $13.9$%.

More from this Chapter

MCQ_SINGLE
Let $R$ be the real line. Consider the following subsets of the plane $R \times R$: $S = {(x, y) : y=x+1 ext{ and } 0
MCQ_SINGLE
Let $R$ be a relation on $N \times N$ defined by $(a, b) R (c, d)$ if and only if $ad(b - c) = bc(a - d)$. Then $R$ is
MCQ_SINGLE
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$ divides $b_2$ and $a_2$ divides $b_1}$ is :
NUMERICAL
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 _________.
MCQ_SINGLE
Let $A = {1, 2, 3, ..., 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), ..., (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 :
View All Questions