The Beginnings of Topology...

A Math Forum Project

Table of Contents:

Famous Problems Home

The Bridges of Konigsberg
· Euler's Solution
· Solution, problem 1
· Solution, problem 2
· Solution, problem 4
· Solution, problem 5

The Value of Pi
· A Chronological Table of Values
· Squaring the Circle

Prime Numbers
· Finding Prime Numbers

Famous Paradoxes
· Zeno's Paradox
· Cantor's Infinities
· Cantor's Infinities, Page 2

The Problem of Points
· Pascal's Generalization
· Summary and Problems
· Solution, Problem 1
· Solution, Problem 2

Proof of the Pythagorean Theorem

Proof that e is Irrational

Book Reviews



Topology is one of the newest branches of mathematics. A simple way to describe topology is as a 'rubber sheet geometry' - topologists study those properties of shapes that remain the same when the shapes are stretched or compressed. The 'Euler number' of a 'network' like the ones presented later in this discussion is an example of a property that does not change when the network is stretched or compressed.

The foundations of topology are often not part of high school math curricula, and thus for many it sounds strange and intimidating. However, there are some readily graspable ideas at the base of topology that are interesting, fun, and highly applicable to all sorts of situations. One of these areas is the topology of networks, first developed by Leonhard Euler in 1735. His work in this field was inspired by the following problem:

The Seven Bridges of Konigsberg

In Konigsberg (modern-day Kaliningrad, Russia), a river ran through the city such that in its center was an island, and after passing the island, the river broke into two parts. Seven bridges were built so that the people of the city could get from one part to another. A crude map of the center of Konigsberg might look like this:

The people wondered whether or not one could walk around the city in a way that would involve crossing each bridge exactly once.

Problem 1
Try it. Sketch the above map of the city on a sheet of paper and try to 'plan your journey' with a pencil in such a way that you trace over each bridge once and only once and you complete the 'plan' with one continuous pencil stroke. Solution

Problem 2
Suppose they had decided to build one fewer bridge in Konigsberg, so that the map looked like this:

Now try to solve the problem. Solution

Problem 3
Does it matter which bridge you take away? What if you add bridges? Come up with some maps on your own, and try to 'plan your journey' for each one.

to the Famous Problems Home Page
to Euler's solution to the problem

[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help 

© 1994- The Math Forum at NCTM. All rights reserved.

August, 1998