Consider a state lottery game in which each winning combination and each ticket consists of one set of k numbers chosen from the numbers 1 to n without replacement. We shall compute the probability that the winning combination contains at least one pair of consecutive numbers.
a. Prove that if n < 2k − 1, then every winning combination has at least one pair of consecutive numbers. For the rest of the problem, assume that n ≥ 2k − 1.
b. Let i1 < . . . < ik be an arbitrary possible winning combination arranged in order from smallest to largest. For s = 1, . . . , k, let js = is − (s − 1). That is,
j1 = i1,
j2 = jk
− 1
.
.
.
jk = ik − (k − 1).
Prove that (i1, . . . , ik) contains at least one pair of consecutive numbers if and only if (j1, . . . , jk) contains repeated numbers.
c. Prove that 1≤ j1 ≤ . . . ≤ jk ≤ n − k + 1 and that the number of (j1, . . . , jk) sets with no repeats is (n−k+1/k).
d. Find the probability that there is no pair of consecutive numbers in the winning combination.
e. Find the probability of at least one pair of consecutive numbers in the winning combination.
1) You can buy this solution for 0,5$.
2) The solution will be in 8 hours.
3) If you want the solution will be free for all following visitors.
4) The link for payment paypal.me/0,5usd
5) After payment, please report the number of the task to the oneplus2014@gmail.com
New search. (Also 1294 free access solutions)
Use search in keywords. (words through a space in any order)