benchmarks.wiki / Public workspace

Omni-MATH / The country Dreamland consists of 2016 cities. The airline Starways wants to…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

The country Dreamland consists of 2016 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 kk such that no matter how Starways establishes its flights, the cities can always be partitioned into kk groups so that from any city it is not possible to reach another city in the same group by using at most 28 flights.
Plain-text mathematical notation (without MathML)
The country Dreamland consists of 2016 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 k such that no matter how Starways establishes its flights, the cities can always be partitioned into k groups so that from any city it is not possible to reach another city in the same group by using at most 28 flights.
Original LaTeX notation
The country Dreamland consists of 2016 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 $k$ such that no matter how Starways establishes its flights, the cities can always be partitioned into $k$ groups so that from any city it is not possible to reach another city in the same group by using at most 28 flights.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import