The author gives a brief exposition of the most elementary aspects of the divisor problem of Dirichlet. This problem concerns the asymptotic behaviour of the average number of divisors of the integers from 1 to n as n tends to infinity. In 1849 Dirichlet gave a surprisingly good estimate. In this article a weaker version of his result is proved by an argument using the minimum of prerequisites.