If I have seven bridges in a town can I start at point A and only cross each bridge once and still return to point A?

1 answer

It depends on how the bridges are made.

If all bridges link places that are not otherwise accessible, it would not be possible to make a return trip without crossing at least one bridge more than once because one needs to go and come back in an even number of crossings.

It would, however, be possible if at least one bridge is a by-pass, namely it works only as a short-cut. In this case, one can make the return trip on land.

There is a similar mathematical problem on topology which inspired the mathematician Euler to work on topology. Check the following link or other articles:
http://mathforum.org/isaac/problems/bridges1.html
Similar Questions
  1. Which of the following conclusions is supported by the passage?A Bridges with legs are short. B Not all bridges have legs that
    1. answers icon 1 answer
  2. Which of the following best describes the impact of Ruby Bridges on schoolsegregation? (RI 8.1) A. Bridges’ attempts to go to
    1. answers icon 1 answer
  3. What is the main idea of the text?a. Bridges played a large role in integrating schools and still works to teach people
    1. answers icon 1 answer
    1. answers icon 1 answer
more similar questions