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.
2) Suppose we select two values x and y independently from the uniform distribution on
[0,1]. What is the probability that xy
1
2
100 identical balls are rolling along a straight line. They all have speed equal to v, but some of them might move in opposite directions. When two of them collide they immediately switch their direction and keep the speed v. What is the maximum number of collisions that can happen?
Let f(w) be a function of vector w Є RN, i.e. f(w) = 1+e Determine the first derivative and matrix of second derivatives off with respect to w.
Let A Є RN*N be a symmetric, positive definite matrix and bЄ RN a vector. If x ER, evaluate the integral Z(A,b) = e¯xAx+bx dx as a function of A and b.
John throws a fair die with faces labelled 1 to 6. ⚫ He gains 10 points if the die shows 1. ⚫ He gains 1 point if the die shows 2 or 4. • No points are allocated otherwise. Let X be the random variable describing John's gain at each throw. Determine the variance of X.
Female
Male
Totals
Less than High School
Diploma
0.077
0.110
0.187
High School Diploma
0.154
0.201
0.355
Some College/University
0.141
0.129
0.270
College/University Graduate
0.092
0.096
0.188
Totals
0.464
0.536
1.000
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