Road to go $n$ cities.
Source:
February 9, 2017
combinatorics
Problem Statement
There are cities in a country. Between any two cities there is at most one road. Suppose that the total number of roads is Prove that there is a city such that starting from there it is possible to come back to it without ever travelling the same road twice.