|
you can just do what tasw76 did, it's probably easier, but here's how to think of it with formulas: n chooses k = n! / (k! * (n-k)!), means how many ways can one choose k things from a set of n things(of course n >= k) let w = the number of women; then p = w chooses 2 / 10 chooses 2 (w chooses 2 gives how many ways u can choose any 2 women out of all the women, use that divide how many ways you can choose 2 any people out of the 10 people, that gives you the probability that both ppl selected are women); do some calculations and you will find that p is simply w * (w-1) / 90; if w > 5, then follow the example of tasw76, if w = 7, p = 6 * 7 / 90 = 42 / 90 < 1/2 ; but if w = 10, then p = 1 > 1/2, thus (1) by itself is not sufficient; let q = m chooses 2 / 10 chooses 2, where m = the number of men; (this is the probability that both ppl selected are men) and q = m * (m - 1) / 90; if q < 1/10, that means m * (m - 1) / 9 < 1, so m could be 0, 1, 2, 3, let it be 0, that means w = 10 - 0 = 10, so p = 1 > 1/2; but if m = 3, then w = 10 - 3 = 7, and p = 42/90 < 1/2, so (2) is not sufficient by itself; if you take these two together, you will notice the same thing happens with the example of 10 women and 0 man, and th example of 7 women and 3 men, thus (1) and (2) taken together is not sufficient; Therefore, the answer is E; Personally I'd just do what tasw76 did, since the set for this problem is not that big; |