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\({\bf{n < 2k - 1}}\), then every winning combination has at least one pair of consecutive numbers. For the rest of the problem, assume that\({\bf{n}} \le {\bf{2k - 1}}\).
b. Let\({{\bf{i}}_{\bf{1}}}{\bf{ < }}...{\bf{ < }}{{\bf{i}}_{\bf{k}}}\)be an arbitrary possible winning combination arranged in order from smallest to largest. For\({\bf{s = 1,}}...{\bf{,k}}\), let\({{\bf{j}}_{\bf{s}}}{\bf{ = }}{{\bf{i}}_{\bf{s}}}{\bf{ - }}\left( {{\bf{s - 1}}} \right)\). That is,
\(\begin{array}{c}{{\bf{j}}_{\bf{1}}}{\bf{ = }}{{\bf{i}}_{\bf{1}}}\\{{\bf{j}}_{\bf{2}}}{\bf{ = }}{{\bf{i}}_{\bf{2}}}{\bf{ - 1}}\\{\bf{.}}\\{\bf{.}}\\{\bf{.}}\\{{\bf{j}}_{\bf{k}}}{\bf{ = }}{{\bf{i}}_{\bf{k}}}{\bf{ - }}\left( {{\bf{k - 1}}} \right)\end{array}\)
Prove that\(\left( {{{\bf{i}}_{\bf{1}}}{\bf{,}}...{\bf{,}}{{\bf{i}}_{\bf{k}}}} \right)\)contains at least one pair of consecutive numbers if and only if\(\left( {{{\bf{j}}_{\bf{1}}}{\bf{,}}...{\bf{,}}{{\bf{j}}_{\bf{k}}}} \right)\)contains repeated numbers.
c. Prove that\({\bf{1}} \le {{\bf{j}}_{\bf{1}}} \le ... \le {{\bf{j}}_{\bf{k}}} \le {\bf{n - k + 1}}\)and that the number of\(\left( {{{\bf{j}}_{\bf{1}}}{\bf{,}}...{\bf{,}}{{\bf{j}}_{\bf{k}}}} \right)\)sets with no repeats is\(\left( {\begin{array}{*{20}{c}}{{\bf{n - k + 1}}}\\{\bf{k}}\end{array}} \right)\)
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
Explanations 
Textbooks 
Flashcards 
91影视 AI 
Notes 
Study Plans 
Study Sets 
Find a degree 
Magazine 
