\documentclass[12pt]{article}
\usepackage{amsmath}

\begin{document}

\noindent
Tik-61.183 Special course on information technology III \\
Randomized algorithms \\ Spring 2000 \\ Heikki Mannila

\vspace{3mm}

\noindent
\textbf{Exercises 3, due March 15, 2000}

\begin{enumerate}
  
\item Complete last time's exercise 2.4: show that the given algorithm 
  does indeed select a permutation uniformly.
  \begin{tabbing}
    \qquad\=\qquad\=\kill
    Set~$X\leftarrow(1,2,\dots,n)$.\\
    Repeat for~$i=1,2,\dots,n-1$:\\
    \>Select a number $r\in\{i,i+1,\dots,n\}$ at random.\\
    \>Exchange~$X[i]\leftrightarrow X[r]$.\\
    Output~$X$.\\
  \end{tabbing}
  

\end{enumerate}
\end{document}
