# CMI2017-A-02

465 views

An FM radio channel has a repository of $10$ songs. Each day, the channel plays $3$ distinct songs that are chosen randomly from the repository.

Mary decides to tune in to the radio channel on the weekend after her exams. What is the probability that no song gets repeated during these $2$ days?

1. $\begin{pmatrix} 10\\ 3 \end{pmatrix}^{2}*\begin{pmatrix} 10\\ 6 \end{pmatrix}^{-1}$
2. $\begin{pmatrix} 10\\ 6 \end{pmatrix}*\begin{pmatrix} 10\\ 3 \end{pmatrix}^{-2}$
3. $\begin{pmatrix} 10\\ 3 \end{pmatrix}*\begin{pmatrix} 7\\ 3 \end{pmatrix}*\begin{pmatrix} 10\\ 3 \end{pmatrix}^{-2}$
4. $\begin{pmatrix} 10\\ 3 \end{pmatrix}*\begin{pmatrix} 7\\ 3 \end{pmatrix}*\begin{pmatrix} 10\\ 6 \end{pmatrix}^{-1}$

edited
1

Here Order is important

ie.  (1,2,3 ) (4,5,6)  != (4,5,6 ) ( 1,2,3)

option B doesn't consider this order that's why B is eliminated.

0
$^{10}C_3$ is the number of ways of choosing 3 songs on day 1. $^7C_3$ is the number of ways of choosing 3 different songs on day 2, so $^{10}C_3$.$^7C_3$ is the number of combinations that meet Mary’s requirement. $^{10}C_3$ $^{10}C_3$ is the total number of ways of choosing 3 songs on each of the two days, without any constraints.

$P=\dfrac{^{10}C_3}{^{10}C_3}\times\dfrac{^7C_3}{^{10}C_3}$

Mary listen to song on weekend $->$ $2$ days

Selecting $3$ songs from $10$ can be done by $10C3$ ways

Now we select $3$ songs from remaining $7$ song in $7C3$

If we select this way we are sure that Mary will listen new song only

Probability can be given by =$\frac{^{10}C_{3}*^{7}C_{3}}{^{10}C_{3}*^{10}C_{3}}$

edited
0
Why is (D) not the correct answer?
2

@chauhansunil20th it will imply that we are selecting 6 songs out of 10 which is incorrect

0
10C3 does not mean that we allow repeatations means same song can be played 3 times?
0

(D) will not be correct because it will imply that we are choosing 6 distinct songs on two days. So, by choosing this way, we indirectly imply that the songs that we chose on day 1 are completely different than the songs we chose on day 2, which is incorrect. Hence, D is not correct.

## Related questions

1
420 views
Let $G$ be an arbitrary graph on $n$ vertices with $4n − 16$ edges. Consider the following statements: There is a vertex of degree smaller than $8$ in $G$. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it. Which of the following is true: I Only II Only Both I and II Neither I nor II
1 vote
An undirected graph is $\text{connected}$ if, for any two vertices $\{u, v\}$ of the graph, there is a path in the graph starting at $u$ and ending at $v$. A tree is a connected, undirected graph that contains no cycle. A $\text{leaf}$ in a tree is a vertex that has degree ... $u \in V_1$ and v$\in V_2$ or vice versa. Prove that if $G$ is a tree with at least two vertices, then $G$ is bipartite.
In a party there are $2n$ participants, where $n$ is a positive integer. Some participants shake hands with other participants. It is known that there are no three participants who have shaken hands with each other. Prove that the total number of handshakes is not more than $n^2.$
We have constructed a polynomial time reduction from problem $A$ to problem $B$. Which of the following is a valid inference? If the best algorithm for $B$ takes exponential time, then there is no polynomial time algorithm for $A$ If the best algorithm for $A$ takes ... If we don't know whether there is a polynomial time algorithm for $B$, then there cannot be a polynomial time algorithm for $A$.