If we randomly put balls into \(m(\ge1)\) boxes until \(n(\le m)\) of them are occupied, what is the expectation of the number of balls needed?

See my neat solution here.