Question: Question as given in the attachment Jonathan and Yiming are playing a card game. Jonathan has k > 2 cards, and each card has a
Question as given in the attachment

Jonathan and Yiming are playing a card game. Jonathan has k > 2 cards, and each card has a real number written on it. Jonathan tells Yiming (truthfully), that the sum of the card values is 0, and that the sum of squares of the values on the cards is 1. Specically, if the card values are cl,cz,...,ck, then we have 2592165 2 0 and [k 6.2 = 1. Jonathan and Yiming also agree on a 21 1 positive target value of a. The cards are then going to be dealt randomly in the following fashion: for each card in the deck, a fair coin is ipped. If the coin lands heads, then the card goes to Yiming, and if the coin lands tails, the card goes to Jonathan. Note that it is possible for either player to end up with no cardslall the cards. A player wins the game if the sum of the card values in their hand is at least (1, otherwise it is a tie. (a) Prove that the probability that Yiming wins is at most 8%,. (b) Find a deck of k cards and target value a where the probability that Yiming wins is exactly 1 W"
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
