Let $\varepsilon\_1, \ldots, \varepsilon\_n$ be independent random variables taking values $0,1$ each with probability $1/2$. It is well known that $R\_n=\varepsilon\_1+ \cdots+ \varepsilon\_n$ modulo a prime $p$ tends to the uniform distribution on $\mathbb{Z}\_p$ (say, in total variation distance, but also in a lot of other senses). 


Is it known what the speed of convergance is? Let us say I want to bound $\delta\_n=\sup\_{k}|\mathbb{P}(\varepsilon\_1+ \cdots+ \varepsilon\_n=k)-1/p|$ in terms of $n$. Is it true that $\delta\_n$ converges to $0$ exponentially? If this is true, could you provide a decent reference?


Many thanks for the attention.



Sums of random variables mod p
Yes, and it's proportional to $\cos ( \pi/p)^n$. To see this, observe that adding one more independent random variable acts on the probability distribution as a linear operator, hence a $p \times p$ matrix. Using Fourier analysis mod $p$, compute the eigenvalues of this matrix. Note that one is $1$, corresponding to the uniform distribution, and the rest are at most $cos (\pi/p)$.


More generally, any Markov chain converges exponentially to a stable distribution.


Not a great reference but here's [Wikipedia](https://en.wikipedia.org/wiki/Markov_chain#Convergence_speed_to_the_stationary_distribution).


