Waste less time on Facebook — follow Brilliant.
×

The King needs your help Extended

This note arose from comments on the problem: The King needs your help


An ambitious king plans to build several new cities in the wilderness, connected by a network of roads. He expects the annual tax revenues from each city to be numerically equal to the square of the population. Road maintenance will be expensive, though; the annual cost for each road is expected to be numerically equal to the product of the populations of the two cities that road connects. The project is considered viable as long as the tax revenues exceed the cost, regardless of the (positive) populations of the various cities.

  1. If the road network was a loop, what can we say about the potential revenue?
  2. If the road network was a complete graph, what can we say about the potential revenue?
  3. If the road network was a tree, what can we say about the potential revenue?

For further investigations

  1. What kind of road networks could we submit, such that any population size could be supported (revenue neutral)?
  2. What kind of road networks could we submit, such that any non-zero population size would result in a surplus (revenue generating)?
  3. Given any road network, how would you determine if there is a potential population size that would result in a deficit?

  4. Given a fixed population size and road network, how would you distribute them to generate the king the most amount of money? The least amount of money?

Note by Otto Bretscher
1 year, 10 months ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

@Otto Bretscher can you tell me,how to solve infinite sum problems ? Chinmay Sangawadekar · 1 year, 2 months ago

Log in to reply

@Otto Bretscher I made you the author of this note, so that you can "Edit this note" accordingly, and decide where to take this. If you "subscribe to this thread", you will receive notifications of comments / replies. Calvin Lin Staff · 1 year, 10 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...