benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / You would like to provide airline service to the 10 cities in the nation of…

Problem

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

problem

You would like to provide airline service to the 10 cities in the nation of Schizophrenia, by instituting a certain number of two-way routes between cities. Unfortunately, the government is about to divide Schizophrenia into two warring countries of five cities each, and you don't know which cities will be in each new country. All airplane service between the two new countries will be discontinued. However, you want to make sure that you set up your routes so that, for any two cities in the same new country, it will be possible to get from one city to the other (without leaving the country). What is the minimum number of routes you must set up to be assured of doing this, no matter how the government divides up the country?

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

task_id
3147c7eb-6f6b-56b9-9ef4-be8924fa35a8
task_key
test--3147c7eb-6f6b-56b9-9ef4-be8924fa35a8
task_revision_id
1
config / split
/ test

Official source

initial import