Teacher Notes: There is a famous problem in Discrete Mathematics called ‘The Bridges of Konigsberg’ in which it is said to be impossible to cross each.

Slides:



Advertisements
Similar presentations
The Chinese Postman Problem Route Planning Map Colouring
Advertisements

The 7 Bridges of Konigsberg A puzzle in need of solving.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
AMDM UNIT 7: Networks and Graphs
BY: MIKE BASHAM, Math in Scheduling. The Bridges of Konigsberg.
How to solve Euler paths & circuits. by Mr. King.
The Seven Bridges Of Konigsberg.
Konigsberg Bridge Problem
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Problem of the Day Problem of the Day next Geometry - Connect the Dots
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Representing Graphs Wade Trappe. Lecture Overview Introduction Some Terminology –Paths Adjacency Matrix.
Euler Graphs Section Euler Graphs 2 Circuit? Path? Non- traversable? A D E C B A D E C B A D E C B End at A End at B Start at A Miss an edge.
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
By Dr. C. B. Alphonce (Room305 Mathematics Building) MT 147: DISCRETE MATHEMATICS (3 Units) CORE for B. SC. In COMPUTER SCIENCE.
Graphs and Euler cycles Let Maths take you Further…
Aberdeen Grammar School
Hexagons & Hexagonal Prisms. Hexagons Hexagons are 6 sided shapes. Hexagons can be dimensioned in 2 different ways. 1. Across the faces. 2. Across the.
Math for Liberal Studies.  Here is a map of the parking meters in a small neighborhood  Our goal is to start at an intersection, check the meters, and.
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
The Bridge Obsession Problem By Vamshi Krishna Vedam.
Eulerian Circuits. A Warm Up Problem Jenny & John were at a Math Circles event with three other couples. As people arrived, various handshakes took place.
Can you find a way to cross every bridge only once?
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Using cartoons to draw similar figures
Graph Theory Topics to be covered:
1 Starter of the day 23 x 27 = x 47 = x 87 = x 55 = x 58 = ???? 54 x 56 = ???? Can you spot the trick for this group of.
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
Lesson Reflection for Chapter 14 Section 6 Pre-Algebra Learning Goal Students will understand collecting, displaying, & analyzing data.
One Point Perspective Design and Technology. One Point Perspective Task 3 Here are some high quality examples of what we are aiming to produce by the.
5.4 Graph Models (part I – simple graphs). Graph is the tool for describing real-life situation. The process of using mathematical concept to solve real-life.
Freehand Two Point Perspective Drawing Abilities Teacher © J Lewis 2004.
Examples Euler Circuit Problems Unicursal Drawings Graph Theory
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Discrete Mathematical Structures: Theory and Applications
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
Associated Matrices of Vertex Edge Graphs Euler Paths and Circuits Block Days April 30, May 1 and May
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
SECTION 5.1: Euler Circuit Problems
Chapter 6: Graphs 6.1 Euler Circuits
Aim: Graph Theory – Paths & Circuits Course: Math Literacy Do Now: Aim: What are Circuits and Paths? Can you draw this figure without retracing any of.
Hexagons & Hexagonal Prisms.
Konisberg Bridges (One-way street) SOL: DM.2 Classwork Quiz/worksheet Homework (day 62) worksheet.
Graph Theory Two Applications D.N. Seppala-Holtzman St. Joseph ’ s College.
Graph Theory Euler Paths and Euler Circuits. Euler Paths & Circuits Euler Paths and Euler Circuits (Euler is pronounced the same as Oiler) An Euler path.
STARTER: CAN YOU FIND A WAY OF CROSSING ALL THE BRIDGES EXACTLY ONCE? Here’s what this question would look like drawn as a graph.
Konisberg Bridges (One-way street) SOL: DM.2
2-POINT PERSPECTIVE. Exercise: Follow the next steps in order to create a box in a 2-point perspective.
Section 10.2 Triangles Math in Our World. Learning Objectives  Identify types of triangles.  Find one missing angle in a triangle.  Use the Pythagorean.
Chinese Postman Problem
Excursions in Modern Mathematics Sixth Edition
Çizge Algoritmaları.
Freehand Two Point Perspective
Konigsberg’s Seven Bridges
Addition Grids.
Drawing an irrational length line
Euler Paths and Circuits
Nuffield Free-Standing Mathematics Activity
Multiplication Grids.
Decision Maths Graphs.
Make Ten Example: Name: ______________________
Euler and Hamilton Paths
Subtraction Grids.
Section 14.1 Graphs, Paths, and Circuits
5 The Mathematics of Getting Around
Presentation transcript:

Teacher Notes: There is a famous problem in Discrete Mathematics called ‘The Bridges of Konigsberg’ in which it is said to be impossible to cross each bridge in the town of Konigsberg, in Russia, once and only once if you wish to return to your start point (you may start anywhere). This problem is mathematically very similar to the problem of trying to draw a shape without taking your pen of the page and without retracing any line you have already drawn.

Don’t take your pen off the page! Draw the diagram of the envelope below without going over the same line twice and without taking your pen off the paper. To show that you have done it you must show your starting and finishing points clearly and mark out your route. A

Answers: It is possible to do if you start at any corner (vertex) that has an ODD number of lines touching it (i.e. you must start at the bottom right or bottom left hand corner). You will always finish at the other ‘odd vertex’.

Don’t take your pen off the page! Draw the diagram of Pythagoras’ Theorem below without going over the same line twice and without taking your pen off the paper. To show that you have done it you must show your starting and finishing points clearly and mark out your route. B

Answers: The only ‘vertices’ with an odd number of ‘edges’ (lines) coming from them are shown in red here: So, providing you start at one of those two ‘vertices’, you will finish at the other one.

Don’t take your pen off the page! Draw the diagram of the ‘Star of David’ below without going over the same line twice and without taking your pen off the paper. To show that you have done it you must show your starting and finishing points clearly and mark out your route. C

Answers: Because this ‘Star of David’ doesn’t have any ‘odd vertices’ you can start and finish anywhere – it’s easy! (Or easier anyway). Incidentally, if you have any picture with more than two ‘odd vertices’ it is impossible to draw without taking your pen of or retracing your steps (hence walking the bridges of Konigsberg is impossible unless you retrace your steps or teleport from one section to another!)