7 thoughts on “Euler’s birthday”

  1. I seem to remember from New Maths, circa 1969 that the answer lies in the number of nodes. What a node is and how many of them are required to make it possible, or in this case impossible, I cannot quite recall. Perhaps a trip to Kingston will reveal all.

  5. Low Wattage :

    Would have been 306 had he lived.

    One bridge no loop, three bridges no loop, same for five or seven or nine zzzzzzzzzz.

    Ahem, LW, I do not think it is quite as simple as that. The problem was perhaps posed ambiguously. It should be

    … to find a walk through the city that would cross each bridge once and only once.

    It does not have to be a loop. i.e. you do not have to end up where you started, but you do have to reach both the islands and both sides of the river. In its current format with the 7 existing bridges, you could not do that, but. 3 bridges would work. Going from left to right on the diagram, remove bridges 3,4,5 & 6 and you would be able to find a path. It is as I said all to do with the nodes.

    Linky thing

    Of course I could be wrong.

Add your Comment