# 6. GRAPH AND MAP COLOURING

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 6. GRPH ND MP COLOURING 6.1. Graph Colouring Imagine the task of designing a school timetable. If we ignore the complications of having to find rooms and teachers for the classes we could propose the following very simple model. We suppose that we have a certain number of subjects taken by a certain number of students. We ll suppose that all subjects require just one class. In setting up the timetable we must ensure that if two subjects have at least one student in common we must allocate different times. So imagine that the subjects are represented by the vertices of a graph and that we have an edge between subjects that have one or more common students. If we colour the vertices in such a way that adjacent vertices have different colours we can arrange for all subjects that were coloured with the same colour to be held at the same time. We could simply colour each vertex with a different colour. This would correspond to timetabling each subject at a different time. But there aren t enough hours in the week and it s important to try to use as few time-slots, or as few colours, as possible. This is one application that would benefit from a solution to the problem of colouring graphs with as few colours as possible. n n-colouring of a graph is an assignment of colours 1, 2,, n to the vertices of a graph so that adjacent vertices have different colours. The chromatic number, µ(g), of a graph G, is the smallest n for which an n-colouring exists. xample 1: For this graph G, µ(g) = colouring 4-colouring 3-colouring No 2-coloring exists. round the pentagon we d have to alternate colours, but because of the odd number of sides we d end up with two adjacent vertices with the same colour. So 3 is the minimum number of colours. xample 2: The chromatic number of the complete graph K n is n. Proof: Since every vertex is adjacent to every other we need to use n distinct colours. µ = 3 µ = 5 97

2 very graph that contains a subgraph with chromatic number n must itself have chromatic number at least n. So, for example, the chromatic number of any graph that contains a triangle must be at least 3. 2 if n is even xample 3: The chromatic number of an n-sided polygon is: 3 if n is odd µ = 2 µ = 3 xample 4: The chromatic number of K m,n is 2. Proof: Colour the m vertices one colour and the n vertices the other colour. µ(k 4,3 ) = 2 Theorem 1: The chromatic number of a tree (connected graph with no cycles) is 2 (except where there s only one vertex). Proof: Choose a vertex V 0. ach vertex has a unique distance from V 0. Use one colour to colour those vertices whose distance from V 0 is even and the other colour for those vertices whose distance is odd. Clearly this is a valid 2-colouring The Chromatic Polynomial of a Graph The chromatic polynomial of a graph G is the number of ways of colouring G with k colours (a polynomial in k). It is denoted by Γ(G)(k). The chromatic number of G is the smallest value of k such that Γ(G)(k) is positive. For simplicity, unless we need to specify the parameter k, we ll write Γ(G)(k) simply as Γ(G). Theorem 2: Γ(K n ) = k(k 1) (k n + 1). Proof: Order the vertices in some way. There are k colours that can be assigned to the first vertex. ny one of the remaining colours can be assigned to the second vertex, and so on. xample 5: Γ(K 3 ) = k(k 1)(k 2). k colours k 1 k 2 colours colours 98

3 tree is a connected graph in which there are no cycles. In a tree there s a unique path (sequence of edges) from any vertex to any other and so there s a unique distance (counted in terms of the number of edges) between any two vertices. ny vertex whose distance from a given one is greatest must clearly have degree 1. So trees will always have vertices of degree 1. Theorem 3: If G is a tree with n vertices then Γ(G) = k(k 1) n 1. Proof: We use induction on the number of vertices. It s clearly true for n = 1. Suppose the result is true for trees with n vertices and that we have one with n + 1 vertices. Choose any vertex of degree 1 and remove it, together with the associated edge. By induction the resulting tree can be coloured with k colours in k(k 1) n 1 ways. Reinstating the deleted vertex, it s adjacent to only one coloured vertex and so can be coloured in k 1 ways, giving a total number of colourings of k(k 1) n. k 1 k 1 k 1 k k 1 k 1 k 1 k 1 k 1 k 1 We now show how to compute the chromatic polynomial of a graph. The method is inductive. From a given graph G we produce two simpler graphs G and G = and we use their chromatic polynomials to obtain the chromatic polynomial of G. Let G be a graph. Select any two adjacent vertices and B. Let G be the same graph with the edge B deleted. Let G = denote the graph G with vertices and B identified. (This means they become a single vertex and any edge having either or B as an endpoint now has, instead, this combined vertex.) B B = B G G G = xample 6: B B = B G G G = = B B G G G = B 99

4 Theorem 4: Let G be a graph. Select any two adjacent vertices and B. Then Γ(G) = Γ(G ) Γ(G = ). Proof: If we k-colour G we re free to colour and B the same colour. But we don t have to. We could just as validly colour them different colours (provided this was consistent with the colourings at the other vertices). There are two types of colourings of G in terms of what happens to and B 1B, B are given the SM colour 2B, B are given DIFFRNT colours B B G ach of these colourings of G gives a valid colouring of G =. G ach of these colourings of G gives a valid colouring of G. G = G Hence Γ G (k) = Γ G= (k) + Γ G (k). The result now follows algebraically. xample 7: Γ( ) = Γ( ) Γ( ) = k(k 1) 3 k(k 1)(k 2) = k(k 1)[(k 1) 2 (k 2)] = k(k 1)(k 2 3k + 3). xample 8: Γ( ) = Γ( ) Γ( ) Now Γ( ) = Γ( ).(k 1) = k(k 1) 2 (k 2) since once the triangle has been coloured the remaining vertex can be coloured any colour, except the colour of the vertex to which it is attached. and Γ( ) = Γ( ) Γ( ) = k(k 1) 4 k(k 1)(k 2 3k + 3) from example 7. Hence Γ( ) = k(k 1) 4 k(k 1)(k 2 3k + 3) k(k 1) 2 (k 2) = k(k 1)[(k 1) 3 (k 2 3k + 3) (k 1)(k 2)] = k(k 1)[k 3 3k 2 + 3k 1 k 2 +3k 3 k 2 + 3k 2] = k(k 1)(k 3 5k 2 + 9k 6) = k(k 1)(k 2)(k 2 3k + 3). It follows that the chromatic number of is 3. This was pretty obvious without all that calculation, but for a much more complicated graph, where the chromatic number is not so obvious, this could be a useful technique. lso, it could form the basis for a computer program to compute the chromatic number of a graph. Theorem 5: If C n is a cycle with n vertices then Γ(C n ) = (k 1) n + ( 1) n (k 1). Proof: Induction on n. Γ(C 3 ) = Γ(K 3 ) = k(k 1)(k 2) so it holds for n = 3. Suppose that it holds for n and let G = C n

5 Γ( ) = Γ( ) Γ( ). Γ(C n+1 ) = k(k 1) n Γ(C n ) = k(k 1) n (k 1) n ( 1) n (k 1) = (k 1) n+1 + ( 1) n+1 (k 1). Hence it holds for n + 1 and so, by induction, for all n Map Colouring Graph colouring is a purely combinatorial exercise that doesn t involve any topology. However it s a useful lead-in to map colouring. s with graph colouring, when colouring maps, we must colour adjacent objects with different colours. But in the case of map colouring the objects are the regions, or faces, in the map and adjacent means that they share a common boundary. djacent counties in a map of the world are coloured differently to make the borders clear. Though there s no need to use the minimum number of colours it s an interesting question to ask what is the minimum number of colours we can use? n n-colouring of a map on a surface is a way of assigning one of n labels (colours) to each face so that adjacent faces have different colours. map is n-colourable if an n-colouring of it exists. The chromatic number, µ(m), of a map, M, is the smallest n for which M is n-colourable. xample 9: The chromatic number of the following map is 2: 4-colouring 3-colouring 2-colouring but no 1-colouring exists xample 10: The chromatic number of the following map is 3: 3-colouring but no 2-colouring exists 101

6 where xample 11: The chromatic number of the following map is 4: 4-colouring but no 3-coloring exists The chromatic number, µ(s), of a surface, S, is the largest chromatic number for any map that can be drawn on it. Now there s no a priori reason why this couldn t be infinite. However we ll show that every surface has a finite chromatic number. This means that there s an upper bound to the chromatic numbers of maps on a given surface. Upper bounds are harder to arrive at than lower bounds. To find a lower bound for the chromatic number of a surface we only have to draw a map on the surface, and the chromatic number of the surface will have to be at least as big as the chromatic number of that map. For example, the fact that in example 9 we have a map on a disk with chromatic number 2 means that µ(disk) 2. xample 12: µ(disk) 4. xample 11 gives a map, M, on a disk with µ(m) = 4. Hence µ(disk) 4. If there existed another map on the disk that needs 5 colours, we d have µ(disk) 5. But in fact it can be shown that every map on a disk can be coloured validly with 4 colours so in fact µ(disk) = 4. This is the famous Four Colour Theorem, proved in Recall that the degree of a vertex is the number of edges at that vertex. With a map we define the degree of a face to be the number of edges surrounding that face. xample 13: a vertex of degree 5 a face of degree 6 Clearly holes in a surface don t affect its chromatic number. So the chromatic number of a disk (sphere with one hole) will be the same as that of a sphere, or a cylinder (sphere with two holes). If required to find the chromatic number of a surface therefore, the first step is to remove all holes that is replace the surface by the corresponding surface with no holes. This is exactly what we do for embedding questions. lso, like embedding, we remove vertices of degrees 1 and 2 from a map. When removing a vertex of degree 1 we also remove the corresponding edge. When removing a vertex of degree 2 we combine the two edges into a single edge. In what follows we assume that this has already been done and that the surfaces have no boundaries and the degrees of the vertices are at least 3. In the following theorem we make use of the average degree of the vertices and the average 2 degree of the faces. If v is the average degree of the vertices then v = is the number of V edges and V is the number of vertices. Why not? The answer is that each edge contributes to V 102

7 and = =. =... the degree of each of its two endpoints. If we chopped each edge in two, so that the half edges were associated with only one vertex, then we d have 2 of these half edges. 2 Similarly, if f is the average degree of the faces, then f = F. gain, each edge is shared by two faces. xample 14: Here we ve labelled the vertices and faces with their degrees. Note that the outside has to be considered too, because we re regarding this as a map on a sphere. The average degree of the vertices is thus 8 8. Note that = 13, so this is simply V The average degree of the faces is 7 7. Note that this is simply F Theorem 6: Suppose that M is a map (with all vertices of degree 3) on a surface S (with no holes), with uler characteristic χ. Let V, F and be the numbers of vertices, faces and edges for M and let v be the average degree of the vertices and let f be the average degree of the faces. Then: 2fχ 2vχ (f 2)(v 2) = 4 V 4 F Proof: In counting the total number of edges by adding the degrees of the vertices or faces, each edge gets counted twice (it joins two vertices) and each face gets counted twice (it is adjacent to two faces). Hence ff = vv = 2. f Thus V = v F, establishing the second equality of the theorem. 2 Now v = V 2(V + F χ) = V 2F 2χ = 2 + V V 2v 2χ = 2 + f V 2fχ Thus vf = 2f + 2v V so vf 2f 2v + 4 = (f 2)(v 2) 2fχ = 4 V 6.4. Polyhedra polyhedron is a region in 3-dimensional space, homeomorphic to a sphere and bounded by flat sides each of which is a polygon. There s no topological reason why the faces have to be flat, or the edges straight so it s convenient to consider polyhedra as maps on a sphere. Theorem 1 can therefore be applied to polyhedra by taking χ =

8 < Theorem 7: The average number of edges per face for any polyhedron is less than 6. Proof: We use the usual symbols for maps. 4f Since v 3 we have f 2 (f 2)(v 2) = 4 V 4, giving f < 6. consequence of this theorem is that there s no polyhedron where every face is a hexagon. There are, however, polyhedra where every face is a triangle (f = 3) or a square (f = 4) or even a pentagon (f = 5). But that s as far as we can go. If we extend the idea of a polyhedron to maps on other surfaces we can make the following conclusion about toroidal polyhedra (those which are homeomorphic to a torus). Theorem 8: For a map on a torus we have: (f 2)(v 2) = 4. Proof: This follows from theorem 1 by putting χ = 0. xample 15: The following is a 3 3 array of cubes, with the centre one removed. It can be considered as a map on a torus. There are eight vertices of degree 3, 16 of degree 4 and eight of degree 5. The average degree of the vertices is therefore v = 4. Since each face is a square, the average degree of the faces is f = 4. consequence of theorem 6 is that for a regular polyhedron on a torus the faces must be hexagons, squares or triangles (since v 2 must be an integer and so f 2 must divide 4). 104

9 . so,.... and Heawood s Theorem Theorem 9: For a map with F faces on a surface of weight χ 0 the average face degree is at most 6(χ 0 2) 6 + F 2vχ Proof: (f 2)(v 2) = 4 F 4 2χ v Hence f 2 = v 2 F v 2 4 2χ = v 2 F v 2 2 Thus f = χ v 2 F 6 1 χ F because v 3. 6(χ 0 2) So f 6 + F χ Corollary: If χ 0 2 then f 2 Proof: Since f F 1 (a given face cannot border more than all the remaining faces) we have: 6(χ 0 2) f 6 + f + 1 f 2 5f + 6(1 χ 0 ) 0. The greater of the two zeros of this quadratic is χ Theorem 10: (HWOOD 1910) Let S be a surface with no boundaries and weight χ χ If χ 0 2 then µ(s) INT lso χ(sphere) 6 and χ(projective plane) χ Proof: Suppose χ 0 2 and let k = 2 let n be the integer part of k. We prove by induction on the number of faces that every map on S can be n-coloured. map with one face can be coloured with a single colour and since n 4 we can easily do it with n colours. Now consider the general case. Suppose we have a certain map with at least two faces and assume that any map with fewer faces can be n-coloured. Since f k 1 there exists a face whose degree is at most k 1 and its degree is at most n 1. Shrink that face to a point. ll edges having one of the vertices of the chosen face as an endpoint will now meet at the same vertex. By induction we can n-colour this new map. Now replace the face in the now coloured map. It remains to show that this face can be validly coloured. 105

10 = = Since it borders at most n 1 other faces, at most n 1 colours must be avoided if we are to colour this remaining face. With n colours available this can be done. If χ 0 = 1 or 2 we can repeat the above argument by taking n = 6. Heawood only gave an upper bound. But surprisingly there are only two surfaces for which this upper bound is bigger than it need be. For all other surfaces Heawood s upper bound can be shown to be the actual value. The exceptions are the Klein bottle and the sphere. Heawood says µ(kb) 7 but in fact µ(kb) = 6. nd Heawood says µ(sphere) 6 while in fact µ(sphere) = 4. If S is a surface with no boundaries and weight χ 0 then: INT χ if χ µ(s) =. 6 if S is the Klein bottle 4 if S is the sphere In many cases we ll verify the chromatic number by using Heawood to get an upper bound and by constructing a suitable map to get the same value as a lower bound. xample 16: µ(projective plane) = χ Proof: Heawood says that µ INT INT The following map on the projective plane requires 6 colours so µ 6. Hence µ = 6. a b b a Note that, because of the orientation of the edges, if we cross over the edge a from region 6 we enter region 1, but it appears upside down, relative to what it would appear if we reached region 1 by travelling through region

11 xample 17: µ(torus) = 7. Proof: Heawood says µ 7. The following map on the torus requires 7 colours and so µ = 7. a b b a ach face is adjacent to every other face. It s remarkable that we can readily establish the chromatic number of surfaces like the projective plane and the torus while something so simple as the sphere (or equivalently the disk) is much more elusive. We ll soon prove that an upper bound for the sphere is 5. But the proof that in fact 4 is an upper bound (and hence the actual chromatic number) is exceedingly complicated The 5-Colour Theorem Theorem 11: µ(sphere) 5. In other words, every map on a sphere can be coloured using 5 colours. Proof: Suppose there s a map M on the sphere that isn t 5-colourable. We may suppose that we have a minimal counterexample that is, that every map with fewer faces is 5-colourable. Let f be the average number of edges per face. Since f < 6, M has a face F with at most 5 edges. Remove one of these edges and combine the two faces on either side into a single face. 107

12 This map has fewer faces than M and so is 5-colourable. Having 5-coloured this slightly smaller map, now replace the edge and leave F uncoloured. If there are less than 5 different colours around F then there s one available with which to colour F. But this contradicts our assumption that M is not 5-colourable. Hence F must be adjacent to exactly 5 faces and these must be coloured using 5 distinct colours. Since there s no colour left that we can use for F we ll need to modify the existing colouring. Let the faces surrounding F be F 1, F 2, F 3, F 4 and F 5 (in order around the outside of F, either clockwise or anticlockwise). Let the corresponding colours be C 1, C 2, C 3, C 4 and C 5. Delete all faces except those coloured C 1 or C 3. This may well disconnect M into several components. separate components 108

13 If F 1 and F 3 are in different components of this new map (in other words if you can t go from F 1 to F 3 by sticking to faces coloured C 1 and C 3 ) we could swap colours C 1 and C 3 in one of these components so that now F 1 and F 3 have the same colour (and, of course, maintaining a valid colouring). But now F would be surrounded by only 4 colours and so it could be validly coloured, to give a 5-colouring of M. Since our assumption is that M doesn t have a 5-colouring we conclude that F 1 and F 3 must be in the same component. That is, we can only get from one to the other by passing through C 1 or C 3 coloured faces. Such a closed path must separate F 2 and F 4. That is, one of F 2 and F 4 is on the inside of this closed path and the other is on the outside. (Of course, being on a sphere we can t say unambiguously which is inside and which is outside, but that doesn t matter.) C 1 C 2 C 3 C 4 This means that if we were to delete from M all faces except those coloured C 2 and C 4 the faces F 2 and F 4 must be in separate components. C 5 So we could swap colours C 2 and C 4 in one of these components and not in the other so that F 2 and F 4 now have the same colour. s before, this frees up one of the 5 colours with which to colour F and so complete the 5-colouring of M. gain this is a contradiction. So we can t escape a contradiction. It follows that our assumption that there exists a non 5- colourable map on the sphere must be false. Hence every map on the sphere can be 5-coloured. 109

14 XRCISS FOR CHPTR 6 xercise 1: Find the chromatic number of the following graph: xercise 2: (i) Find the chromatic polynomial of the following graph and express it in factorised form. (ii) Use this polynomial to find the number of ways of colouring the graph in (i) with 2 colours? How many ways with 3 colours? xercise 3: Find the number of ways of colouring the vertices of the following graph with 3 colours so that adjacent vertices have different colours. xercise 4: Find the number of ways of colouring the vertices of a square with k colours so that adjacent vertices have different colours. xercise 5: Find the number of ways of colouring the vertices of this graph, with 6 colours available, so that adjacent vertices have different colours. xercise 6: (i) Draw a diagram for K 6, the complete graph on 6 vertices. Draw a square with identified edges that represents the Klein bottle. (ii) mbed K 6 in the Klein bottle so that edges don t cross. (iii) Use this to draw, on a separate diagram, a map on the Klein bottle with six regions, each adjacent to the other five. (Finish with a clear picture in which only the edges of the map, and not the original graph, are visible. Label the regions 1 to 6. (iv) Let µ be chromatic number of the Klein bottle. What does your answer to (iv) tell you about µ? (v) Heawood s formula gives an upper bound for µ. Calculate this upper bound. (vi) Combine your answers to (v) and (vi) to determine µ as closely as possible. (Only use what you have proved. Do not simply quote the known value of µ.) 110

15 xercise 7: Let S be the sum of 3 projective planes and let n be the chromatic number of S. (a) Find n. (b) Construct a polygon with identified edges, P, to represent S. (c) Draw an embedding of K n, the complete graph on n vertices, on S. (d) Hence, or otherwise draw a map on P that requires n colours. xercise 8: Find the chromatic numbers of the following surfaces: (i) the Möbius Band; (ii) a cylinder with 3 holes; (iii) a sum of 10 projective planes. [You may assume that Heawood s upper bound is the actual value for all surfaces with no boundaries except the sphere and the Klein Bottle.] xercise 9: (a) regulation soccer ball is made up of patches, each of which is either a regular pentagon or a regular hexagon. ach vertex is surrounded by three patches. The pentagons are coloured black and the hexagons are coloured white. Based on this information alone show that there must be 12 pentagons. (b) Consider the pattern on a soccer ball to be a map on a sphere. It is made up of 12 pentagons, as predicted by (a), and 20 hexagons. Find the number of vertices and edges of this graph. 111

16 SOLUTIONS FOR CHPTR 6 xercise 1: Since the graph contains a cycle of length 5 there is clearly no 2-colouring. The following is a 3-coluring The chromatic number of this graph is therefore 3. xercise 2: (i) Let G 1 = G 2 = and G 3 = Then Γ(G 1 ) = Γ(G 2 ) Γ(G 3 ). Let G 4 = and G 5 = Then Γ(G 2 ) = Γ(G 4 ) Γ(G 5 ). Clearly Γ(G 4 ) = k(k 1) 6 and Γ(G 5 ) = k(k 1) 4 (k 2). Hence Γ(G 2 ) = k(k 1) 6 k(k 1) 4 (k 2) = k(k 1) 4 (k 2 3k + 3). Let G 6 = and G 7 = 112

17 Then Γ(G 3 ) = Γ(G 6 ) Γ(G 7 ). Clearly Γ(G 6 ) = k(k 1) 4 (k 2) and Γ(G 7 ) = k(k 1) 2 (k 2) 2. Hence Γ(G 3 ) = k(k 1) 4 (k 2) k(k 1) 2 (k 2) 2 = k(k 1) 2 (k 2)(k 2 3k + 3). So Γ(G 1 ) = k(k 1) 4 (k 2 3k + 3) k(k 1) 2 (k 2)(k 2 3k + 3) = k(k 1) 2 (k 2 3k + 3) 2. (ii) There are 2 ways of colouring the graph with 2 colours and 108 ways of colouring it with 3 colours. xercise 3: Γ ( ) = Γ( ) Γ( ) Γ( ) = (k 1)[(k 1) 5 + 1] = = 66 when k = 3. Γ( ) = Γ( ) Γ( ) = k(k 1)(k 2)(k 1) 2 k(k 1)(k 2)(k 1) = k(k 1) 2 (k 2) 2 = 12 when k = 3. Hence Γ( ) = = 54 when k = 3. xercise 4: Γ= k(k 1) 3 k(k 1)(k 2) = k(k 1)(k 2 2k + 1 k + 2) = k(k 1)(k 2 3k + 3). xercise 5: Let the graph be called G and consider the diagonal. G is a square and its chromatic polynomial is (k 1) 4 + (k 1). G = is a linear graph with 3 vertices and 2 edges. Its chromatic polynomial is k(k 1) 2. Hence µ(g) = (k 1) 4 + (k 1) + k(k 1) 2. When k = 6, µ = 780. xercise 6: (i) a b b a (ii) K 6 embedded in the KB

18 so = (iii) Joining a point in the middle of each face to the midpoint of each of the surrounding edges we get a map with 6 faces, each of which is adjacent to the other 5. This map requires 6 colours (iv) We need 6 colours to colour this map on the KB so µ(kb) 6. (v) Heawood s formula gives µ(kb) INT µ(kb) 7. (vi) So µ(kb) = 6 or 7. (In fact it is 6 but we haven t shown that.) xercise 7: (a) The weight of 3P is 3. By Heawood s formula n = INT (b), (c) (d) To obtain a map with 7 regions, each adjacent to the other 6, we take a point inside each face of the map obtained in (b) and join it to a point along each edge. 114

19 + = = = Removing the original edges we obtain a map on 3P in which each of the 7 regions are adjacent to the other 6. This map needs 7 colours. xercise 8: (i) µ( Möbius Band) = µ(projective Plane) = INT 2 6. (ii) µ( cylinder with 3 holes) = µ(sphere with 5 holes) = µ(sphere) = (iii) µ(sum of 10 projective planes) = INT xercise 9: (a) Let there be p pentagons and h hexagons. If V, F and are the numbers of vertices, faces and edges respectively then: F = p + h 2 = 5p + 6h (each edge belongs to 2 faces) 3V = 5p + 6h (each vertex belongs to 3 faces) 5p + 6h 5p + 6h Since V + F = 2 we have p + h This reduces to p = 12. (b) Clearly F = 32 and h = 20. Hence = 90 and V =

20 116

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

### Introduction 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

### Mathematical 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

### WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Topological Treatment of Platonic, Archimedean, and Related Polyhedra

Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Graph 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

### Euclidean Geometry. We start with the idea of an axiomatic system. An axiomatic system has four parts:

Euclidean Geometry Students are often so challenged by the details of Euclidean geometry that they miss the rich structure of the subject. We give an overview of a piece of this structure below. We start

### Connectivity 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

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### Graph 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

### ALGEBRA. 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,

### Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

### Planar Graphs. Complement to Chapter 2, The Villas of the Bellevue

Planar Graphs Complement to Chapter 2, The Villas of the Bellevue In the chapter The Villas of the Bellevue, Manori gives Courtel the following definition. Definition A graph is planar if it can be drawn

### The Geometer s Sketchpad: Non-Euclidean Geometry & The Poincaré Disk

The Geometer s Sketchpad: Non-Euclidean Geometry & The Poincaré Disk Nicholas Jackiw njackiw@kcptech.com KCP Technologies, Inc. ICTMT11 2013 Bari Overview. The study of hyperbolic geometry and non-euclidean

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

### ALGEBRA. 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

### Euler s Theorem. Tom Davis July 14, 2009

Euler s Theorem Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles July 14, 2009 Abstract Euler s theorem is a nice result that is easy to investigate with simple models from Euclidean

### If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

### Problem of the Month: Cutting a Cube

Problem of the Month: The Problems of the Month (POM) are used in a variety of ways to promote problem solving and to foster the first standard of mathematical practice from the Common Core State Standards:

### Sum 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

### Math 181 Handout 16. Rich Schwartz. March 9, 2010

Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =

### Arrangements And Duality

Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

### HOW MANY HOLES DOES MY CAT HAVE?

HOW MANY HOLES DOES MY CAT HAVE? DAVID ROSENTHAL In memory of Professor Bill Watson Abstract. Euler s famous formula V E+F = 2 is one of the most elegant and powerful formulas in mathematics, and for this

### When is a graph planar?

When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,

### Chapter 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

### Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

### Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

### 3D shapes. Level A. 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite. 2. What is another name for 3-D shapes?

Level A 1. Which of the following is a 3-D shape? A) Cylinder B) Octagon C) Kite 2. What is another name for 3-D shapes? A) Polygon B) Polyhedron C) Point 3. A 3-D shape has four sides and a triangular

### Pick s Theorem. Tom Davis Oct 27, 2003

Part I Examples Pick s Theorem Tom Davis tomrdavis@earthlink.net Oct 27, 2003 Pick s Theorem provides a method to calculate the area of simple polygons whose vertices lie on lattice points points with

### Homework Exam 1, Geometric Algorithms, 2016

Homework Exam 1, Geometric Algorithms, 2016 1. (3 points) Let P be a convex polyhedron in 3-dimensional space. The boundary of P is represented as a DCEL, storing the incidence relationships between the

### Angles that are between parallel lines, but on opposite sides of a transversal.

GLOSSARY Appendix A Appendix A: Glossary Acute Angle An angle that measures less than 90. Acute Triangle Alternate Angles A triangle that has three acute angles. Angles that are between parallel lines,

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### Lines That Pass Through Regions

: Student Outcomes Given two points in the coordinate plane and a rectangular or triangular region, students determine whether the line through those points meets the region, and if it does, they describe

### Smooth functions statistics

Smooth functions statistics V. I. rnold To describe the topological structure of a real smooth function one associates to it the graph, formed by the topological variety, whose points are the connected

### Digital Image Processing. Prof. P.K. Biswas. Department of Electronics & Electrical Communication Engineering

Digital Image Processing Prof. P.K. Biswas Department of Electronics & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 27 Colour Image Processing II Hello, welcome

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### A convex polygon is a polygon such that no line containing a side of the polygon will contain a point in the interior of the polygon.

hapter 7 Polygons A polygon can be described by two conditions: 1. No two segments with a common endpoint are collinear. 2. Each segment intersects exactly two other segments, but only on the endpoints.

### Angle - a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees

Angle - a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees Apex in a pyramid or cone, the vertex opposite the base; in

### Acquisition 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

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### Introduction to Topology

Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

### . 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

### Unit 3: Triangle Bisectors and Quadrilaterals

Unit 3: Triangle Bisectors and Quadrilaterals Unit Objectives Identify triangle bisectors Compare measurements of a triangle Utilize the triangle inequality theorem Classify Polygons Apply the properties

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

### WHERE DOES THE 10% CONDITION COME FROM?

1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Rectangles with the Same Numerical Area and Perimeter

About Illustrations: Illustrations of the Standards for Mathematical Practice (SMP) consist of several pieces, including a mathematics task, student dialogue, mathematical overview, teacher reflection

### Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

### Actually Doing It! 6. Prove that the regular unit cube (say 1cm=unit) of sufficiently high dimension can fit inside it the whole city of New York.

1: 1. Compute a random 4-dimensional polytope P as the convex hull of 10 random points using rand sphere(4,10). Run VISUAL to see a Schlegel diagram. How many 3-dimensional polytopes do you see? How many

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### M-Degrees of Quadrangle-Free Planar Graphs

M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru

### (x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

### Euler 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

### Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

### Incenter Circumcenter

TRIANGLE: Centers: Incenter Incenter is the center of the inscribed circle (incircle) of the triangle, it is the point of intersection of the angle bisectors of the triangle. The radius of incircle is

### 1 Symmetries of regular polyhedra

1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an

### Level 1 - Maths Targets TARGETS. With support, I can show my work using objects or pictures 12. I can order numbers to 10 3

Ma Data Hling: Interpreting Processing representing Ma Shape, space measures: position shape Written Mental method s Operations relationship s between them Fractio ns Number s the Ma1 Using Str Levels

### Geometry Chapter 1. 1.1 Point (pt) 1.1 Coplanar (1.1) 1.1 Space (1.1) 1.2 Line Segment (seg) 1.2 Measure of a Segment

Geometry Chapter 1 Section Term 1.1 Point (pt) Definition A location. It is drawn as a dot, and named with a capital letter. It has no shape or size. undefined term 1.1 Line A line is made up of points

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### Maths Year 2 Step 1 Targets Number and place value count in steps of 2 and 5 from 0; forwards and backwards. use number facts to solve problems

Maths Year 2 Step 1 Targets Number and place value count in steps of 2 and 5 from 0; forwards and backwards. Begin to use the term multiple identify and represent numbers using different representations

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### Surface Area and Volume Nets to Prisms

Surface Area and Volume Nets to Prisms Michael Fauteux Rosamaria Zapata CK12 Editor Say Thanks to the Authors Click http://www.ck12.org/saythanks (No sign in required) To access a customizable version

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### 2000 Solutions Fermat Contest (Grade 11)

anadian Mathematics ompetition n activity of The entre for Education in Mathematics and omputing, University of Waterloo, Waterloo, Ontario 000 s Fermat ontest (Grade ) for The ENTRE for EDUTION in MTHEMTIS

### 4. An isosceles triangle has two sides of length 10 and one of length 12. What is its area?

1 1 2 + 1 3 + 1 5 = 2 The sum of three numbers is 17 The first is 2 times the second The third is 5 more than the second What is the value of the largest of the three numbers? 3 A chemist has 100 cc of

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### Comments on Quotient Spaces and Quotient Maps

22M:132 Fall 07 J. Simon Comments on Quotient Spaces and Quotient Maps There are many situations in topology where we build a topological space by starting with some (often simpler) space[s] and doing

### Grade 7 & 8 Math Circles Circles, Circles, Circles March 19/20, 2013

Faculty of Mathematics Waterloo, Ontario N2L 3G Introduction Grade 7 & 8 Math Circles Circles, Circles, Circles March 9/20, 203 The circle is a very important shape. In fact of all shapes, the circle is

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### ON SELF-INTERSECTIONS OF IMMERSED SURFACES

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 12, December 1998, Pages 3721 3726 S 0002-9939(98)04456-6 ON SELF-INTERSECTIONS OF IMMERSED SURFACES GUI-SONG LI (Communicated by Ronald

### LESSON PLAN #1: Discover a Relationship

LESSON PLAN #1: Discover a Relationship Name Alessandro Sarra Date 4/14/03 Content Area Math A Unit Topic Coordinate Geometry Today s Lesson Sum of the Interior Angles of a Polygon Grade Level 9 NYS Mathematics,

### Answer: The relationship cannot be determined.

Question 1 Test 2, Second QR Section (version 3) In City X, the range of the daily low temperatures during... QA: The range of the daily low temperatures in City X... QB: 30 Fahrenheit Arithmetic: Ranges

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.

MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### Midterm 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

### Year 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.

### Grade 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

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### A couple of Max Min Examples. 3.6 # 2) Find the maximum possible area of a rectangle of perimeter 200m.

A couple of Max Min Examples 3.6 # 2) Find the maximum possible area of a rectangle of perimeter 200m. Solution : As is the case with all of these problems, we need to find a function to minimize or maximize

### Permutation Groups. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003

Permutation Groups Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003 Abstract This paper describes permutations (rearrangements of objects): how to combine them, and how

### Permutation Groups. Rubik s Cube

Permutation Groups and Rubik s Cube Tom Davis tomrdavis@earthlink.net May 6, 2000 Abstract In this paper we ll discuss permutations (rearrangements of objects), how to combine them, and how to construct

### Investigating Area Under a Curve

Mathematics Investigating Area Under a Curve About this Lesson This lesson is an introduction to areas bounded by functions and the x-axis on a given interval. Since the functions in the beginning of the

### Chapter 18 Symmetry. Symmetry of Shapes in a Plane 18.1. then unfold

Chapter 18 Symmetry Symmetry is of interest in many areas, for example, art, design in general, and even the study of molecules. This chapter begins with a look at two types of symmetry of two-dimensional

### 5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing

### Parallel 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

### SOLVING EQUATIONS WITH RADICALS AND EXPONENTS 9.5. section ( 3 5 3 2 )( 3 25 3 10 3 4 ). The Odd-Root Property

498 (9 3) Chapter 9 Radicals and Rational Exponents Replace the question mark by an expression that makes the equation correct. Equations involving variables are to be identities. 75. 6 76. 3?? 1 77. 1