olymmath

USAMO 1975 Problem 5

A pack of n\mathrm{n} cards, including three aces, is well shuffled. Cards are turned over in turn. Show that the expected number of cards that must be turned over to reach the second ace is (n+1)/2(\mathrm{n}+1) / 2.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

(\mathrm{n}+1) / 2

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator usamo/1975/p5 · Tag FWFDFH5PTQ · Edit this page on GitHub · Keys: j next, k previous