olymmath

OFM 2020 J2

  • Junior

Emperor Zorg wishes to found a colony on a new planet. Each of the nn cities that he will establish there will have to speak exactly one of the Empire's 20202020 official languages. Some towns in the colony will be connected by a direct air link, each link can be taken in both directions. The emperor fixed the cost of the ticket for each connection to 11 galactic credit. He wishes that, given any two cities speaking the same language, it is always possible to travel from one to the other via these air links, and that the cheapest trip between these two cities costs exactly 20202020 galactic credits. For what values of nn can Emperor Zorg fulfill his dream?

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator francophone/2020/j2 · Tag NP297SSTSB · Edit this page on GitHub · Keys: j next, k previous