# The King needs your help (the end!)

**Algebra**Level 4

An ambitious king plans to build a number of new cities in the wilderness, connected by a network of roads, so that any city can be reached from any other. 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 populations of the various cities (as long as at least one city has any inhabitants at all). The court engineer submits some proposals (attached), but the king deems them "boring" and asks for other options. How many other graphs are there (up to isomorphism) that make this project viable?

**Your answer seems reasonable.**Find out if you're right!

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.