Archipelago of Wonderland

Archipelago of Wonderland

Postby harry.petrone » Mon May 01, 2017 4:08 pm

The archipelago of Wonderland consists of 131072 islands. For any two islands, there is a bridge that connects them. There are 17 managing companies that service at least one of these bridges each. The servicing personnel have decided to go on strike and therefore bring out of service some of the bridges but in such a way that with the remaining bridges, all islands can be accessed from any other island, either directly or through some other island. It has therefore been agreed that only some of the 17 companies will allow their personnel to go on strike. What is the maximum number of companies that can safely allow their personnel to go on strike, given the above condition?





harry.petrone
 
Posts: 3
Joined: Sun Mar 26, 2017 4:07 am
Reputation: 0

Re: Archipelago of Wonderland

Postby Guest » Tue May 02, 2017 3:38 am

Harry,
All I can tell you is that
[tex]131072 = 2^{17}[/tex]
if this is of any help.
And of course that the number of bridges is [tex]2^{16}*(2^{17}-1)[/tex].

Guest
 

Re: Archipelago of Wonderland

Postby Guest » Tue May 02, 2017 4:25 am

I trust R. Baber will post a great solution in no time :)

Guest
 

Re: Archipelago of Wonderland

Postby Guest » Mon May 08, 2017 8:16 am

I posted a solution on stack exchange here:

https://math.stackexchange.com/question ... 65#2267265

To the original poster: do you know the origin of this problem? I've made some attempts to search the literature, and came up empty. Thanks.

Guest
 


Return to Math Riddles



Who is online

Users browsing this forum: No registered users and 1 guest

cron