top of page

Season 186 - Day 9 of 14


In the field of graph theory, a famous challenge concerned the city now known as Kaliningrad and its complex network of bridges across the Pregel River.
Mathematician Leonhard Euler approached this problem, proving it was impossible to traverse each bridge exactly once in a single journey.
This negative resolution laid the groundwork for modern topology and Eulerian paths.
What is the name of this mathematical problem that highlighted the limitations of bridge crossings in a single route?


Rate QuestionDon’t love itNot greatGoodGreatLove itRate Question
average rating is null out of 5, based on 0 votes, Product ratings

Thanks for rating this question!

You must be logged in to type your answer

Send your answer

Correct answer is: 

You answered:

If you want to leave a comment for the quizmaster you can always contact him by using the chat button at the bottom right corner.

The quiz master will return to you as soon as possible

bottom of page