Modulo Sum of Random Variables I'm looking for proof using CDFs or MGFs to show for $X$ and $Y$ independent random variables,
$$
X \sim \mathrm{Unif}(0,1) \text{ and } Y \sim \mathrm{Unif}(0,1) \implies (X+Y \bmod 1) \sim \mathrm{Unif}(0,1).
$$
I've tried using MGFs for $X+Y$ but can't seem to figure out how to incorporate the $\bmod 1$ aspect.  I've read this thread but I'm really looking for a proof using MGFs (or CDFs).  Any hints are appreciated!

Not sure if it's the sort of thing you are looking for, but here is a hint.
The joint PDF of $X$ and $Y$ is $f(x,y)=1$ in the unit square $0\le x<1$, $0\le y<1$.  Now for $0\le t<1$ we have
$$X+Y\ {\rm mod}\ 1\le t\quad\hbox{if and only if}\quad X+Y\le t\ \hbox{or}\ 1\le X+Y\le1+t\ .$$
So, to find the CDF of $X+Y$ modulo $1$ you have to integrate $f(x,y)$ over two parts of the unit square: the triangle below the line $x+y=t$ and the strip between $x+y=1$ and $x+y=1+t$.  If you draw a diagram and look carefully you should see that you don't really even need to integrate, you can evaluate this by a simple geometric argument.  Good luck!
