Let\u2019s suppose each card starts with $n$ drinks. There are three ways the sequence of buying drinks can end:<\/p>\n

The first card gets maxed out and the second card has $k$ drinks remaining with $k\\ge 1$. This means we purchased a total of $2n-k$ drinks and $n$ of them ended up on the first card. Then, we tried to purchase one additional drink on the first card and the buying stopped. The probability of this occurring is: $(\\tfrac{1}{2})^{2n-k+1}\\binom{2n-k}{n}$.\n<\/li>\n

both cards get maxed out and then we try to buy one more drink on either card. This means we purchased a total of $2n$ drinks and $n$ of them ended up on the first card. The probability of this occurring is $(\\tfrac{1}{2})^{2n}\\binom{2n}{n}$.\n<\/li>\n

The second card gets maxed out and the first card has $k$ drinks remaining with $k\\ge 1$. This is exactly analogous to the first case, and the probability of this occurring is again: $(\\tfrac{1}{2})^{2n-k+1}\\binom{2n-k}{n}$.\n<\/li>\n<\/ol>\n
Putting all of this together, we end up with a tidy formula for $p(n,k)$, the probability that when the game ends, the other card has exactly $k$ drinks remaining on it:<\/p>\n
$\\displaystyle
\np(n,k) = \\frac{1}{2^{2n-k}} \\binom{2n-k}{n}
\n$<\/span><\/p>\n
To double-check that this is a valid probability mass function, we should have $\\sum_{k=0}^n p(n,k) = 1$. This is indeed the case, but it\u2019s rather challenging to verify. Here is a link to the WolframAlpha computation<\/a>. Here is plot of the probability mass function for $n=50$.<\/p>\n
$\"\"$ <\/a><\/p>\n
We can now answer the first question: the probability that the other card still has drinks on it is one minus the probability that there are no drinks left, i.e. $1-p(n,0)$. This evaluates to:<\/p>\n
$\\displaystyle
\n\\mathrm{Prob}\\Bigl(\\begin{smallmatrix}\\text{there are drinks left}\\\\\\text{on the other card}\\end{smallmatrix}\\Bigr)
\n= 1-\\frac{1}{4^n} \\binom{2n}{n} \\approx 1-\\frac{1}{\\sqrt{\\pi n}}
\n$<\/span><\/p>\n
This makes sense; the only way there can be no drinks left is if we purchased $2n$ drinks, and we were lucky to use each card exactly $n$ times. We would expect this probability to get smaller as $n$ gets larger. The approximation I used above comes from Stirling-like approximations for binomial coefficients (see here<\/a>). When $n=50$ as in the problem statement, the probability evaluates to $92.04\\%$. Here is a plot showing how the probability of there being drinks on the other card slowly tends to $1$ as $n$ gets larger:<\/p>\n
$\"\"$ <\/a><\/p>\n
Now let\u2019s address the second question: what is the expected number of drinks on the other card? We will compute the expected value directly from the probability mass function: $E_n = \\sum_{k=0}^n k\\, p(n,k)$. We find:<\/p>\n
$\\displaystyle
\n\\mathbb{E}\\Bigl(\\begin{smallmatrix}\\text{number of drinks left}\\\\\\text{on the other card}\\end{smallmatrix}\\Bigr)
\n= \\frac{2n+1}{4^n}\\binom{2n}{n}-1 \\approx \\frac{2n+1}{\\sqrt{\\pi n}}-1
\n$<\/span><\/p>\n
Again, the derivation is challenging so I omitted it, but here is the WolframAlpha link<\/a>. Here is a plot of this function as it changes with $n$ along with the approximation (which is quite good!)<\/p>\n
$\"\"$ <\/a><\/p>\n
When $n=50$ as in the problem statement, the expected number of drinks remaining on the other card is $7.0385$. This corresponds to the expected value of the probability distribution plotted in the first image.\n<\/p><\/div>\n
<\/p>\n<\/body>","protected":false},"excerpt":{"rendered":"
Here is a puzzle from the Riddler about gift cards: You\u2019ve won two gift cards, each loaded with 50 free drinks from your favorite coffee shop. The cards look identical, and because you\u2019re not one for record-keeping, you randomly pick one of the cards to pay with each time you get a drink. One day, … Continue reading “Gift card puzzle”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":2625,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[7],"tags":[9,6,8,2],"class_list":["post-2620","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-riddler","tag-binomial","tag-counting","tag-probability","tag-riddler"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t