A deck of n cards numbered 1 through n are to be turned over one a time. Before each card is shown you are to guess which card it will be. After making your guess, you are told whether or not your guess is correct but not which card was turned over. It turns out that the strategy that maximizes the expected number of correct guesses fixes a permutation of the n cards, say 1, 2,. . ., n, and then continually guesses 1 until it is correct, then continually guesses 2 until either it is correct or all cards have been turned over, and then continuality guesses 3, and so on. Let G denote the number of correct guesses yielded by this strategy. Determine P ( G = k ) Hint: In order for C to be at least k what must be the order of cards 1,…,k.
A deck of n cards numbered 1 through n are to be turned over one a time. Before each card is shown you are to guess which card it will be. After making your guess, you are told whether or not your guess is correct but not which card was turned over. It turns out that the strategy that maximizes the expected number of correct guesses fixes a permutation of the n cards, say 1, 2,. . ., n, and then continually guesses 1 until it is correct, then continually guesses 2 until either it is correct or all cards have been turned over, and then continuality guesses 3, and so on. Let G denote the number of correct guesses yielded by this strategy. Determine P ( G = k ) Hint: In order for C to be at least k what must be the order of cards 1,…,k.
Solution Summary: The author calculates the probability of P(G=K), where G is the number of correct guesses.
A deck of n cards numbered 1 through n are to be turned over one a time. Before each card is shown you are to guess which card it will be. After making your guess, you are told whether or not your guess is correct but not which card was turned over. It turns out that the strategy that maximizes the expected number of correct guesses fixes a permutation of the n cards, say 1, 2,. . ., n, and then continually guesses 1 until it is correct, then continually guesses 2 until either it is correct or all cards have been turned over, and then continuality guesses 3, and so on. Let G denote the number of correct guesses yielded by this strategy. Determine
P
(
G
=
k
)
Hint: In order for C to be at least k what must be the order of cards 1,…,k.
Answer this two questions:
2 . We roll seven 20-sided dice, numbered 1 to 20. Show that it is always possible to find two disjoint nonempty subsets of the dice such that the sums of the shown faces of the dice in each of the subsets coincide(only one of the faces is considered to be shown) .
4. We are given a deck of 60 cards, 40 are identical black cards, 10 are identical red cards, and 10 are identical greenc ards. How may ways are there to deal the 60 cards to three distinct players so that everyone gets exactly 20 cards?
3. A room has a large circular table with ten seats, numbered 1 to 10, such that to the right of seat number i is seat
number i + 1 for all i ∈ {1, . . . , 9} and to the right of seat 10 is seat 1. We want to assign seats to 10 people, 6 of
them only speak Slovene, 1 of them only speaks English, and the remaining 3 speak both Slovene and English, by
giving out numbered place cards. In how many ways can we do that so that everyone sits next to at least one person
who speaks a common language?
1. A telegraph can transmit two different signals: a dot and a dash. We want to encode the 26 letters of the English
alphabet and the ten digits 0, 1, 2, . . . , 9 using sequences of these two symbols. What is the smallest integer n such
that we can encode all these letters and digits with sequences of length at most n and length at least 1?
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, probability and related others by exploring similar questions and additional content below.
Discrete Distributions: Binomial, Poisson and Hypergeometric | Statistics for Data Science; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=lHhyy4JMigg;License: Standard Youtube License