2016 APMO Problems/Problem 4
Revision as of 21:52, 11 July 2021 by Satisfiedmagma (talk | contribs) (Created page with "==Problem== The country Dreamland consists of <math>2016</math> cities. The airline Starways wants to establish some one-way flights between pairs of cities in such a way tha...")
Problem
The country Dreamland consists of 
cities. The airline Starways wants to establish some one-way flights between pairs of cities in such a way that each city has exactly one flight out of it. Find the smallest positive integer 
such that no matter how Starways establishes its flights, the cities can always be partitioned into groups so that from any city it is not possible to reach another city in the same group by using at most 
flights.
