Maths Olympiad Prep

Library / /17 of 62

, 2020

Combinatorics Difficulty 4.6 AIME Find the answer United States

Problem:

Bernie has 20202020 marbles and 20202020 bags labeled B1,,B2020B_{1}, \ldots, B_{2020} in which he randomly distributes the marbles (each marble is placed in a random bag independently). If EE is the expected number of integers 1i20201 \leq i \leq 2020 such that BiB_{i} has at least ii marbles, compute the closest integer to 1000E1000 E.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

Let pip_{i} be the probability that a bag has ii marbles. Then, by linearity of expectation, we find
E=(p1+p2+)+(p2+p3+)+=p1+2p2+3p3+ E = (p_{1} + p_{2} + \cdots) + (p_{2} + p_{3} + \cdots) + \cdots = p_{1} + 2p_{2} + 3p_{3} + \cdots
This is precisely the expected value of the number of marbles in a bag. By symmetry, this is 11.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.