Chapter 1: Urban Services Lesson Plan
|
|
- Mitchell Chapman
- 7 years ago
- Views:
Transcription
1 Lesson Plan For All Practical Purposes Euler Circuits Parking-Control Officer Problem Finding Euler Circuits Qualifications: Even Valence and Connectedness Beyond Euler Circuits Chinese Postman Problem Eulerizing a Graph Urban Graph Traversal Problems More practical applications and modifications Mathematical Literacy in Today s World, 9th ed W. H. Freeman and Company
2 Management Science Management Science Uses mathematical methods to help find optimal solutions to management problems. Often called Operations Research. Optimal Solutions: The best (most favorable) solution Government, business, and individuals all seek optimal results. Optimization problems: Finish a job quickly Maximize profits Minimize costs Urban Services to optimize: Checking parking meters Delivering mail Removing snow
3 Euler Circuits Parking-Control Officer Problem Checking parking meters Our job is to find the most efficient route for the parking-control officer to walk as he checks the parking meters. Problem: Check the meters on the top two blocks. Goals for Parking-Control Officer Must cover all the sidewalks without retracing any more steps than necessary. Should end at the same point at which he began. Problem: Start and end at the top lefthand corner of the left-hand block. Street map for part of a town. Euler circuit A circuit that traverses each edge of a graph exactly once and starts and stops at the same point.
4 Euler Circuits Simplified graph (b) is enlarged to show the points (vertices) labeled with letters A F, which are linked by edges. Simplified graph (a) is superimposed on the streets with parking meters. Graph A finite set of dots (vertices) and connecting links (edges). Graphs can represent our city map, air routes, etc. Vertex (pl. vertices) A point (dot) in a graph where the edges meet. Edge A link that joins two vertices in a graph (traverse edges). Path A connected sequence of edges showing a route, described by naming the vertices traveled. Circuit A path that starts and ends at the same vertex.
5 Euler Circuits Path vs. Circuit Paths Paths can start and end at any vertex using the edges given. Examples: NLB, NMRB, etc. Circuits Paths that starts and ends at the same vertex. Examples: MRLM, LRBL, etc. Nonstop air routes Circuit vs. Euler Circuit (Both start and end at same vertex.) Circuits may retrace edges or not use all the edges. Euler circuits travel each edge once and cover all edges.
6 Finding Euler Circuits Two Ways to Find an Euler Circuit Trial and error Keep trying to create different paths to find one that starts and ends at the same point and does not retrace steps. Mathematical approach (better method) An Euler circuit exists if the following statements are true: All points (vertices) have even valence. The graph is connected. Leonhard Euler ( ) Among other discoveries, he was credited with inventing the idea of a graph as well as the concepts of valence and connectedness.
7 Finding Euler Circuits Valence The number of edges touching that vertex (counting spokes on the hub of a wheel). Connectedness You can reach any vertex by traversing the edges given in the graph. Euler circuit Has even-valent vertices and is connected. If vertices have odd valence, it is not an Euler circuit. Euler Circuit Theorem 1. If a graph G is connected and has all even valences, then G has an Euler circuit. 2. Conversely, if G has an Euler circuit, then G must be connected and all of its valences must be even numbers. An Euler circuit starting and ending at A
8 Finding Euler Circuits Is there an Euler Circuit? Does it have even valence? (Yes) Is the graph connected? (Yes) Euler circuit exists if both yes. Create (Find) an Euler Circuit Pick a point to start (if none has been given to you). Number the edges in order of travel, showing the direction with arrows. Cover every edge only once, and end at the same vertex where you started.
9 Beyond Euler Circuits Chinese Postman Problem In real life, not all problems will be perfect Euler circuits. If no Euler circuit exists (odd valences), you want to minimize the length of the circuit by carefully choosing the edges to be retraced. For our purposes, we assume all edges have the same length simplified Chinese postman problem. Chinese mathematician Meigu Guan first studied this problem in 1962, hence the name. The blue dots indicate parking meters along the street. The graph represents edges with parking meters. Notice only vertices C and G have odd valence.
10 Beyond Euler Circuits Eulerize the Graph to Solve Chinese Postman Problem For graphs that are connected but have vertices with odd valence, we will want to reuse (duplicate) the minimum number of edges until all vertices appear to have even valence. Only existing edges can be duplicated (or added). Each edge that is duplicated (added) will later be the edge that will be reused during eulerization. The edge CG is reused, which would make all vertices appear to have even valence. A circuit is made by reusing the edge CG. Below, the graph is eulerized (starts and stops at same point and covers all edges once including reused ones).
11 Beyond Euler Circuits Eulerizing a Graph 1. On the graph, add edges by duplicating existing ones, until you arrive at a graph that is connected and even-valent. The graph to the right is an efficient eulerization because the fewest number of edges were added. 2. Find an Euler circuit on the eulerized graph. Traverse every original and added edge once, as you find a circuit that starts and ends at the same vertex. 3. Squeeze this Euler circuit from the eulerized graph onto the original graph by replacing the added edge with an arrow showing it was retraced. Only reuse (add) edge BC. Squeeze the eulerized circuit onto the graph.
12 Beyond Euler Circuits Hints for Eulerizing a Graph For the most efficient eulerization, look for the fewest edges to add to make all vertices even. Typically, locate odd valence vertices and try to reuse (add) the connecting edge between the vertices. Sometimes vertices are more than one edge apart; in this case, reuse edges between vertices (see graph below). Remember: Only duplicate (add to) the existing edges. Odd vertices, X and Y, are more than one edge apart. This is not allowed must only reuse existing edges. Reuse existing edges between the odd vertices.
13 Beyond Euler Circuits Rectangular Networks This is the name given to a street network composed of a series of rectangular blocks that form a large rectangle made up of so many blocks high by so many blocks wide. Eulerizing rectangular networks: Edge Walker Start in upper-left corner (at A). Travel (clockwise) around the outer boundary. As you travel, add an edge by the following rules: 1. If the vertex is odd, add an edge by linking it to the next vertex. If this next vertex becomes even, skip it (just keep walking ). If this next vertex becomes odd, (on a corner) link it to the next vertex. 2. Repeat this rule until you reach the upper-left corner again.
14 Urban Graph Traversal Problem Euler Circuits and Eulerizing Graphs: Practical Applications Checking parking meters (discussed) Collecting garbage Salting icy roads Inspecting railroad tracks Special Requirements May Need to Be Addressed Traffic directions Number of streets/lanes (divided routes) Parking time restriction Theory Modifications Can Address Special Requirements A digraph (directed graph) is used to show a one-way street. Arrows show restriction in traversal possibilities (not part of circuits). Territories may need to be divided into multiple routes.
Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh
Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh Graph Theory: Graph theory can be defined as the study of graphs; Graphs are mathematical structures used to model pair-wise relations between
More informationNetworks and Paths. The study of networks in mathematics began in the middle 1700 s with a famous puzzle called the Seven Bridges of Konigsburg.
ame: Day: etworks and Paths Try This: For each figure,, and, draw a path that traces every line and curve exactly once, without lifting your pencil.... Figures,, and above are examples of ETWORKS. network
More informationChapter 6: Graph Theory
Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.
More informationChinese postman problem
PTR hinese postman problem Learning objectives fter studying this chapter, you should be able to: understand the hinese postman problem apply an algorithm to solve the problem understand the importance
More informationGraph Theory Techniques in Model-Based Testing
Presented at the 1999 International Conference on Testing Computer Software Graph Theory Techniques in Model-Based Testing Harry Robinson Semantic Platforms Test Group Microsoft Corporation harryr@microsoft.com
More informationLesson #13 Congruence, Symmetry and Transformations: Translations, Reflections, and Rotations
Math Buddies -Grade 4 13-1 Lesson #13 Congruence, Symmetry and Transformations: Translations, Reflections, and Rotations Goal: Identify congruent and noncongruent figures Recognize the congruence of plane
More informationEuler Paths and Euler Circuits
Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationSOME APPLICATIONS OF EULERIAN GRAPHS
Sutra: International Journal of Mathematical Science Education Technomathematics Research Foundation Vol. 2, No. 2, 1 10, 2009 SOME APPLICATIONS OF EULERIAN GRAPHS Abdul Samad Ismail, Roslan Hasni and
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More informationS on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =
Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More information. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9
Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More information3.1 Solving Systems Using Tables and Graphs
Algebra 2 Chapter 3 3.1 Solve Systems Using Tables & Graphs 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationA permutation can also be represented by describing its cycles. What do you suppose is meant by this?
Shuffling, Cycles, and Matrices Warm up problem. Eight people stand in a line. From left to right their positions are numbered,,,... 8. The eight people then change places according to THE RULE which directs
More informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
More informationGrade 7/8 Math Circles November 3/4, 2015. M.C. Escher and Tessellations
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Tiling the Plane Grade 7/8 Math Circles November 3/4, 2015 M.C. Escher and Tessellations Do the following
More informationSPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM
SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationMATH 13150: Freshman Seminar Unit 10
MATH 13150: Freshman Seminar Unit 10 1. Relatively prime numbers and Euler s function In this chapter, we are going to discuss when two numbers are relatively prime, and learn how to count the numbers
More informationMA107 Precalculus Algebra Exam 2 Review Solutions
MA107 Precalculus Algebra Exam 2 Review Solutions February 24, 2008 1. The following demand equation models the number of units sold, x, of a product as a function of price, p. x = 4p + 200 a. Please write
More informationALGEBRA. Find the nth term, justifying its form by referring to the context in which it was generated
ALGEBRA Pupils should be taught to: Find the nth term, justifying its form by referring to the context in which it was generated As outcomes, Year 7 pupils should, for example: Generate sequences from
More informationEdExcel Decision Mathematics 1
EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation
More informationMicrosoft PowerPoint 2010 Computer Jeopardy Tutorial
Microsoft PowerPoint 2010 Computer Jeopardy Tutorial 1. Open up Microsoft PowerPoint 2010. 2. Before you begin, save your file to your H drive. Click File > Save As. Under the header that says Organize
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationEuler, Mei-Ko Kwan, Königsberg, and a Chinese Postman
Documenta Math. 43 Euler, Mei-Ko Kwan, Königsberg, and a Chinese Postman Martin Grötschel and Ya-xiang Yuan 2010 Mathematics Subject Classification: 00-02, 01A05, 05C38, 90-03 Keywords and Phrases: Eulerian
More informationMD5-26 Stacking Blocks Pages 115 116
MD5-26 Stacking Blocks Pages 115 116 STANDARDS 5.MD.C.4 Goals Students will find the number of cubes in a rectangular stack and develop the formula length width height for the number of cubes in a stack.
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More informationChapter 11 Number Theory
Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications
More informationDecision Mathematics D1. Advanced/Advanced Subsidiary. Friday 12 January 2007 Morning Time: 1 hour 30 minutes. D1 answer book
Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Friday 12 January 2007 Morning Time: 1 hour 30 minutes Materials required for examination Nil Items included
More informationYear 9 mathematics test
Ma KEY STAGE 3 Year 9 mathematics test Tier 6 8 Paper 1 Calculator not allowed First name Last name Class Date Please read this page, but do not open your booklet until your teacher tells you to start.
More informationGrade 1 Geometric Shapes Conceptual Lessons Unit Outline Type of Knowledge & SBAC Claim Prerequisite Knowledge:
Grade 1 Geometric Shapes Conceptual Lessons Unit Outline Type of Knowledge & SBAC Claim Prerequisite Knowledge: Standards: Lesson Title and Objective/Description Shape names: square, rectangle, triangle,
More informationMATHEMATICS. Y5 Multiplication and Division 5330 Square numbers, prime numbers, factors and multiples. Equipment. MathSphere
MATHEMATICS Y5 Multiplication and Division 5330 Square numbers, prime numbers, factors and multiples Paper, pencil, ruler. Equipment MathSphere 5330 Square numbers, prime numbers, factors and multiples
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationThe Walters Art Museum. Mathematics STAINED GLASS DRAWING
The Walters Art Museum Mathematics STAINED GLASS DRAWING ACTIVITY GUIDE [ STAINED GLASS DRAWING ] Creating a stained glass panel takes great care and planning. You use drawing and artistic talents as well
More informationScheduling. Getting Started. Scheduling 79
Scheduling 9 Scheduling An event planner has to juggle many workers completing different tasks, some of which must be completed before others can begin. For example, the banquet tables would need to be
More informationG3-33 Building Pyramids
G3-33 Building Pyramids Goal: Students will build skeletons of pyramids and describe properties of pyramids. Prior Knowledge Required: Polygons: triangles, quadrilaterals, pentagons, hexagons Vocabulary:
More information3. Eulerian and Hamiltonian Graphs
3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from
More informationParallel and Perpendicular. We show a small box in one of the angles to show that the lines are perpendicular.
CONDENSED L E S S O N. Parallel and Perpendicular In this lesson you will learn the meaning of parallel and perpendicular discover how the slopes of parallel and perpendicular lines are related use slopes
More informationUsing Excel to find Perimeter, Area & Volume
Using Excel to find Perimeter, Area & Volume Level: LBS 4 V = lwh Goal: To become familiar with Microsoft Excel by entering formulas into a spreadsheet in order to calculate the perimeter, area and volume
More information2. More Use of the Mouse in Windows 7
65 2. More Use of the Mouse in Windows 7 The mouse has become an essential part of the computer. But it is actually a relatively new addition. The mouse did not become a standard part of the PC until Windows
More informationOn planar regular graphs degree three without Hamiltonian cycles 1
On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.
More informationKristen Kachurek. Circumference, Perimeter, and Area Grades 7-10 5 Day lesson plan. Technology and Manipulatives used:
Kristen Kachurek Circumference, Perimeter, and Area Grades 7-10 5 Day lesson plan Technology and Manipulatives used: TI-83 Plus calculator Area Form application (for TI-83 Plus calculator) Login application
More informationPatterns in Pascal s Triangle
Pascal s Triangle Pascal s Triangle is an infinite triangular array of numbers beginning with a at the top. Pascal s Triangle can be constructed starting with just the on the top by following one easy
More information1 Error in Euler s Method
1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of
More informationHiker. A hiker sets off at 10am and walks at a steady speed for 2 hours due north, then turns and walks for a further 5 hours due west.
Hiker A hiker sets off at 10am and walks at a steady speed for hours due north, then turns and walks for a further 5 hours due west. If he continues at the same speed, what s the earliest time he could
More informationLesson Plans. Isaiah A.J. Walters Designer Educator
Lesson Plans Isaiah A.J. Walters Designer Educator Symmetry Activity Centre #1 Complete the Photograph Materials: Magazine Picture Glue Stick Pencils and Pencil Crayons Scissors Blank Paper Instructions:
More informationCMPSCI611: Approximating MAX-CUT Lecture 20
CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to
More informationSolving Quadratic Equations
9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation
More informationLesson 3.1 Factors and Multiples of Whole Numbers Exercises (pages 140 141)
Lesson 3.1 Factors and Multiples of Whole Numbers Exercises (pages 140 141) A 3. Multiply each number by 1, 2, 3, 4, 5, and 6. a) 6 1 = 6 6 2 = 12 6 3 = 18 6 4 = 24 6 5 = 30 6 6 = 36 So, the first 6 multiples
More informationCOUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
More informationDownloading Your Financial Statements to Excel
Downloading Your Financial Statements to Excel Downloading Data from CU*BASE to PC INTRODUCTION How can I get my favorite financial statement from CU*BASE into my Excel worksheet? How can I get this data
More informationThis puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children.
0.1 Friend Trends This puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children. In the 1950s, a Hungarian sociologist S. Szalai
More informationData Visualization. Prepared by Francisco Olivera, Ph.D., Srikanth Koka Department of Civil Engineering Texas A&M University February 2004
Data Visualization Prepared by Francisco Olivera, Ph.D., Srikanth Koka Department of Civil Engineering Texas A&M University February 2004 Contents Brief Overview of ArcMap Goals of the Exercise Computer
More informationUniversality in the theory of algorithms and computer science
Universality in the theory of algorithms and computer science Alexander Shen Computational models The notion of computable function was introduced in 1930ies. Simplifying (a rather interesting and puzzling)
More informationSolving the Rubik's Revenge (4x4x4) Home Pre-Solution Stuff Step 1 Step 2 Step 3 Solution Moves Lists
Solving your Rubik's Revenge (4x4x4) 07/16/2007 12:59 AM Solving the Rubik's Revenge (4x4x4) Home Pre-Solution Stuff Step 1 Step 2 Step 3 Solution Moves Lists Turn this... Into THIS! To solve the Rubik's
More informationBasic Lesson: Pythagorean Theorem
Basic Lesson: Pythagorean Theorem Basic skill One leg of a triangle is 10 cm and other leg is of 24 cm. Find out the hypotenuse? Here we have AB = 10 and BC = 24 Using the Pythagorean Theorem AC 2 = AB
More informationUnit #3: Investigating Quadratics (9 days + 1 jazz day + 1 summative evaluation day) BIG Ideas:
Unit #3: Investigating Quadratics (9 days + 1 jazz day + 1 summative evaluation day) BIG Ideas: Developing strategies for determining the zeroes of quadratic functions Making connections between the meaning
More informationFreight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry
Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry Xiangshang Tong, Ph.D. Menlo Worldwide Logistics Kimberly Ellis, Ph.D. Virginia Tech Amy Brown Greer
More informationKenken For Teachers. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 27, 2010. Abstract
Kenken For Teachers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles June 7, 00 Abstract Kenken is a puzzle whose solution requires a combination of logic and simple arithmetic skills.
More informationSum of Degrees of Vertices Theorem
Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2
More informationPhysics 41, Winter 1998 Lab 1 - The Current Balance. Theory
Physics 41, Winter 1998 Lab 1 - The Current Balance Theory Consider a point at a perpendicular distance d from a long straight wire carrying a current I as shown in figure 1. If the wire is very long compared
More informationGraph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902
Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties
More informationIf you know exactly how you want your business forms to look and don t mind
appendix e Advanced Form Customization If you know exactly how you want your business forms to look and don t mind detail work, you can configure QuickBooks forms however you want. With QuickBooks Layout
More informationLesson 26: Reflection & Mirror Diagrams
Lesson 26: Reflection & Mirror Diagrams The Law of Reflection There is nothing really mysterious about reflection, but some people try to make it more difficult than it really is. All EMR will reflect
More informationPetrel TIPS&TRICKS from SCM
Petrel TIPS&TRICKS from SCM Knowledge Worth Sharing Building Montages in Petrel Most Petrel projects require display maps to be made for presentations; either for partners or peers. This TIPS&TRICKS provides
More informationReal World Performance Tasks
Real World Performance Tasks Real World Real Life, Real Data, Real- Time - These activities put students into real life scenarios where they use real- time, real data to solve problems. In the Seriously
More informationAll V7 registers support barcode printing, except the Sharp 410/420 1A ROM and that limitation is based upon the register.
Tools Section Barcode Printing These are basic instructions for Version 7 Polling barcode printing. Users will need to have a PLU/UPC file containing either UPC-A, UPC-E, EAN 13 or EAN 8 numbers, label
More informationPrime Factorization 0.1. Overcoming Math Anxiety
0.1 Prime Factorization 0.1 OBJECTIVES 1. Find the factors of a natural number 2. Determine whether a number is prime, composite, or neither 3. Find the prime factorization for a number 4. Find the GCF
More informationOutline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationCircuit diagrams and symbols (1)
Circuit diagrams and symbols (1) Name: Circuit Symbols We remember how we put the circuits together by using a diagram or drawing a sketch. In order to save time and ensure that sketches are accurate,
More informationMATHEMATICS Unit Decision 1
General Certificate of Education January 2008 Advanced Subsidiary Examination MATHEMATICS Unit Decision 1 MD01 Tuesday 15 January 2008 9.00 am to 10.30 am For this paper you must have: an 8-page answer
More informationDecision Mathematics D1 Advanced/Advanced Subsidiary. Tuesday 5 June 2007 Afternoon Time: 1 hour 30 minutes
Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Tuesday 5 June 2007 Afternoon Time: 1 hour 30 minutes Materials required for examination Nil Items included with
More informationCS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
More informationFREE FALL. Introduction. Reference Young and Freedman, University Physics, 12 th Edition: Chapter 2, section 2.5
Physics 161 FREE FALL Introduction This experiment is designed to study the motion of an object that is accelerated by the force of gravity. It also serves as an introduction to the data analysis capabilities
More informationGeoGebra. 10 lessons. Gerrit Stols
GeoGebra in 10 lessons Gerrit Stols Acknowledgements GeoGebra is dynamic mathematics open source (free) software for learning and teaching mathematics in schools. It was developed by Markus Hohenwarter
More informationGeometry and Measurement
The student will be able to: Geometry and Measurement 1. Demonstrate an understanding of the principles of geometry and measurement and operations using measurements Use the US system of measurement for
More informationThe Triangle and its Properties
THE TRINGLE ND ITS PROPERTIES 113 The Triangle and its Properties Chapter 6 6.1 INTRODUCTION triangle, you have seen, is a simple closed curve made of three line segments. It has three vertices, three
More informationThe Taxman Game. Robert K. Moniot September 5, 2003
The Taxman Game Robert K. Moniot September 5, 2003 1 Introduction Want to know how to beat the taxman? Legally, that is? Read on, and we will explore this cute little mathematical game. The taxman game
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationA GUIDE TO PROCESS MAPPING AND IMPROVEMENT
A GUIDE TO PROCESS MAPPING AND IMPROVEMENT Prepared by the CPS Activity Based Costing Team December 2012 CONTENTS 1. Introduction Page 3 2. What is process mapping? Page 4 3. Why process map? Page 4 4.
More informationLESSON 7: IMPORTING AND VECTORIZING A BITMAP IMAGE
LESSON 7: IMPORTING AND VECTORIZING A BITMAP IMAGE In this lesson we ll learn how to import a bitmap logo, transform it into a vector and perform some editing on the vector to clean it up. The concepts
More informationArea and Perimeter: The Mysterious Connection TEACHER EDITION
Area and Perimeter: The Mysterious Connection TEACHER EDITION (TC-0) In these problems you will be working on understanding the relationship between area and perimeter. Pay special attention to any patterns
More informationLesson 1.1 Building Blocks of Geometry
Lesson 1.1 Building Blocks of Geometry For Exercises 1 7, complete each statement. S 3 cm. 1. The midpoint of Q is. N S Q 2. NQ. 3. nother name for NS is. 4. S is the of SQ. 5. is the midpoint of. 6. NS.
More informationUnit 7 Quadratic Relations of the Form y = ax 2 + bx + c
Unit 7 Quadratic Relations of the Form y = ax 2 + bx + c Lesson Outline BIG PICTURE Students will: manipulate algebraic expressions, as needed to understand quadratic relations; identify characteristics
More informationCaesar Ciphers: An Introduction to Cryptography
Purdue GK-12 Lesson Plan 2006-07 Caesar Ciphers: An Introduction to Cryptography Purdue University GK-12 2006-07 Lead developer and contact: Lance Bryant Purdue GK-12 Fellow LBRYANT@MATH.PURDUE.EDU Co-author
More informationAcquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours
Acquisition Lesson Planning Form Key Standards addressed in this Lesson: MM2A3d,e Time allotted for this Lesson: 4 Hours Essential Question: LESSON 4 FINITE ARITHMETIC SERIES AND RELATIONSHIP TO QUADRATIC
More informationPOLYNOMIAL FUNCTIONS
POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a
More informationCircuits 1 M H Miller
Introduction to Graph Theory Introduction These notes are primarily a digression to provide general background remarks. The subject is an efficient procedure for the determination of voltages and currents
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationTest A. Calculator not allowed. Mathematics test. First name. Last name. School. DfE no. KEY STAGE LEVELS
Ma KEY STAGE 2 LEVELS 3 5 Mathematics test Test A Calculator not allowed First name Last name School DfE no. 2011 For marker s use only Page 5 7 9 11 13 15 17 19 21 23 TOTAL Marks These three children
More informationMATHEMATICS TEST. Paper 1 calculator not allowed LEVEL 6 TESTS ANSWER BOOKLET. First name. Middle name. Last name. Date of birth Day Month Year
LEVEL 6 TESTS ANSWER BOOKLET Ma MATHEMATICS TEST LEVEL 6 TESTS Paper 1 calculator not allowed First name Middle name Last name Date of birth Day Month Year Please circle one Boy Girl Year group School
More informationMATH STUDENT BOOK. 8th Grade Unit 6
MATH STUDENT BOOK 8th Grade Unit 6 Unit 6 Measurement Math 806 Measurement Introduction 3 1. Angle Measures and Circles 5 Classify and Measure Angles 5 Perpendicular and Parallel Lines, Part 1 12 Perpendicular
More informationFun with Fractions: A Unit on Developing the Set Model: Unit Overview www.illuminations.nctm.org
Fun with Fractions: A Unit on Developing the Set Model: Unit Overview www.illuminations.nctm.org Number of Lessons: 7 Grades: 3-5 Number & Operations In this unit plan, students explore relationships among
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
More information