MathNet 2013 Question 59

There were $n$ students participating in a competition and each student solved exactly three problems. For any two students there is exactly one problem which they both solved, while each problem was solved by exactly $k$ students. For which positive integers $n$ and $k$ is that possible?
(Moscow olympiad 1947)