Skip to content

Smallest card sharing a box with card 100

Question

Cards numbered 11 through 100100 are dealt one by one, and each card is dropped into one of two boxes chosen independently and uniformly at random. Let XX be the lowest number in whichever box ends up containing card 100100. Then E[X]\mathbb{E}[X] can be expressed as a(1−a−b)a(1-a^{-b}) where aa and bb are integers. What is abab?

Short answer

200200. Use E[X]=∑k≥1P[X≥k]\mathbb{E}[X]=\sum_{k\ge1}\mathbb{P}[X\ge k]. The event X≥kX\ge k means cards 1,…,k−11,\dots,k-1 all went to the other box, which has probability 2−(k−1)2^{-(k-1)}. Summing for k=1,…,100k=1,\dots,100 gives 2(1−2−100)2(1-2^{-100}), so a=2a=2, b=100b=100.

Adapted from QuantQuestions.io; question and answer rewritten by SelfMadeQuant.com.

See the hint and the full worked solution in the question bank (free account).

Open the worked solution

Lessons behind this question

Start with a free lesson: Expectation, Variance and Covariance is part of a free topic. Create a free account, no card needed, to read it in full with worked solutions.

Read it free