Denote by the number of positive divisors of a positive integer . Find the smallest constant for which holds for all positive integers .
KURSCHAK 2008
Kürschák Competition 2008.
Other problems
Let and be integers. Let be the set of pairs for which is a power of , and be the set of pairs with a power of . (Here, the powers of are .) Prove that .
In a far-away country, travel between cities is only possible by bus or by train. One can travel by train or by bus between only certain cities, and there are not necessarily rides in both directions. We know that for any two cities and , one can reach from , or from using only bus, or only train rides. Prove that there exists a city such that any other city can be reached using only one type of vehicle (but different cities may be reached with different vehicles).