The arithmetic progression of odd numbers $1, 3,...,2n+1,...$ contains infinitely many primes. It is natural to ask whether other arithmetic progressions also have this property. Dirichlet was the first who addressed this problem and proved that there are infinitely many primes in any arithmetic progression with certain conditions. We will discuss this result.