9
$\begingroup$

This question already has an answer here:

I'm not sure if this is the most suitable site for the question. Please feel free to modify or move my post!

I have heard that people really walked a lot in Königsberg, trying to solve that seven bridges puzzle.

I'm just a bit curious: before the proof of Euler, was there already a common belief that it was impossible, given that so much effort failed?

Of course, the proof of Euler is quite important in the history of mathematics. But were people surprised by the negative answer (like, "aha, I wasted so much time on something impossible!"), or did they just say, "ha, we all knew it's impossible, but that guy just cooked up a paper on it!"

$\endgroup$

marked as duplicate by Danu Oct 9 at 15:48

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

migrated from puzzling.stackexchange.com Oct 9 at 14:57

This question came from our site for those who create, solve, and study puzzles.

  • 1
    $\begingroup$ How about to check with the residents in Königsberg? :P $\endgroup$ – Conifers Oct 5 at 1:51
3
$\begingroup$

It looks like there wasn't really a common belief; see the question What was the origin of the Seven Bridges of Königsberg problem before Euler?.

The answer by user @Conifold quotes researcher Teo Paloetti:

According to lore, the citizens of Königsberg used to spend Sunday afternoons walking around their beautiful city. While walking, the people of the city decided to create a game for themselves, their goal being to devise a way in which they could walk around the city, crossing each of the seven bridges only once. Even though none of the citizens of Königsberg could invent a route that would allow them to cross each of the bridges only once, still they could not prove that it was impossible.

and Euler himself:

The problem, which I am told is widely known, is as follows: in Königsberg in Prussia, there is an island A called the Kneiphof; the river which surrounds it is divided into two branches, as can be seen in Fig. [1.2], and these branches are crossed by seven bridges, a, b, c, d, e, f and g. Concerning these bridges it was asked whether anyone could arrange a route in such a way that he would cross each bridge once and only once. I was told that some people asserted that this was impossible, while others were in doubt; but nobody would actually assert that it could be done. From this, I have formulated the general problem: whatever be the arrangement and division of the river into branches, and however many bridges there be, can one find out whether or not it is possible to cross each bridge exactly once?

(emphasis mine)

$\endgroup$
  • $\begingroup$ If the question were posted here, I might have closed it as a duplicate, but it was originally posted on Puzzling.SE and I wrote my answer there. $\endgroup$ – Glorfindel Oct 9 at 15:29