Smallest card sharing a box

You deal 100100 distinct cards numbered 11 through 100100 one at a time, each placed into one of two boxes independently and uniformly at random. Consider the box that ends up containing card 100100, and let SS be the smallest card number in that box. The expected value E[S]\mathbb{E}[S] can be written as a(1−a−b)a\left(1 - a^{-b}\right) for integers aa and bb. What is a⋅ba\cdot b?

Show hints (2)+
  1. Every card 1..991..99 is in card 100100's box independently with probability 1/21/2. Use E[S]=∑k≥1P(S≥k)\mathbb{E}[S]=\sum_{k\ge1}P(S\ge k).
  2. S≥kS \ge k requires cards 1,…,k−11,\dots,k-1 to all miss the box, probability (1/2)k−1(1/2)^{k-1}. Sum the geometric series.

Answer

Reveal answer →

200

Create a free account to see the full worked solution and track your progress.

Interview format: Market Maker, Betting Game Rounds

Related questions