Coupon Collector's Problem
Let 
objects be picked repeatedly with probability 
that object 
is picked on a given try, with
Find the earliest time at which all
objects have been picked at least once.
References
Hildebrand, M. V. ``The Birthday Problem.'' Amer. Math. Monthly 100, 643, 1993.
- Long Division
- Long Exact Sequence of a Pair Axiom
- Longitude
- Long Prime
- Look and Say Sequence
- Loop (Algebra)
- Loop Gain
- Loop (Graph)
- Loop (Knot)
- Loop Space
- Lorentz Group
- Lorentzian Distribution
- Lorentzian Function
- Lorentz Tensor
- Lorentz Transformation
- Lorenz System
- Lorraine Cross
- Lo Shu
- Lotka-Volterra Equations
- Low-Dimensional Topology
- Lower Bound
- Lower Denjoy Sum
- Lower Integral
- Lower Limit
- Lower Sum