Question

You and Ellie are playing a game, in which first Ellie chooses r numbers out of the set 1,2,,n, for 1 S n, and then you indep

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Let the numbers be denoted by X1, X2, .....Xn

Ans a)  Total number of ways to choose r numbers out of n numbers = {n}\choose{r}

Now, let's consider we split the set X1, X2, ...Xn into 2 sets of r and (n-r) elements respectively. Now, there are (n-r+1) gaps between the (n-r) numbers (including the ends), so to avoid numbers being consecutive, we need to insert the r numbers in those gaps (see the arrangement below where Y1, Y2, ...Yn-r are the (n-r) numbers):

Y1 Y2 Y3 n-r

We can insert the r numbers into these (n-r) gaps in {n-r}\choose{r} ways

\therefore P(Set of r chosen values don't include consecutive values) = {n-r}\choose{r} / {n}\choose{r}

Ans b) No. of ways to choose 2 consecutive values = n-1 (either X1X2 / X2X3/...../Xn-1Xn)

Without loss of generality suppose we choose Y1 and Y2 as the 2 consecutive values (can re-label the numbers otherwise so that the 2 consecutive chosen numbers are labelled Y1 and Y2). Now, looking at the above diagram, we cannot use the first 3 gaps. Hence, there are (n-r+1 - 3) = (n-r-2) gaps now to insert the remaining r-2 numbers into.

\therefore number of possible selections = (n-1) * (n r22)   

\thereforeP(My r chosen values contain precisely 1 consecutive pair)  

= (n-1) * (n r22) /  {n}\choose{r}

Ans c)  Suppose Ellie has chosen Z1, Z2, ...Zr

This is only 1 among the {n}\choose{r} possible ways in which I can make my selection.

Hence, P(My selection is same as Ellie's) = 1 / {n}\choose{r}

Ans d)  If Ellie's selections are Z1, Z2, ...Zr,

For precisely k of my selections to match that of Ellie's, it can happen in {r}\choose{k} * {n-k}\choose{r-k} ways ({r}\choose{k} ways to choose k numbers from r of Ellie's selections, and {n-k}\choose{r-k} ways to choose rest of the r-k numbers from the remaining n-k numbers).

\therefore P(Precisely k of my numbers match Ellie's) = {r}\choose{k} * {n-k}\choose{r-k} / {n}\choose{r}

Add a comment
Know the answer?
Add Answer to:
You and Ellie are playing a game, in which first Ellie chooses r numbers out of the set 1,2,,n, f...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 4. Two friends are playing a matching card game where friend 1, Max, chooses an Ace,...

    4. Two friends are playing a matching card game where friend 1, Max, chooses an Ace, Two, or Three and friend 2, Lucy, plays King, Queen, or Jack. Depending on what cards they play, they split the pot differently. The payoffs are summarized in the following table: Luey King Queen Jack Ace (4,1) (1,2) (3,2) Max Two (3,2) (3,3) (2,1) Three (1,1) (1.2) (4,4) (a) Use iterated elimination of strictly dominated actions (IESDA) to eliminate actions for Max and Lucy....

  • 4. Two friends are playing a matching card game where friend 1, Max, chooses an Ace,...

    4. Two friends are playing a matching card game where friend 1, Max, chooses an Ace, Two, or Three and friend 2, Lucy, plays King, Queen, or Jack. Depending on what cards they play, they split the pot differently. The payoffs are summarized in the following table: (3.3) Lucy King Queen Jack Ace (4,1) (1,2) (3.2) Max Two (3.2) (2.1) Three (1,1) (1.2) (4,4) (a) Use iterated elimination of strictly dominated actions (IESDA) to eliminate actions for Max and Lucy....

  • Coding Question: You are given an set of numbers {1..N} and an array A[N-1]. Find the...

    Coding Question: You are given an set of numbers {1..N} and an array A[N-1]. Find the number from the set that is not present in the array. (IN JAVA, without using HashSet) a. Include comments within your code. Be detailed. b. What other approaches did you consider to solve this question and why did you choose this approach?

  • Java - Data structures and algorithms VI. Matching Game Consider a matching game in which you...

    Java - Data structures and algorithms VI. Matching Game Consider a matching game in which you have a list of random integer values between 10 and 99. You remove from the list any pair of consecutive integers that match. If first integer has digits xly1 and the second integer has digits x2y2 the match is found if any ofthe following is true xi is the same as x2 x1 is the same as y2 yl is the same as x2...

  • Design and implement a class for a one person guessing game as described on page 30,...

    Design and implement a class for a one person guessing game as described on page 30, Chapter 1, Programming Problem 7 of the textbook. CSCI 2421 HW1.jpg Submit header file guess.h, implementation file guess.cpp, main function file main.cpp that asks initial seed number, and prints three sequential numbers generated by the program. You need to include a makefile, and Readme file pseudocode version UF comments in your code. 6. Exercises 6, 7, and 8 ask you to specify methods for...

  • 4. (a) (10%) A player has three information sets in the game tree. He has four...

    4. (a) (10%) A player has three information sets in the game tree. He has four choices in his first information set, four in his second and three in his third. How many strategies does he have in the strategic form? Circle one: (i) 11, (ii) 28 (iii) 48 (iv) 18. (b) (10%) Is it true that the following game is a Prisoners' Dilemma? Explain which features of a Prisoners' Dilemma hold and which do not. (Remember each player must...

  • Overview In this exercise you are going to recreate the classic game of hangman. Your program...

    Overview In this exercise you are going to recreate the classic game of hangman. Your program will randomly pick from a pool of words for the user who will guess letters in order to figure out the word. The user will have a limited number of wrong guesses to complete the puzzle or lose the round. Though if the user answers before running out of wrong answers, they win. Requirements Rules The program will use 10 to 15 words as...

  • Sets, Please respond ASAP, Thank you 2) Recall another notation for the natural numbers, N, is...

    Sets, Please respond ASAP, Thank you 2) Recall another notation for the natural numbers, N, is Z+. We similarly define the negative integers by: 2. Too, for any set A and a e R, define: and Let B={x: x E Z+ & x is odd } (Recall a number I is said to be odd if 2k +1 for some k e z) Assume Z is our underlying background set for this problem. (a) Write an expression for 3 +...

  • Write a program in the Codio programming environment that allows you to play the game of...

    Write a program in the Codio programming environment that allows you to play the game of Rock / Paper / Scissors against the computer. Within the Codio starting project you will find starter code as well as tests to run at each stage. There are three stages to the program, as illustrated below. You must pass the tests at each stage before continuing in to the next stage.  We may rerun all tests within Codio before grading your program. Please see...

  • I Do We Have the Complete Solution Set? A differential operator in R[D] has order n can be writte...

    I Do We Have the Complete Solution Set? A differential operator in R[D] has order n can be written out in the form o(n-1) with the last coefficient cn (at least) not equal to zero. The key to determining the dimension of these solution spaces is the following existence and uniqueness theorem for initial value problems. 'So it can be efficiently described by giving a basis. ethciently described by giving a basis Theorem 1 (Existence and Unique ness Theorem for...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT