Equidistribution Mod $1$ And Normal Numbers

Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability $1/b^k$. A proof of the normality of the real number $\sqrt{2}$ in base $10$ is presented in this note. Three different proofs based on different methods are given: a conditional proof, and two unconditional proofs.