olymmath

KURSCHAK 2008

Kürschák Competition 2008.

Other problems

Problem 1

Denote by d(n)d(n) the number of positive divisors of a positive integer nn . Find the smallest constant cc for which d(n)≤cnd(n)\le c\sqrt n holds for all positive integers nn .

Problem 2

Let n≥1n\ge 1 and a1<a2<⋯<ana_1<a_2<\dots<a_n be integers. Let SS be the set of pairs 1≤i<j≤n1\le i<j\le n for which aj−aia_j-a_i is a power of 22 , and TT be the set of pairs 1≤i<j≤n1\le i<j\le n with j−ij-i a power of 22 . (Here, the powers of 22 are 1,2,4,…1,2,4,\dots .) Prove that ∣S∣≤∣T∣|S|\le |T| .

Problem 3

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 AA and BB , one can reach BB from AA , or AA from BB 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).