Is there an answer to the Seven Bridges question 5, is there an answer to the Seven Bridges question

No way! Euler studied and solved this problem in 1736, and he reduced the problem to the "one-stroke" problem shown in the picture on the right, proving that the above move was impossible.

So far, scientists have not solved the "Seven Bridges Problem"!

It is impossible not to walk all 7 bridges of Königsberg at once without repeating them.

There is no solution to the problem of the Seven Bridges. Euler turned it into a one-stroke problem, stating that it can only be done in one stroke if there is an even number of line segments at the ends, so it can never be done in one stroke.

I don't think so!! I'm in the sixth grade, and I'm studying, so I'll tell you one day, add me: 1209853588

I believe that as long as you keep thinking about it, you will have an answer to the question of the Seven Bridges.

No way there will be an answer.

Neither will I!! Very frustrated.

There is no answer to the question of the seven bridges, because the points between the bridges are even when they are true, and the seven bridges, no matter how you go.

There will be 1 pick side that can't go or repeat it!

After the problem was raised, many people were very interested in it and experimented with it, but for a long time, it was never solved. Using ordinary mathematical knowledge, each bridge is walked once, then there are a total of 5,040 ways to walk on these seven bridges, and so many situations, to test them one by one, it will be a lot of work. But how do you find a route that successfully crosses each bridge without repeating it?

Thus became known as the "Königsberg Seven Bridges Problem".

In 1735, several university students wrote to Euler, a genius mathematician who was then working at the Petersburg Academy of Sciences in Russia, asking him to help solve this problem. After observing the Königsberg Seven Bridges in person, Euler seriously thought about the way to move, but never succeeded, so he wondered if the Seven Bridges problem was unsolvable in the first place.

In 1736, after a year of research, the 29-year-old Euler submitted the Seven Bridges of Königsberg, which satisfactorily solved this problem and created a new branch of mathematics--- graph theory.

In **, Euler abstracts the problem of seven bridges, considering each piece of land as a point, and the bridge connecting the two pieces of land is represented by a line. And from this we get the geometry like the figure. If we use the four points a, b, c, and d, we represent the four areas of Königsberg.

In this way, the famous "Seven Bridges Problem" is transformed into a question of whether the seven lines can be drawn without repeating each other. If it can be drawn, then there must be an end point and a starting point in the figure, and the starting point and the end point should be the same point, because of the symmetry, it can be seen that the effect obtained by a or c as the starting point is the same, if we assume that a is the starting point and the end point, then there must be an exit line and the corresponding entry line, if we define the number of lines entering a as the degree of in, the number of leaving the line as the degree of out, and the number of lines related to a as the degree of a, then the degree of a is equal, that is, the degree of a should be even. That is, if there is a solution from a, then the degree of a should be even, and in fact the degree of a is 3 and is an odd number, so it can be seen that there is no solution from a.

At the same time, if we start from b or d, since the degrees of b and d are both odd numbers, that is, there is no solution to take them as the starting point.

For the above reasons, it can be seen that there is no solution to the abstracted mathematical problem, that is, the "Seven Bridges Problem".

The answer is unsolvable, you have to remember that the problem of the Seven Bridges is: can you draw the whole figure without leaving the paper, without repeating it. "One stroke" problem, mathematical analysis:

A stroke has a start and an end point, and the figure where the start and end point coincide is called a closed figure, otherwise it is called an open figure. In addition to the start and end points, there may be some intersection points of curves in the middle of a stroke. A stroke can only be completed when the brush reaches the intersection point along one arc and can leave along another arc, that is, when the arcs that intersect at these points are paired in pairs, and such an intersection is called an "even point".

If the arcs that intersect these points are not in pairs, that is, there are odd numbers, then a stroke cannot be realized, and such points are called "singularities".

Conclusion: If a single stroke is drawn, there are either only two singularities, that is, there is only a beginning and an end, so that the shape drawn with one stroke is open; Either there is no singularity, that is, the end and the beginning are connected, so that the figure drawn with one stroke is closed. Since the Seven Bridges problem has four singularities, it is impossible to find a route that passes through seven bridges, but each bridge is only taken once.

Thank you for your trust, I don't understand this too much, but I can provide you with a reference, I hope it will be helpful to you. Reference.

Radius meters volume cubic meters.

2 centimeters = meters.

A: It can be paved 2649 meters.

Don't you know that there is no solution to this problem ... There is no answer at all!

There is no solution to this problem.

Unsolvable, no answers, oh oh oh.

The 6th grade people's education version of the math book is 95 pages, in detail.

I'm sorry, but Gogoss has proven that there is no solution for the Seven Bridges.

Great scientists don't know how others can answer it?

Euler used dots to represent islands and land, and the lines between the two points to represent the bridges that connected them, reducing rivers, islands, and bridges to a network, and reducing the problem of seven bridges to a problem of judging whether a connected network could be drawn in one stroke. Not only did he solve this problem, but he also gave that the sufficient and necessary conditions for a single stroke to be connected to the network are that they are connected to each other, and the number of vertices (the number of arcs through this point is an odd number) is 0 or 2

Encyclopedia (Seven Bridges Problem)...Very detailed.

One of the famous mathematical problems of the 18th century. In one of Königsberg's parks, seven bridges connect the two islands of the Pregel River with the banks of the river (pictured). Q: Is it possible to start from any of these four landmasses, pass through each bridge exactly once, and then return to the starting point?

Euler studied and solved this problem in 1736, and he reduced the problem to the "one-stroke" problem shown in the picture on the right, proving that the above move was impossible.