7. Set A consists of k distinct numbers. If n numbers are selected from the set one-by-one, where n<=k, what is the probability that numbers will be selected in ascending order?
(1) Set A consists of 12 even consecutive integers;
(2) n=5.
It is important to note two things:
1. The probability of selecting any subset of \(n\) numbers from the set is the same. No particular subset of \(n\) numbers is favored over any other subset of \(n\) numbers, so they all have an equal probability of being selected.
2. Any subset of \(n\) distinct numbers can be selected in \(n!\) ways, and only one out of these \(n!\) possible ways will be in ascending order. For example, subset of {1, 2, 3} can be selected in 6 ways: (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2) or (3, 2, 1). As you can see, out of these \(3!\) possible ways, only one is in ascending order, (1, 2, 3). Therefore, the probability of selecting a subset in ascending order is \(\frac{1}{n!}\).
Thus, to answer the given question, we only need to know the size of the subset (\(n\)) that we are selecting from the set \(A\). Therefore, the firs statement is not sufficient, while the second one is.
Answer: B