Question 19
In a certain country there are 21 cities and the government intends to build $n$ roads (all two-way), each road connects exactly 2 of the country's cities. What is the smallest value of $n$ so that, regardless of how the roads are built, it is possible to travel between any 2 cities (passing, possibly, through intermediate cities)?