Did you know?

Seven bridges of konigsberg

Seven Bridges of Konigsberg

Seven Bridges of Konigsberg was first resolved by Leonard Euler in 18th century. The city of Konigsberg was set on both sides of the pregal river. The two large island and the mainland is connected by seven bridges. The problem was that a person walks through the city must cross each bridge only once. Every bridge must be crossed completely and one could not walk half way or use any route other than the bridges. The walk should start and end at the same point.

Euler proved that there is no solution for this problem. He formulated this problem by leaving all other features. He took only the list of land masses and the bridges connecting them. He replaced the land masses with the Vertex or node. He represented the bridges and the land masses graphically. This problem laid foundation for the graph theory and prefigured the idea of Topology.

In graphical theory, Euler proved that if a network has more than two odd vertices, it does not have an Euler path. To have Euler path, the number of bridges touching the land masses must be even. But in original problem all four land masses are touched by the odd number of bridges.

Euler theory shows that the desired network must have exactly zero or two nodes of odd degree. The result stated by Euler was proved to be sufficient. So to honor him, it was called Euler path.

Latest Facts

Paradox of even and natural numbers
Paradox of even and natural numbers

We would often think that there are more number of natural numbers than the even numbers because nat...

Math Madness
Math madness 0 by 0 equals to 1 by 2

If this is proved to be correct, everything we have learned in our life so far in Mathematics will g...

Benfords Law
Benfords law (first-digit law)

This will be one of the world most unexplained phenomena you would ever see. The miracle of numbers ...

Related Facts

Microwave oven
Microwave oven by percy spencer

Percy Spencer, an American Engineer accidentally discovered Microwave Oven while working on Raytheon...

Chess
Maximum possible chess moves is 10921506 possible position after 7 moves

The number of possibility chess moves after the white move's is 20 (ie 4 knight moves and 16 moves o...

A Beautiful Mind
John nash - a beautiful mind

A Beautiful Mind is the movie based on the life of john nash, who is said to be Nobel Laureate in e...

Time Dilation
Time dilation: your twin sibling will get more youthful than you

Your twin sibling will get more youthful than you when he returns from the space travel. If your twi...

Grigori Yakovlevich Perelman
Grigori yakovlevich perelman a mathematician to solve most difficult problems in topology

Grigori Yakovlevich Perelman is a Russian mathematician, who made a history in Riemannian geometry a...

Daily Maths Topic Today - seven bridges of konigsberg.


english Calculators and Converters


Sitemap