Pre-Calculus Matrices
|
|
|
- Clementine Newman
- 5 years ago
- Views:
Transcription
1 Slide 1 / 192
2 Slide 2 / 192 Pre-Calculus Matrices
3 Slide 3 / 192 Table of Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication Solving Systems of Equations using Matrices Finding Determinants of 2x2 & 3x3 Finding the Inverse of 2x2 & 3x3 Representing 2- and 3-variable systems Solving Matrix Equations Circuits
4 Slide 4 / 192 Table of Content Circuits Definition Properties Euler Matrix Powers and Walks Markov Chains
5 Slide 5 / 192 Introduction to Matrices Return to Table of Contents
6 Slide 6 / 192 A matrix is an ordered array. The matrix consists of rows and columns. Columns Rows This matrix has 3 rows and 3 columns, it is said to be 3x3.
7 Slide 7 / 192 What are the dimensions of the following matrices?
8 Slide 8 / How many rows does the following matrix have?
9 Slide 9 / How many columns does the following matrix have?
10 Slide 10 / How many rows does the following matrix have?
11 Slide 11 / How many columns does the following matrix have?
12 Slide 12 / How many rows does the following matrix have?
13 Slide 13 / How many columns does the following matrix have?
14 Slide 14 / 192
15 Slide 15 / 192 How many rows does each matrix have? How many columns?
16 Slide 16 / 192
17 Slide 17 / 192
18 Slide 18 / How many rows does the following matrix have?
19 Slide 19 / How many columns does the following matrix have?
20 Slide 20 / 192 We can find an entry in a certain position of a matrix. To find the number in the third row,fourth column of matrix M write m 3,4
21 Slide 21 / 192
22 Slide 22 / Identify the number in the given position.
23 Slide 23 / Identify the number in the given position.
24 Slide 24 / Identify the number in the given position.
25 Slide 25 / Identify the number in the given position.
26 Slide 26 / 192 Matrix Arithmetic Return to Table of Contents
27 Slide 27 / 192 Scalar Multiplication Return to Table of Contents
28 Slide 28 / 192 A scalar multiple is when a single number is multiplied to the entire matrix. To multiply by a scalar, distribute the number to each entry in the matrix.
29 Try These Slide 29 / 192
30 Slide 30 / 192 Given: find 6A Let B = 6A, find b 1,2
31 15 Find the given element. Slide 31 / 192
32 16 Find the given element. Slide 32 / 192
33 17 Find the given element. Slide 33 / 192
34 18 Find the given element. Slide 34 / 192
35 Slide 35 / 192 Addition Return to Table of Contents
36 Slide 36 / 192
37 Slide 37 / 192 After checking to see addition is possible, add the corresponding elements.
38 Slide 38 / 192
39 Slide 39 / Add the following matrices and find the given element.
40 Slide 40 / Add the following matrices and find the given element.
41 Slide 41 / Add the following matrices and find the given element.
42 Slide 42 / Add the following matrices and find the given element.
43 Slide 43 / 192 Subtraction Return to Table of Contents
44 Slide 44 / 192 To be able to subtract matrices, they must have the same dimensions, like addition. Method 1: Subtract corresponding elements. Method 2: Change to addition with a negative scalar. Note: Method 2 adds a step but less likely to have a sign error.
45 Slide 45 / 192
46 Slide 46 / Subtract the following matrices and find the given element.
47 Slide 47 / Subtract the following matrices and find the given element.
48 Slide 48 / Subtract the following matrices and find the given element.
49 Slide 49 / Subtract the following matrices and find the given element.
50 Slide 50 / 192
51 Slide 51 / Perform the following operations on the given matrices and find the given element.
52 Slide 52 / Perform the following operations on the given matrices and find the given element.
53 Slide 53 / Perform the following operations on the given matrices and find the given element.
54 Slide 54 / 192
55 Slide 55 / 192 Multiplication Return to Table of Contents
56 Slide 56 / 192
57 Slide 57 / 192
58 Slide 58 / Can the given matrices be multiplied and if so,what size will the matrix of their product be? A B C D yes, 3x3 yes, 4x4 yes, 3x4 they cannot be multiplied
59 Slide 59 / Can the given matrices be multiplied and if so,what size will the matrix of their product be? A B C D yes, 3x3 yes, 4x4 yes, 3x4 they cannot be multiplied
60 Slide 60 / Can the given matrices be multiplied and if so,what size will the matrix of their product be? A B C D yes, 3x3 yes, 4x4 yes, 3x4 they cannot be multiplied
61 Slide 61 / Can the given matrices be multiplied and if so,what size will the matrix of their product be? A B C D yes, 3x3 yes, 4x4 yes, 3x4 they cannot be multiplied
62 Slide 62 / 192 To multiply matrices, distribute the rows of first to the columns of the second. Add the products.
63 Try These Slide 63 / 192
64 Try These Slide 64 / 192
65 Slide 65 / 192
66 Slide 66 / Perform the following operations on the given matrices and find the given element.
67 Slide 67 / Perform the following operations on the given matrices and find the given element.
68 Slide 68 / Perform the following operations on the given matrices and find the given element.
69 Slide 69 / Perform the following operations on the given matrices and find the given element.
70 Slide 70 / 192 Solving Systems of Equations using Matrices Return to Table of Contents
71 Slide 71 / 192 Finding Determinants of 2x2 & 3x3 Return to Table of Contents
72 Slide 72 / 192 A determinant is a value assigned to a square matrix. This value is used as scale factor for transformations of matrices. The bars for determinant look like absolute value signs but are not.
73 Slide 73 / 192
74 Try These: Slide 74 / 192
75 Slide 75 / Find the determinant of the following:
76 Slide 76 / Find the determinant of the following:
77 Slide 77 / Find the determinant of the following:
78 Slide 78 / Find the determinant of the following:
79 Slide 79 / 192
80 Slide 80 / 192
81 Slide 81 / 192 Eliminate the appropriate row and column in each. Rewrite as 3 2x2 determinants. Solve.
82 Slide 82 / 192 Eliminate the appropriate row and column in each. Rewrite as 3 2x2 determinants. Solve.
83 Slide 83 / 192 Eliminate the appropriate row and column in each. Rewrite as 3 2x2 determinants. Solve.
84 Slide 84 / 192 Begin the expansion by rewriting the determinant 3 times with the first row with the coefficients. Eliminate the appropriate row and column in each. Rewrite as 3 2x2 determinants. Solve.
85 Slide 85 / 192 Begin the expansion by rewriting the determinant 3 times with the first row with the coefficients. Eliminate the appropriate row and column in each. Rewrite as 3 2x2 determinants. Solve.
86 Slide 86 / Find the determinant of the following:
87 Slide 87 / Find the determinant of the following:
88 Slide 88 / Find the determinant of the following:
89 Slide 89 / Find the determinant of the following:
90 Slide 90 / 192 Finding the Inverse of 2x2 & 3x3 Return to Table of Contents
91 Slide 91 / 192 The Identity Matrix ( I ) is a square matrix with 1's on its primary diagonal and 0's as the other elements. 2x2 Identity Matrix: 3x3 Identity Matrix: 4x4 Identity Matrix:
92 Slide 92 / 192 Property of the IdentityMatrix
93 Slide 93 / 192
94 Slide 94 / 192 Note: Not all matrices have an inverse. matrix must be square the determinant of the matrix cannot = 0
95 Slide 95 / 192
96 Slide 96 / 192
97 Find the inverse of matrix A Slide 97 / 192
98 Find the inverse of matrix A Slide 98 / 192
99 Find the inverse of matrix A Slide 99 / 192
100 Find the inverse of matrix A Slide 100 / 192
101 Slide 101 / 192 Inverse of a 3x3 Matrix This technique involves creating an Augmented Matrix to start. Matrix we want the inverse of. Identity Matrix Note: This technique can be done for any size square matrix.
102 Slide 102 / 192 Inverse of a 3x3 Matrix Think of this technique, Row Reduction, as a number puzzle. Goal: Reduce the left hand matrix to the identity matrix. Rules: the entire row stays together, what ever is done to an element of a row is done to the entire row allowed to switch any row with any other row may divide/multiply the entire row by a non-zero number adding/subtracting one entire row from another is permitted Caution: Not all square matrices are invertible, if a row on the left goes to all zeros there is no inverse.
103 Slide 103 / 192
104 Slide 104 / 192
105 Slide 105 / 192 We began with this: We ended with this: Meaning the inverse of is
106 Find the inverse of: Slide 106 / 192
107 Find the inverse of: Slide 107 / 192
108 Slide 108 / 192 Representing 2- and 3- Variable Systems Return to Table of Contents
109 Slide 109 / 192 Solving Matrix Equations Return to Table of Contents
110 Slide 110 / 192
111 Slide 111 / 192
112 Slide 112 / 192
113 Slide 113 / 192
114 Slide 114 / 192 Rewrite each system as a product of matrices.
115 Find x and y Slide 115 / 192
116 Find x and y Slide 116 / 192
117 Slide 117 / Is this system ready to be made into a matrix equation? Yes No
118 Slide 118 / Which of the following is the correct matrix equation for the system? A C B D
119 Slide 119 / What is the determinant of: A -17 B -13 C 13 D 17
120 Slide 120 / What is the inverse of: A B C D
121 51 Find the solution to What is the x-value? Slide 121 / 192
122 52 Find the solution to What is the y-value? Slide 122 / 192
123 Slide 123 / Is this system ready to be made into a matrix equation? Yes No
124 Slide 124 / Which of the following is the correct matrix equation for the system? A C B D
125 Slide 125 / What is the determinant of: A -10 B -2 C 2 D 10
126 Slide 126 / What is the inverse of: A B C D
127 57 Find the solution to What is the x-value? Slide 127 / 192
128 58 Find the solution to What is the y-value? Slide 128 / 192
129 Slide 129 / 192 For systems of equations with 3 or more variables, create an augmented matrices with the coefficients on one side and the constants on the other. Row reduce. When the identity matrix is on the left, the solutions are on the right.
130 Slide 130 / 192 Start Swapped row 2 and 3 (rather divide by 3 than 7) Swap Rows 1&2 Divide row 2 by -3 Subtract 5 times row 1 from row 2 Subtract row 1 from row 2 Add 7 times row 2 to row 3 Subtract 2 times row 2 from row 1
131 Slide 131 / 192 From Previous slide Divide row 3 by -37/3 Subtract 2/3 times row 3 from row 2 Subtract 5/3 times row 3 from row 1 The solution to the system is x = 1, y = 1, and z = 2.
132 Slide 132 / 192 Convert the system to an augmented matrice. Solve using row reduction
133 Slide 133 / 192 Convert the system to an augmented matrice. Solve using row reduction
134 Slide 134 / 192 Convert the system to an augmented matrice. Solve using row reduction
135 Slide 135 / 192 Circuits Return to Table of Contents
136 Slide 136 / 192 Definition Return to Table of Contents
137 Slide 137 / 192 A Graph of a network consists of vertices (points) and edges (edges connect the points) The points marked v are the vertices, or nodes, of the network. The edges are e.
138 Slide 138 / 192
139 Slide 139 / 192 Vocab Adjacent edges share a vertex. Adjacent vertices are connected by an edge. e 5 and e 6 are parallel because they connect the same vertices. A e 1 and e 7 are loops. v 8 is isolated because it is not the endpoint for any edges. A simple graph has no loops and no parallel edges.
140 Slide 140 / 192 Make a simple graph with vertices {a, b, c, d} and as many edges as possible.
141 Slide 141 / Which edge(s) are loops? A e 1 B e 2 C e 3 D e 4 G v 1 H v 2 I v 3 J v 4 E e 5 F e 6
142 Slide 142 / Which edge(s) are parallel? A e 1 B e 2 C e 3 D e 4 G v 1 H v 2 I v 3 J v 4 E e 5 F e 6
143 Slide 143 / Which edge(s) are adjacent to e 4? A e 1 B e 2 C e 3 D e 4 G v 1 H v 2 I v 3 J v 4 E e 5 F e 6
144 Slide 144 / Which vertices are adjacent to v 4? A e 1 B e 2 C e 3 D e 4 G v 1 H v 2 I v 3 J v 4 E e 5 F e 6
145 Slide 145 / Which vertex is isolated? A e 1 B e 2 C e 3 D e 4 G v 1 H v 2 I v 3 J v 4 E e 5 F none
146 Slide 146 / 192 Some graphs will show that an edge can be traversed in only one direction, like one way streets. This is a directed graph.
147 Slide 147 / 192
148 Slide 148 / How many paths are there from v 2 to v 3?
149 65 Which vertex is isolated? Slide 149 / 192
150 Slide 150 / 192 Properties Return to Table of Contents
151 Slide 151 / 192 Complete Graph Every vertex is connected to every other by one edge. So at a meeting with 8 people, each person shook hands with every other person once. The graph shows the handshakes. So all 8 people shook hands 7 times, that would seem like 56 handshakes. But there 28 edges to the graph. Person A shaking with B and B shaking with A is the same handshake.
152 Slide 152 / 192 Complete Graph The number of edges of a complete graph is
153 Slide 153 / The Duggers, who are huggers, had a family reunion. 50 family members attended. How many hugs were exchanged?
154 Slide 154 / 192 Degrees The degree of a vertex is the number edges that have the vertex as an endpoint. Loops count as 2. The degree of a network is the sum of the degrees of the vertices. The degree of the network is twice the number of edges. Why?
155 Slide 155 / What is the degree of A? A C B
156 Slide 156 / What is the degree of B? A C B
157 Slide 157 / What is the degree of C? A C B
158 Slide 158 / What is the degree of the network? A C B
159 Slide 159 / 192 Corollaries: the degree of a network is even a network will have an even number of odd vertices
160 Slide 160 / 192 Can odd number of people at a party shake hands with an odd number of people? Think about the corollaries. An odd number of people means how many vertices? Corollaries: the degree of a network is even a network will have an even number of odd vertices An odd number of handshakes means what is the degree of those verticces?
161 Slide 161 / 192 Euler Return to Table of Contents
162 Slide 162 / 192 Konisberg Bridge Problem Konisberg was a city in East Prussia, built on the banks of the Pregol River. In the middle of the river are 2 islands, connected to each other and the banks by a series of bridges. The Konisberg Bridge Problem asks if it is possible to travel each bridge exactly once and end up back where you started?
163 Slide 163 / 192 In 1736, 19 year old Leonhard Euler, one of the greatest mathematicians of all time, solve the problem. Euler, made a graph of the city with the banks and islands as vertices and the bridges as edges. He then developed rules about traversable graphs.
164 Slide 164 / 192 Traversable A network is traversable if each edge can be traveled travelled exactly once. In this puzzle, you are asked to draw the house,or envelope, without repeating any lines. Determine the degree of each vertex. Traversable networks will have 0 or 2 odd vertices. If there are 2 odd vertices start at one and end at the other.
165 Slide 165 / 192 Euler determined that it was not possible because there are 4 odd vertices.
166 Slide 166 / 192 A walk is a sequence of edges and vertices from a to b. A path is a walk with no edge repeated.(traversable) A circuit is a path that starts and stops at the same vertex. An Euler circuit is a circuit that can start at any vertex.
167 Slide 167 / 192 For a network to be an Euler circuit, every vertex has an even degree.
168 Slide 168 / Which is a walk from v 1 to v 5? A v 1,e 3,v 3,e 4, v 5 B v 1,e 2,v 2,e 3,v 3,e 5,v 4,e 7,v 5 v 3 v 1 e 2 C v 1,e 3,e 2,e 7,v 5 D v 1, e 3,v 3,e 5,v 4,e 7,v 5 e 4 e 3 e 1 e5 v 4 e 7 v 2 v 5 e 8
169 Slide 169 / Is this graph traversable? Yes No v 3 v 1 e 4 e 3 e 1 e5 v 4 v 2 e 7 v 5 e 8
170 Slide 170 / 192 Connected vertices have at least on walk connecting them. v 3 v 1 e 4 e 3 e 1 e5 v 4 v 2 e 7 v 5 e 8 Connected graphs have all connected vertices
171 Slide 171 / 192 For all Polyhedra, Euler's Formula V - E + F = 2 V is the number vertices E is the number of edges F is the number of faces Pentagonal Prism Tetrahedron = =2
172 Slide 172 / 192 Apply Euler's Formula to circuits. Add 1 to faces for the not enclosed region. V=5 E=7 F=3+1 Euler's Formula V - E + F = 2 V is the number vertices E is the number of edges F is the number of faces V=7 E=9 F=3+1
173 Slide 173 / How many 'faces' does this graph have?
174 Slide 174 / How many 'edges' does this graph have?
175 Slide 175 / How many 'vertices' does this graph have?
176 Slide 176 / For this graph, what does V - E + F=?
177 Slide 177 / 192 Matrix Powers and Walks Return to Table of Contents
178 Slide 178 / 192
179 Slide 179 / 192 There are also adjacency matrices for undirected graphs. a 1 a 2 a 4 main diagonal What do the numbers on the main diagonal represent? a 3 What can be said about the halves of adjacency matrix?
180 Slide 180 / 192 The number of walks of length 1 from a 1 to a 3 is 3. a 1 How many walks of length 2 are there from a 1 to a 3? a 2 a 4 By raising the matrix to the power of the desired length walk, the element in the 1st row 3rd column is the answer. a 3 Why does this work? When multiplying, its the 1st row, all the walks length one from a 1, by column 3, all the walks length 1 from a 3.
181 Slide 181 / How many walks of length 2 are there from a 2 to a 4? a 1 a 2 a 4 a 3
182 Slide 182 / How many walks of length 3 are there from a 2 to a 2? a 1 a 2 a 4 a 3
183 Slide 183 / How many walks of length 5 are there from a 1 to a 3? a 1 a 2 a 4 a 3
184 Slide 184 / 192 Markov Chains Return to Table of Contents
185 Slide 185 / 192 During the Super Bowl, it was determined that the commercials could be divided into 3 categories: car, Internet sites, and other. The directed graph below shows the probability that after a commercial aired what the probability for the next type of commercial..10 < C <.40 <.40 < <.40 < <.10 I <.20 < O.50 <
186 Slide 186 / 192 What is the probability that a car commercial follows an Internet commercial?.10 < C <.40 <.40 < <.40 < <.10 I <.20 < O.50 <
187 Slide 187 / 192
188 Slide 188 / < C What will the commercial be 2 commercials after a car ad? Using the properties from walks, square the transition matrix..40 <.40 < < <.40 < <.10 I <.20 < O.50 The first row gives the likelihood of the type of ad following a car ad. <
189 Slide 189 / 192 This method can be applied for any number of ads. But notice what happens to the elements as we get to 10 ads away. This means that no matter what commercial is on, there is an 18% chance that 10 ads from now will be an Internet ad. <
190 Slide 190 / 192 Horse breeders found that the if a champion horse sired an offspring it had 40% of being a champion. If a non-champion horses had offspring, they were 35% likely of being champions. Make a graph and a transition matrix.
191 Slide 191 / Using the transition matrix for champion horse breeding, what is the likelihood of a champion being born in 10 generations?
192 Slide 192 / Using the transition matrix for champion horse breeding, what is the likelihood of a champion being born to non-champions in 2 generations?
Pre-Calculus. Slide 1 / 192. Slide 2 / 192. Slide 3 / 192. Matrices
Slide 1 / 192 Pre-Calculus Slide 2 / 192 Matrices 2015-03-23 www.njctl.org Table of Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication Solving
Pre-Calculus. Introduction to Matrices. Slide 1 / 192 Slide 2 / 192. Slide 3 / 192. Slide 4 / 192. Slide 6 / 192. Slide 5 / 192. Matrices
Slide 1 / 192 Slide 2 / 192 Pre-Calculus Matrices 2015-03-23 www.njctl.org Slide 3 / 192 Content Introduction to Matrices Matrix Arithmetic Scalar Multiplication Addition Subtraction Multiplication Solving
New Jersey Center for Teaching and Learning. Progressive Mathematics Initiative
Slide 1 / 192 New Jersey Center for Teaching and Learning Progressive Mathematics Initiative This material is made freely available at www.njctl.org and is intended for the non-commercial use of students
6.2. Paths and Cycles
6.2. PATHS AND CYCLES 85 6.2. Paths and Cycles 6.2.1. Paths. A path from v 0 to v n of length n is a sequence of n+1 vertices (v k ) and n edges (e k ) of the form v 0, e 1, v 1, e 2, v 2,..., e n, v n,
Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011
Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly
CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ - artale/z
CHAPTER 10 GRAPHS AND TREES Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/z SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions
Matrices. A Matrix (This one has 2 Rows and 3 Columns) To add two matrices: add the numbers in the matching positions:
Matrices A Matrix is an array of numbers: We talk about one matrix, or several matrices. There are many things we can do with them... Adding A Matrix (This one has 2 Rows and 3 Columns) To add two matrices:
CHAPTER 10 GRAPHS AND TREES. Copyright Cengage Learning. All rights reserved.
CHAPTER 10 GRAPHS AND TREES Copyright Cengage Learning. All rights reserved. SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions and
x = 12 x = 12 1x = 16
2.2 - The Inverse of a Matrix We've seen how to add matrices, multiply them by scalars, subtract them, and multiply one matrix by another. The question naturally arises: Can we divide one matrix by another?
08. First and second degree equations
08. First and second degree equations GRAPH THEORY Based on Chris K. Caldwell work: http://primes.utm.edu/cgi-bin/caldwell/tutor/graph/index.html INTRODUCTION Consider the next problem: Old Königsberg
Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around
1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************
Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions
Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.
Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around
1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************
Launch problem: Lining streets
Math 5340 June 15,2012 Dr. Cordero Launch problem: Lining streets Lining Street Problem A Problem on Eulerian Circuits http://www.edmath.org/mattours/discrete/ Your job for the day is to drive slowly around
Junior Circle Meeting 3 Circuits and Paths. April 18, 2010
Junior Circle Meeting 3 Circuits and Paths April 18, 2010 We have talked about insect worlds which consist of cities connected by tunnels. Here is an example of an insect world (Antland) which we saw last
Graphs: Definitions Trails, Paths, and Circuits Matrix Representations Isomorphisms. 11. Graphs and Trees 1. Aaron Tan. 30 October 3 November 2017
11. Graphs and Trees 1 Aaron Tan 30 October 3 November 2017 1 The origins of graph theory are humble, even frivolous. Whereas many branches of mathematics were motivated by fundamental problems of calculation,
Graph Theory CS/Math231 Discrete Mathematics Spring2015
1 Graphs Definition 1 A directed graph (or digraph) G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.
Chapter 11: Graphs and Trees. March 23, 2008
Chapter 11: Graphs and Trees March 23, 2008 Outline 1 11.1 Graphs: An Introduction 2 11.2 Paths and Circuits 3 11.3 Matrix Representations of Graphs 4 11.5 Trees Graphs: Basic Definitions Informally, a
1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
Quadratic Functions. Full Set of Notes. No Solutions
Quadratic Functions Full Set of Notes No Solutions Graphing Quadratic Functions The graph of a quadratic function is called a parabola. Applications of Parabolas: http://www.doe.virginia.gov/div/winchester/jhhs/math/lessons/calc2004/appparab.html
Section 3.4 Basic Results of Graph Theory
1 Basic Results of Graph Theory Section 3.4 Basic Results of Graph Theory Purpose of Section: To formally introduce the symmetric relation of a (undirected) graph. We introduce such topics as Euler Tours,
Introduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow
Introduction to Engineering Systems, ESD.00 Lecture 7 Networks Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow The Bridges of Königsberg The town of Konigsberg in 18 th century
Intermediate Mathematics League of Eastern Massachusetts
Meet # January 010 Intermediate Mathematics League of Eastern Massachusetts Meet # January 010 Category 1 - Mystery Meet #, January 010 1. Of all the number pairs whose sum equals their product, what is
Graph Theory. 26 March Graph Theory 26 March /29
Graph Theory 26 March 2012 Graph Theory 26 March 2012 1/29 Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. However,
Sections 5.2, 5.3. & 5.4
MATH 11008: Graph Theory Terminology Sections 5.2, 5.3. & 5.4 Routing problem: A routing problem is concerned with finding ways to route the delivery of good and/or services to an assortment of destinations.
An Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths
The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and
Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths
The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and
Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7
CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.
To add or subtract, just add or subtract the numbers in the same column and row and place answer accordingly.
Math 3 Variable Manipulation Part 2 Systems with Matrices MATRICES An alternative method to solving system of equations is using Matrices. However, before we can solve systems of equations using matrices,
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
An Introduction to Graph Theory
An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and
11-5 Networks. Königsberg Bridge Problem
Section 11-5 Networks 1 11-5 Networks In the 1700s, the people of Königsberg, Germany (now Kaliningrad in Russia), used to enjoy walking over the bridges of the Pregel River. There were three landmasses
Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study.
Graph Theory Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. However, it wasn t studied too systematically until
3-8 Solving Systems of Equations Using Inverse Matrices. Determine whether each pair of matrices are inverses of each other. 13.
13. Determine whether each pair of matrices are inverses of each other. If K and L are inverses, then. Since, they are not inverses. 15. If P and Q are inverses, then. Since, they are not inverses. esolutions
Vertex-Edge Graphs. Vertex-Edge Graphs In the Georgia Performance Standards. Sarah Holliday Southern Polytechnic State University
Vertex-Edge Graphs Vertex-Edge Graphs In the Georgia Performance Standards Sarah Holliday Southern Polytechnic State University Math III MM3A7. Students will understand and apply matrix representations
of Nebraska - Lincoln
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2008 De Bruijn Cycles Val Adams University of Nebraska
Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 14.1 Graphs, Paths, and Circuits INB Table of Contents Date Topic Page # January 27, 2014 Test #1 14 January 27, 2014 Test # 1 Corrections 15 January 27, 2014 Section 14.1 Examples 16 January 27,
Introduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
Circuits and Paths. April 13, 2014
Circuits and Paths April 13, 2014 Warm Up Problem Quandroland is an insect country that has four cities. Draw all possible ways tunnels can join the cities in Quadroland. (Remember that some cities might
Graphs. Reading Assignment. Mandatory: Chapter 3 Sections 3.1 & 3.2. Peeking into Computer Science. Jalal Kawash 2010
Graphs Mandatory: hapter 3 Sections 3.1 & 3.2 Reading ssignment 2 Graphs bstraction of ata 3 t the end of this section, you will be able to: 1.efine directed and undirected graphs 2.Use graphs to model
Matrix Inverse 2 ( 2) 1 = 2 1 2
Name: Matrix Inverse For Scalars, we have what is called a multiplicative identity. This means that if we have a scalar number, call it r, then r multiplied by the multiplicative identity equals r. Without
Graph Theory. Defining a Graph
Graph Theory This topic is one of the most applicable to real-life applications because all networks (computer, transportation, communication, organizational, etc.) can be represented with a graph. For
Chapter 1: Number and Operations
Chapter 1: Number and Operations 1.1 Order of operations When simplifying algebraic expressions we use the following order: 1. Perform operations within a parenthesis. 2. Evaluate exponents. 3. Multiply
Chapter 5: The Mathematics of Getting Around
Euler Paths and Circuits Chapter 5: The Mathematics of Getting Around 5.1 Street-Routing Problem Our story begins in the 1700s in the medieval town of Königsberg, in Eastern Europe. At the time, Königsberg
Module 2: NETWORKS AND DECISION MATHEMATICS
Further Mathematics 2017 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
MATH 113 Section 9.2: Topology
MATH 113 Section 9.2: Topology Prof. Jonathan Duncan Walla Walla College Winter Quarter, 2007 Outline 1 Introduction to Topology 2 Topology and Childrens Drawings 3 Networks 4 Conclusion Geometric Topology
CHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
Chapter 1. Urban Services. Chapter Outline. Chapter Summary
Chapter 1 Urban Services Chapter Outline Introduction Section 1.1 Euler Circuits Section 1.2 Finding Euler Circuits Section 1.3 Beyond Euler Circuits Section 1.4 Urban Graph Traversal Problems Chapter
Ma/CS 6a Class 8: Eulerian Cycles
Ma/CS 6a Class 8: Eulerian Cycles By Adam Sheffer The Bridges of Königsberg Can we travel the city while crossing every bridge exactly once? 1 How Graph Theory was Born Leonhard Euler 1736 Eulerian Cycle
Catalan Numbers. Table 1: Balanced Parentheses
Catalan Numbers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 00 We begin with a set of problems that will be shown to be completely equivalent. The solution to each problem
Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 14.1 Graphs, Paths, and Circuits What You Will Learn Graphs Paths Circuits Bridges 14.1-2 Definitions A graph is a finite set of points called vertices (singular form is vertex) connected by line
#30: Graph theory May 25, 2009
#30: Graph theory May 25, 2009 Graph theory is the study of graphs. But not the kind of graphs you are used to, like a graph of y = x 2 graph theory graphs are completely different from graphs of functions.
2-9 Operations with Complex Numbers
2-9 Operations with Complex Numbers Warm Up Lesson Presentation Lesson Quiz Algebra 2 Warm Up Express each number in terms of i. 1. 9i 2. Find each complex conjugate. 3. 4. Find each product. 5. 6. Objective
Graphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
1.1 calculator viewing window find roots in your calculator 1.2 functions find domain and range (from a graph) may need to review interval notation
1.1 calculator viewing window find roots in your calculator 1.2 functions find domain and range (from a graph) may need to review interval notation functions vertical line test function notation evaluate
INTRODUCTION TO GRAPH THEORY. 1. Definitions
INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with
Street-Routing Problems
Street-Routing Problems Lecture 26 Sections 5.1-5.2 Robb T. Koether Hampden-Sydney College Wed, Oct 25, 2017 Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, 2017 1 / 21 1
GRAPH THEORY AND COMBINATORICS ( Common to CSE and ISE ) UNIT 1
GRAPH THEORY AND COMBINATORICS ( Common to CSE and ISE ) Sub code : 06CS42 UNIT 1 Introduction to Graph Theory : Definition and Examples Subgraphs Complements, and Graph Isomorphism Vertex Degree, Euler
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
Majority and Friendship Paradoxes
Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the
Euler and Hamilton paths. Jorge A. Cobb The University of Texas at Dallas
Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas 1 Paths and the adjacency matrix The powers of the adjacency matrix A r (with normal, not boolean multiplication) contain the number
Grades 7 & 8, Math Circles 31 October/1/2 November, Graph Theory
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grades 7 & 8, Math Circles 31 October/1/2 November, 2017 Graph Theory Introduction Graph Theory is the
Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III
1 Eulerian Graphs Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III Let s begin this section with a problem that you may remember from lecture 1. Consider the layout of land and water
MTH-129 Review for Test 4 Luczak
MTH-129 Review for Test 4 Luczak 1. On each of three consecutive days the National Weather Service announces that there is a 50-50 chance of rain. Assuming that they are correct, answer the following:
Algebra II Radical Equations
1 Algebra II Radical Equations 2016-04-21 www.njctl.org 2 Table of Contents: Graphing Square Root Functions Working with Square Roots Irrational Roots Adding and Subtracting Radicals Multiplying Radicals
For example, the system. 22 may be represented by the augmented matrix
Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural of matrix) may be
0_PreCNotes17 18.notebook May 16, Chapter 12
Chapter 12 Notes BASIC MATRIX OPERATIONS Matrix (plural: Matrices) an n x m array of elements element a ij Example 1 a 21 = a 13 = Multiply Matrix by a Scalar Distribute scalar to all elements Addition
Solving Systems Using Row Operations 1 Name
The three usual methods of solving a system of equations are graphing, elimination, and substitution. While these methods are excellent, they can be difficult to use when dealing with three or more variables.
Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
Computer Project #2 (Matrix Operations)
Math 0280 Introduction to Matrices and Linear Algebra Fall 2006 Computer Project #2 (Matrix Operations) SCHEDULE: This assignment is due in class on Monday, October 23, 2006. One submission per group is
Prime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
Understand graph terminology Implement graphs using
raphs Understand graph terminology Implement graphs using djacency lists and djacency matrices Perform graph searches Depth first search Breadth first search Perform shortest-path algorithms Disjkstra
Graphs And Algorithms
Graphs nd lgorithms Mandatory: hapter 3 Sections 3.1 & 3.2 Reading ssignment 2 1 Graphs bstraction of ata 3 t the end of this section, you will be able to: 1. efine directed and undirected graphs 2. Use
Slide 1 / 180. Radicals and Rational Exponents
Slide 1 / 180 Radicals and Rational Exponents Slide 2 / 180 Roots and Radicals Table of Contents: Square Roots Intro to Cube Roots n th Roots Irrational Roots Rational Exponents Operations with Radicals
Worksheet for the Final Exam - Part I. Graphs
Worksheet for the Final Exam - Part I. Graphs Date and Time: May 10 2012 Thursday 11:50AM~1:50PM Location: Eng 120 Start with the Self-Test Exercises (pp.816) in Prichard. 1. Give the adjacency matrix
Logic: The Big Picture. Axiomatizing Arithmetic. Tautologies and Valid Arguments. Graphs and Trees
Axiomatizing Arithmetic Logic: The Big Picture Suppose we restrict the domain to the natural numbers, and allow only the standard symbols of arithmetic (+,, =, >, 0, 1). Typical true formulas include:
8th Grade Equations with Roots and Radicals
Slide 1 / 87 Slide 2 / 87 8th Grade Equations with Roots and Radicals 2015-12-17 www.njctl.org Slide 3 / 87 Table of Contents Radical Expressions Containing Variables Click on topic to go to that section.
MA 111 Review for Exam 3
MA 111 Review for Exam 3 Exam 3 (given in class on Tuesday, March 27, 2012) will cover Chapter 5. You should: know what a graph is and how to use graphs to model geographic relationships. know how to describe
Graph Theory: Starting Out
Graph Theory: Starting Out Administrivia To read: Chapter 7, Sections 1-3 (Ensley/Crawley) Problem Set 5 sent out; due Monday 12/8 in class. There will be two review days next week (Wednesday and Friday)
Introduction to Networks
LESSON 1 Introduction to Networks Exploratory Challenge 1 One classic math puzzle is the Seven Bridges of Königsberg problem which laid the foundation for networks and graph theory. In the 18th century
Integrated Math I. IM1.1.3 Understand and use the distributive, associative, and commutative properties.
Standard 1: Number Sense and Computation Students simplify and compare expressions. They use rational exponents and simplify square roots. IM1.1.1 Compare real number expressions. IM1.1.2 Simplify square
STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH
Slide 3.1 3 STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 3.0 Introduction 3.1 Graph Theory 3.2 Strategies for State Space Search 3.3 Using the State Space to Represent Reasoning with the Predicate
Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 The Seven Bridges of Königsberg In
Undirected Network Summary
Undirected Network Summary Notice that the network above has multiple edges joining nodes a to d and the network has a loop at node d. Also c is called an isolated node as it is not connected to any other
Unit 7 Day 2 Section Vocabulary & Graphical Representations Euler Circuits and Paths
Unit 7 Day 2 Section 4.3-4.5 Vocabulary & Graphical Representations Euler Circuits and Paths 1 Warm Up ~ Day 2 List the tasks and earliest start times in a table, as in exercise #1. Determine the minimum
Course Number 432/433 Title Algebra II (A & B) H Grade # of Days 120
Whitman-Hanson Regional High School provides all students with a high- quality education in order to develop reflective, concerned citizens and contributing members of the global community. Course Number
Introduction aux Systèmes Collaboratifs Multi-Agents
M1 EEAII - Découverte de la Recherche (ViRob) Introduction aux Systèmes Collaboratifs Multi-Agents UPJV, Département EEA Fabio MORBIDI Laboratoire MIS Équipe Perception et Robotique E-mail: fabio.morbidi@u-picardie.fr
Crossing bridges. Crossing bridges Great Ideas in Theoretical Computer Science. Lecture 12: Graphs I: The Basics. Königsberg (Prussia)
15-251 Great Ideas in Theoretical Computer Science Lecture 12: Graphs I: The Basics February 22nd, 2018 Crossing bridges Königsberg (Prussia) Now Kaliningrad (Russia) Is there a way to walk through the
The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs
The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs Frankie Smith Nebraska Wesleyan University fsmith@nebrwesleyan.edu May 11, 2015 Abstract We will look at how to represent
Precalculus Notes: Unit 7 Systems of Equations and Matrices
Date: 7.1, 7. Solving Systems of Equations: Graphing, Substitution, Elimination Syllabus Objectives: 8.1 The student will solve a given system of equations or system of inequalities. Solution of a System
20 Calculus and Structures
0 Calculus and Structures CHAPTER FUNCTIONS Calculus and Structures Copright LESSON FUNCTIONS. FUNCTIONS A function f is a relationship between an input and an output and a set of instructions as to how
TWO CONTRIBUTIONS OF EULER
TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention
Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a
Basics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
Assignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
Graph Theory(Due with the Final Exam)
Graph Theory(ue with the Final Exam) Possible Walking Tour.. Is it possible to start someplace(either in a room or outside) and walk through every doorway once and only once? Explain. If it is possible,
Elements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
Table of Contents. Foundations 5p Vocabulary List
Table of Contents Objective 1: Review (Natural Numbers)... 3 Objective 2: Reading and Writing Natural Numbers... 5 Objective 3: Lines: Rays, and Line Segments... 6 Objective 4: Comparing Natural Numbers...