SOLUTION: Let's do a Koningsberg bridge problem for the city of New York. We will ignore any tunnels and Staten Island since there is only one bridge to it which immediately makes it imposs
Algebra.Com
Question 28343: Let's do a Koningsberg bridge problem for the city of New York. We will ignore any tunnels and Staten Island since there is only one bridge to it which immediately makes it impossible. Within the city I count the following:
11 bridges between Manhattan and the Bronx
6 bridges between Manhattan and Queens/Brooklyn
4 bridges between the Bronx and Queens/Brooklyn
Is it possible to make a tour of the city crossing every bridge only once and still return to the same starting point?
Answer by khwang(438) (Show Source): You can put this solution on YOUR website!
Count the degree for each vertex:
Manhattan: 11 + 6 = 17
Bronx: 11 + 4 = 15
Queens/Brooklyn: 6+4 =10
Note that there are two odd vertices, so the only possible Euler
path is starting from Manhattan to Bronx (or reverse).
But, there is no Euler circuit which can return to the same starting point
(unless all vertices are of even degree. why ?)
Kenny
RELATED QUESTIONS
The Bayonne bridge connects Staten Island, New York to New Jersey. It has an arch in the... (answered by CPhill)
Read the given paragraph carefully and keeping in mind the qualities of Journalistic... (answered by MathLover1)
Let’s suppose you are standing on the Brooklyn Bridge in New York. Also suppose you know... (answered by solver91311)
Syracuse and New York City are 240 miles apart. One car left Syracuse heading for New... (answered by josgarithmetic,josmiceli)
The formula N = 2x^2+6x+3 represents the number of households N, in thousands, in a... (answered by jorel1380)
Among the 30 largest U.S. cities, the mean one-way commute time to work is 25.8 minutes.... (answered by ikleyn)
At 5pm, Jill leaves New York City and travels toward Boston at an average rate of 56... (answered by stanbon,mananth)
The number of drive-in movie screens has declined steadily in the U.S. since the 1960s.... (answered by Theo)
I need help with writing an inequality for this problem-
"There are only 10... (answered by cowess)