There are 1993 towns in a country, and at least 93 roads going out of each town. It's known that every town can be reached from any other town. Prove that this can always be done with no more than 62 transfers. ceiling functioninequalitiescombinatorics unsolvedcombinatorics