Return to Video

How the Königsberg bridge problem changed mathematics - Dan Van der Vieren

  • 0:09 - 0:14
    You'd have a hard time finding
    Königsberg on any modern maps,
  • 0:14 - 0:17
    but one particular quirk in its geography
  • 0:17 - 0:22
    has made it one of the most famous cities
    in mathematics.
  • 0:22 - 0:26
    The medieval German city lay on both sides
    of the Pregel River.
  • 0:26 - 0:29
    At the center were two large islands.
  • 0:29 - 0:33
    The two islands were connected
    to each other and to the river banks
  • 0:33 - 0:36
    by seven bridges.
  • 0:36 - 0:41
    Carl Gottlieb Ehler, a mathematician who
    later became the mayor of a nearby town,
  • 0:41 - 0:44
    grew obsessed with these islands
    and bridges.
  • 0:44 - 0:47
    He kept coming back to a single question:
  • 0:47 - 0:51
    Which route would allow someone
    to cross all seven bridges
  • 0:51 - 0:55
    without crossing any of them
    more than once?
  • 0:55 - 0:57
    Think about it for a moment.
  • 0:57 - 0:58
    7
  • 0:58 - 0:59
    6
  • 0:59 - 1:00
    5
  • 1:00 - 1:01
    4
  • 1:01 - 1:02
    3
  • 1:02 - 1:03
    2
  • 1:03 - 1:04
    1
  • 1:04 - 1:05
    Give up?
  • 1:05 - 1:06
    You should.
  • 1:06 - 1:08
    It's not possible.
  • 1:08 - 1:13
    But attempting to explain why
    led famous mathematician Leonhard Euler
  • 1:13 - 1:16
    to invent a new field of mathematics.
  • 1:16 - 1:19
    Carl wrote to Euler for help
    with the problem.
  • 1:19 - 1:23
    Euler first dismissed the question as
    having nothing to do with math.
  • 1:23 - 1:25
    But the more he wrestled with it,
  • 1:25 - 1:29
    the more it seemed there might
    be something there after all.
  • 1:29 - 1:33
    The answer he came up with
    had to do with a type of geometry
  • 1:33 - 1:38
    that did not quite exist yet,
    what he called the Geometry of Position,
  • 1:38 - 1:42
    now known as Graph Theory.
  • 1:42 - 1:43
    Euler's first insight
  • 1:43 - 1:49
    was that the route taken between entering
    an island or a riverbank and leaving it
  • 1:49 - 1:51
    didn't actually matter.
  • 1:51 - 1:54
    Thus, the map could be simplified with
    each of the four landmasses
  • 1:54 - 1:57
    represented as a single point,
  • 1:57 - 1:59
    what we now call a node,
  • 1:59 - 2:04
    with lines, or edges, between them
    to represent the bridges.
  • 2:04 - 2:10
    And this simplified graph allows us
    to easily count the degrees of each node.
  • 2:10 - 2:13
    That's the number of bridges
    each land mass touches.
  • 2:13 - 2:15
    Why do the degrees matter?
  • 2:15 - 2:17
    Well, according to the rules
    of the challenge,
  • 2:17 - 2:21
    once travelers arrive onto a landmass
    by one bridge,
  • 2:21 - 2:24
    they would have to leave it
    via a different bridge.
  • 2:24 - 2:28
    In other words, the bridges leading
    to and from each node on any route
  • 2:28 - 2:31
    must occur in distinct pairs,
  • 2:31 - 2:34
    meaning that the number of bridges
    touching each landmass visited
  • 2:34 - 2:36
    must be even.
  • 2:36 - 2:40
    The only possible exceptions would be
    the locations of the beginning
  • 2:40 - 2:42
    and end of the walk.
  • 2:42 - 2:47
    Looking at the graph, it becomes apparent
    that all four nodes have an odd degree.
  • 2:47 - 2:49
    So no matter which path is chosen,
  • 2:49 - 2:53
    at some point,
    a bridge will have to be crossed twice.
  • 2:53 - 2:58
    Euler used this proof to formulate
    a general theory
  • 2:58 - 3:02
    that applies to all graphs with two
    or more nodes.
  • 3:02 - 3:06
    A Eulerian path
    that visits each edge only once
  • 3:06 - 3:09
    is only possible in one of two scenarios.
  • 3:09 - 3:14
    The first is when there are exactly
    two nodes of odd degree,
  • 3:14 - 3:16
    meaning all the rest are even.
  • 3:16 - 3:20
    There, the starting point is one
    of the odd nodes,
  • 3:20 - 3:22
    and the end point is the other.
  • 3:22 - 3:26
    The second is when all the nodes
    are of even degree.
  • 3:26 - 3:31
    Then, the Eulerian path will start
    and stop in the same location,
  • 3:31 - 3:35
    which also makes it something called
    a Eulerian circuit.
  • 3:35 - 3:38
    So how might you create a Eulerian path
    in Königsberg?
  • 3:38 - 3:39
    It's simple.
  • 3:39 - 3:41
    Just remove any one bridge.
  • 3:41 - 3:46
    And it turns out, history created
    a Eulerian path of its own.
  • 3:46 - 3:50
    During World War II, the Soviet Air Force
    destroyed two of the city's bridges,
  • 3:50 - 3:54
    making a Eulerian path easily possible.
  • 3:54 - 3:57
    Though, to be fair, that probably
    wasn't their intention.
  • 3:57 - 4:01
    These bombings pretty much wiped
    Königsberg off the map,
  • 4:01 - 4:05
    and it was later rebuilt
    as the Russian city of Kaliningrad.
  • 4:05 - 4:09
    So while Königsberg and her seven bridges
    may not be around anymore,
  • 4:09 - 4:13
    they will be remembered throughout
    history by the seemingly trivial riddle
  • 4:13 - 4:18
    which led to the emergence of
    a whole new field of mathematics.
Title:
How the Königsberg bridge problem changed mathematics - Dan Van der Vieren
Description:

View full lesson: http://ed.ted.com/lessons/how-the-konigsberg-bridge-problem-changed-mathematics-dan-van-der-vieren

You’d have a hard time finding the medieval city Königsberg on any modern maps, but one particular quirk in its geography has made it one of the most famous cities in mathematics. Dan Van der Vieren explains how grappling with Königsberg’s puzzling seven bridges led famous mathematician Leonhard Euler to invent a new field of mathematics.

Lesson by Dan Van der Vieren, animation by Artrake Studio.

more » « less
Video Language:
English
Team:
closed TED
Project:
TED-Ed
Duration:
04:39

English subtitles

Revisions Compare revisions