Question: From the set {1, 2, 3,... , n}, k distinct integers are selected at random and arranged in numerical order (from lowest to highest). Let

From the set {1, 2, 3,... , n}, k distinct integers are selected at random and arranged in numerical order (from lowest to highest). Let P(i, r, k, n) denote the probability that integer i is in position r. For example, observe that P(1, 2, k, n) = 0, as it is impossible for the number 1 to be in the second position after ordering.
(a) Compute P(2, 1, 6, 10).
(b) Find a general formula for P(i, r, k, n).

Step by Step Solution

3.52 Rating (166 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a P2 1 6 10 means that ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

579-M-S-D-D (586).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!