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.
التمرين الأول: 08) نقاط)
نرمي رباعي وجوه مرقم من ا إلى 4 بحيث إحتمال وجوهه يحقق العلاقة التالية: - 24 = (3)P(1) = ) = 4P
-1 أحسب احتمال كل وجه.
-2
(١ أحسب احتمال الحادثة : الحصول على عدد زوجي).
ب استنتج احتمال الحادثة ة.
-3 أحسب احتمال الحادثة B الحصول على عدد د أكبر أو يساوي (2)
Please solve the following Probability problem. Show all work and solve all parts that are asked:
HW 1.y.(Yutnori)
Yutnori is played by 2 (groups of) players on a gameboard with pieces thatmove around. Each player takes turns throwing yut sticks - each stick hastwo sides, round and flat, which makes the stick roll. Five combinationsare possible with yut sticks: do, gae, geol, yut and mo. A player achievinga yut or mo is allowed to roll again. Combinations and the number ofmoves they allow on the gameboard are presented in Figure 3 (flat sideup is blank and round side up is filled with x-es).
Assuming each of the 4 Yut sticks falls on both of its sides with equalprobability, what is the probability that:a) you roll a yut?b) you roll a geol ?c) you get a second roll?d) you move 6 spaces in your first turn?In reality, a typical Yut stick is designed so that the probability of flat sidefacing up is around 60%. Try to think of what the previous probabilitieswould be in this case.
Please solve the following Probability Problem, please show all work and solve what is asked:
HW 1.w. (Special game)The atmosphere has heated up and a fight erupted! There are n + 1players and somebody threw the first punch. Once a person is punched,they punch another person in the group at random. What are the oddsthat after m iterations:a) Nobody punches the person who started it?b) Nobody gets punched twice?Now take it up a notch: imagine the first person punched N other peopleat random, and once someone gets punched, they punch another N peoplein the group at random, and so on. Again, what are the odds that afterm iterations:a) Nobody punches the person who started it?b) Nobody gets punched twice?
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