Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am having trouble with the following problem and was wondering if someone can point me in the right direction.

Let $X_1, X_2, \ldots$ be an infinite sequence of independent, identically distributed uniform random variables on $[0,1]$. For a given constant $x$, where $0 < x <1$, define $$ M= \min\{n\ge1: X_1 + X_2 + \ldots + X_n > x\}. $$ (So for a given $x$, $M$ is a discrete random variable that tells us out how many terms it takes in order for the above summation to exceed $x$.)

Find $P(M>k)$, where $k$ is a non-negative integer.

I have an inuition that I need to set up some kind of recursion but I am not sure if this approach is correct either. Thank you for the help.

share|cite|improve this question
Thanks for the edit on the original problem. I did not know how LaTeX worked on math stack exchange. – user59307 Jan 23 '13 at 3:16
up vote 0 down vote accepted

Clearly $P(M>0)=1$. If you define $S_k = X_1+\ldots+X_k$, then for $k\ge1$, we have $P(M>k) = P(S_k\le x)$, where the formula for $P(S_k\le x)$ can be found in here.

share|cite|improve this answer
Thank you for the hint. I now know what to do with the problem. – user59307 Jan 23 '13 at 19:07

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.