Euler s Formula. Then v e + f =2. Check the planar graphs on the previous slide: Cube v e + f = = 2
|
|
|
- Milton Benedict Willis
- 7 years ago
- Views:
Transcription
1 Euler s Formula Theorem (Euler s Formula) Take any connected planar graph drawn with no intersecting edges. Let v be the number of vertices in the graph. Let e be the number of edges in the graph. Let f be the number of faces in the graph. Then v e + f =2. Check the planar graphs on the previous slide: Cube v e + f = = 2 K 3,2 v e + f =5 6+3=2 Let s see what Euler s Formula can do for us!
2 Using Euler s Formula 1 Example (Using Euler s Formula 1) C B A D E F What is v? What is e? If the graph is planar, what must f be? Redraw the graph with vertices/edges moved around so the graph appears planar.
3 Useful Facts for Planar Graphs We can combine the following theorems to answer questions about planar graphs. Theorem (Sum of the Degrees For Vertices) In any graph, the sum of the degrees of all vertices is equal to twice the number of edges. along with what we just looked at Theorem (Sum of the Degrees For Faces) In any planar graph, the sum of the degrees of all faces is equal to twice the number of edges. along with Euler s Formula Theorem (Euler s Formula) For a connected planar graph with vertices v, edges e, andfacesf, the following must hold: v e + f =2.
4 Using Euler s Formula 2 Example (Using Euler s Formula 2) A connected planar graph has 8 vertices and 12 edges. How many faces are there? A connected planar graph has 6 vertices and 4 faces. How many edges are there? A connected planar graph has 8 vertices with degrees: 1, 1, 2, 2, 3, 3, 4, 4. How many edges are there? A connected planar graph has 8 vertices with degrees: 1, 1, 2, 2, 3, 3, 4, 4. How many faces are there?
5 Using Euler s Formula 3 Example (Using Euler s Formula 3) A connected planar graph has 6 faces and 12 edges. How many vertices are there? A connected planar graph has 4 faces with degrees: 3, 3, 4, 4. How many edges are there? A connected planar graph has 4 faces with degrees: 3, 3, 4, 4. How many vertices are there? Draw a connected planar graph with 4 faces with degrees: 3, 3, 4, 4. Is there only one such isomorphic graph?
6 Using Euler s Formula 4 Example (Using Euler s Formula 4) B A C E D F What is v? Whatise? Though it doesn t look it, this is graph is planar. What is f?
7 AChancetoDiscoverEuler sgeneralformula Note that Euler s Formula only applies to connected graphs, i.e., graphs that have one component where we write c = 1. See if you can extend Euler s Formula for c = 2 in the graph below! Theorem (Euler s General Formula) For any planar graph with vertices v, edges e, facesf and components c, the following must hold: v e + f c =1.
8 Another Euler s Formula 1 Example (Another Euler s Formula 1) Find v, e, andf for these two graphs. Find c for these two graphs. Combine c, e, f,andv to make a new Euler s Formula!
9 Another Euler s Formula 2 Example (Another Euler s Formula 2) A connected planar graph has vertices whose degrees are 3, 3, 4, 4, 5, 6, 7. How many vertices are there? A connected planar graph has vertices whose degrees are 3, 3, 4, 4, 5, 6, 7. How many edges are there? A connected planar graph has vertices whose degrees are 3, 3, 4, 4, 5, 6, 7. How many faces are there? A disconnected planar graph with c = 2 has vertices whose degrees are 3, 3, 4, 4, 5, 6, 7. How many faces are there? A disconnected planar graph with c = 4 has vertices whose degrees are 3, 4, 5, 6, 7, 8, 9. How many faces are there?
10 Coloring the Vertices of a Graph We are going to assign colors to vertices of a graph in order to do some applications. Here are some rules for how this must be done: Every vertex must be colored. Any two vertices that are connected by an edge must have a di erent color. This leads to our next definition. Definition (n-colorable and Chromatic Number) A graph is n-colorable if it can be colored with n colors so that adjacent vertices (those sharing an edge) do not have the same color. The smallest possible number of colors needed to color the vertices is called the Chromatic Number of the graph.
11 Vertex Coloring 1 Example (Vertex Coloring 1) Consider the graph below. G F A E B D C Is this graph planar? Can you color the vertices of the graph using 4 colors? Can you color the vertices of the graph using 3 colors? What is the Chromatic Number of the graph?
12 Chromatic Number 1 Theorem There s something REALLY obvious about coloring vertices of a graph, but let s talk about it anyway. Any time there is an edge between two vertices we will need at least TWO colors to for the vertices. The following is not a mind-blowing result, but it s a start! Theorem (Chromatic Number 1 Theorem) A graph has Chromatic Number 1 exactly when there are NO EDGES. In other words, the graph must be entirely vertices.
13 Vertex Coloring 2 Example (Vertex Coloring 2) Consider the graph below. How do you know this graph is not 1-colorable? How do you know this graph is not 2-colorable? Find the Chromatic Number.
14 Vertex Coloring 3 Example (Vertex Coloring 3) Consider the graph below. B A C E D F How do you know this graph is not 2-colorable? Is the graph 3-colorable? Find the Chromatic Number.
15 Circuit Note that in our examples so far: Some of the graphs are similar, but they have di erent chromatic numbers. There is a connection between certain chromatic numbers and the way in which you can make a round trip in a graph. Definition (Circuit) A circuit of a graph is a route through adjacent vertices that starts at a certain vertex and ends at the same vertex as the route started. So what s the connection between Chromatic Number of a graph and circuits? Well, it has something to do with Chromatic Number 2 and the kind of circuits we can find.
16 Chromatic Number 2 Theorem Theorem (Chromatic Number 2 Theorem) A graph has Chromatic Number 2 exactly when there are NO circuits with an odd number of vertices. The two graphs below have Chromatic Number 2 because of the Theorem above. The circuit for the graph on the left has 4 vertices. Circuits for the graph on the right have either 4 or 6 vertices.
17 Using the Chromatic Number 2 Theorem Notice that the Chromatic Number 2 Theorem tells us when a graph is NOT 2-colorable as well. Example (Graphs that are not 2-colorable) The two graphs below have do not Chromatic Number 2: In these graphs we can easily find circuits with 3 or 5 vertices. So the Chromatic Number 2 Theorem says that these graphs DO NOT have chromatic number 2.
18 Vertex Coloring 4 Example (Vertex Coloring 4) Consider the graph below. Find the Chromatic Number.
19 Vertex Coloring 5 Example (Vertex Coloring 5) Consider the graph below. Find the Chromatic Number.
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
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
CS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
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
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
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
Chapter 6: Graph Theory
Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.
Class One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
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
Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )
1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the
Discrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh
Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh Graph Theory: Graph theory can be defined as the study of graphs; Graphs are mathematical structures used to model pair-wise relations between
. 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
On planar regular graphs degree three without Hamiltonian cycles 1
On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.
Social Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
Small Maximal Independent Sets and Faster Exact Graph Coloring
Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected
Just the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
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
Networks and Paths. The study of networks in mathematics began in the middle 1700 s with a famous puzzle called the Seven Bridges of Konigsburg.
ame: Day: etworks and Paths Try This: For each figure,, and, draw a path that traces every line and curve exactly once, without lifting your pencil.... Figures,, and above are examples of ETWORKS. network
V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
Chapter 3.1 Angles. Geometry. Objectives: Define what an angle is. Define the parts of an angle.
Chapter 3.1 Angles Define what an angle is. Define the parts of an angle. Recall our definition for a ray. A ray is a line segment with a definite starting point and extends into infinity in only one direction.
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
CMPSCI611: Approximating MAX-CUT Lecture 20
CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to
Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
Finding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
MD5-26 Stacking Blocks Pages 115 116
MD5-26 Stacking Blocks Pages 115 116 STANDARDS 5.MD.C.4 Goals Students will find the number of cubes in a rectangular stack and develop the formula length width height for the number of cubes in a stack.
E XPLORING QUADRILATERALS
E XPLORING QUADRILATERALS E 1 Geometry State Goal 9: Use geometric methods to analyze, categorize and draw conclusions about points, lines, planes and space. Statement of Purpose: The activities in this
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,
Total colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
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,
The GED math test gives you a page of math formulas that
Math Smart 643 The GED Math Formulas The GED math test gives you a page of math formulas that you can use on the test, but just seeing the formulas doesn t do you any good. The important thing is understanding
PERIMETER AND AREA. In this unit, we will develop and apply the formulas for the perimeter and area of various two-dimensional figures.
PERIMETER AND AREA In this unit, we will develop and apply the formulas for the perimeter and area of various two-dimensional figures. Perimeter Perimeter The perimeter of a polygon, denoted by P, is the
Network Flow I. Lecture 16. 16.1 Overview. 16.2 The Network Flow Problem
Lecture 6 Network Flow I 6. Overview In these next two lectures we are going to talk about an important algorithmic problem called the Network Flow Problem. Network flow is important because it can be
Simple Graphs Degrees, Isomorphism, Paths
Mathematics for Computer Science MIT 6.042J/18.062J Simple Graphs Degrees, Isomorphism, Types of Graphs Simple Graph this week Multi-Graph Directed Graph next week Albert R Meyer, March 10, 2010 lec 6W.1
OA4-13 Rounding on a Number Line Pages 80 81
OA4-13 Rounding on a Number Line Pages 80 81 STANDARDS 3.NBT.A.1, 4.NBT.A.3 Goals Students will round to the closest ten, except when the number is exactly halfway between a multiple of ten. PRIOR KNOWLEDGE
CAD Algorithms. P and NP
CAD Algorithms The Classes P and NP Mohammad Tehranipoor ECE Department 6 September 2010 1 P and NP P and NP are two families of problems. P is a class which contains all of the problems we solve using
Vieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
Factorizations: Searching for Factor Strings
" 1 Factorizations: Searching for Factor Strings Some numbers can be written as the product of several different pairs of factors. For example, can be written as 1, 0,, 0, and. It is also possible to write
S on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =
Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped
MATH 13150: Freshman Seminar Unit 10
MATH 13150: Freshman Seminar Unit 10 1. Relatively prime numbers and Euler s function In this chapter, we are going to discuss when two numbers are relatively prime, and learn how to count the numbers
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
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
2.5 Zeros of a Polynomial Functions
.5 Zeros of a Polynomial Functions Section.5 Notes Page 1 The first rule we will talk about is Descartes Rule of Signs, which can be used to determine the possible times a graph crosses the x-axis and
DATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
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
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
Procedure for Graphing Polynomial Functions
Procedure for Graphing Polynomial Functions P(x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 To graph P(x): As an example, we will examine the following polynomial function: P(x) = 2x 3 3x 2 23x + 12 1. Determine
Removing Even Crossings
EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,
Short cycle covers of graphs with minimum degree three
Short cycle covers of graphs with minimum degree three Tomáš Kaiser, Daniel Král, Bernard Lidický and Pavel Nejedlý Department of Applied Math Charles University Cycles and Colourings 2008 - Tatranská
Topology. Shapefile versus Coverage Views
Topology Defined as the the science and mathematics of relationships used to validate the geometry of vector entities, and for operations such as network tracing and tests of polygon adjacency Longley
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)
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
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.
MA107 Precalculus Algebra Exam 2 Review Solutions
MA107 Precalculus Algebra Exam 2 Review Solutions February 24, 2008 1. The following demand equation models the number of units sold, x, of a product as a function of price, p. x = 4p + 200 a. Please write
2014 Chapter Competition Solutions
2014 Chapter Competition Solutions Are you wondering how we could have possibly thought that a Mathlete would be able to answer a particular Sprint Round problem without a calculator? Are you wondering
1051-232 Imaging Systems Laboratory II. Laboratory 4: Basic Lens Design in OSLO April 2 & 4, 2002
05-232 Imaging Systems Laboratory II Laboratory 4: Basic Lens Design in OSLO April 2 & 4, 2002 Abstract: For designing the optics of an imaging system, one of the main types of tools used today is optical
Lecture 7: NP-Complete Problems
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit
EdExcel Decision Mathematics 1
EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation
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.,
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
CK-12 Geometry: Parts of Circles and Tangent Lines
CK-12 Geometry: Parts of Circles and Tangent Lines Learning Objectives Define circle, center, radius, diameter, chord, tangent, and secant of a circle. Explore the properties of tangent lines and circles.
Math 475, Problem Set #13: Answers. A. A baton is divided into five cylindrical bands of equal length, as shown (crudely) below.
Math 475, Problem Set #13: Answers A. A baton is divided into five cylindrical bands of equal length, as shown (crudely) below. () ) ) ) ) ) In how many different ways can the five bands be colored if
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
The minimum number of distinct areas of triangles determined by a set of n points in the plane
The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,
OPTIONS TRADING AS A BUSINESS UPDATE: Using ODDS Online to Find A Straddle s Exit Point
This is an update to the Exit Strategy in Don Fishback s Options Trading As A Business course. We re going to use the same example as in the course. That is, the AMZN trade: Buy the AMZN July 22.50 straddle
Lecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
Pythagorean Theorem: Proof and Applications
Pythagorean Theorem: Proof and Applications Kamel Al-Khaled & Ameen Alawneh Department of Mathematics and Statistics, Jordan University of Science and Technology IRBID 22110, JORDAN E-mail: kamel@just.edu.jo,
Examination paper for MA0301 Elementær diskret matematikk
Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750
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
n 2 + 4n + 3. The answer in decimal form (for the Blitz): 0, 75. Solution. (n + 1)(n + 3) = n + 3 2 lim m 2 1
. Calculate the sum of the series Answer: 3 4. n 2 + 4n + 3. The answer in decimal form (for the Blitz):, 75. Solution. n 2 + 4n + 3 = (n + )(n + 3) = (n + 3) (n + ) = 2 (n + )(n + 3) ( 2 n + ) = m ( n
Session 6 Number Theory
Key Terms in This Session Session 6 Number Theory Previously Introduced counting numbers factor factor tree prime number New in This Session composite number greatest common factor least common multiple
Representation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
FRACTIONAL COLORINGS AND THE MYCIELSKI GRAPHS
FRACTIONAL COLORINGS AND THE MYCIELSKI GRAPHS By G. Tony Jacobs Under the Direction of Dr. John S. Caughman A math 501 project submitted in partial fulfillment of the requirements for the degree of Master
MATH STUDENT BOOK. 8th Grade Unit 6
MATH STUDENT BOOK 8th Grade Unit 6 Unit 6 Measurement Math 806 Measurement Introduction 3 1. Angle Measures and Circles 5 Classify and Measure Angles 5 Perpendicular and Parallel Lines, Part 1 12 Perpendicular
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
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
Quick Reference ebook
This file is distributed FREE OF CHARGE by the publisher Quick Reference Handbooks and the author. Quick Reference ebook Click on Contents or Index in the left panel to locate a topic. The math facts listed
The Clar Structure of Fullerenes
The Clar Structure of Fullerenes Liz Hartung Massachusetts College of Liberal Arts June 12, 2013 Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, 2013 1 / 25
1. Write the number of the left-hand item next to the item on the right that corresponds to it.
1. Write the number of the left-hand item next to the item on the right that corresponds to it. 1. Stanford prison experiment 2. Friendster 3. neuron 4. router 5. tipping 6. small worlds 7. job-hunting
Lecture 1: Course overview, circuits, and formulas
Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik
Zeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
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
An inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
DEFINITIONS. Perpendicular Two lines are called perpendicular if they form a right angle.
DEFINITIONS Degree A degree is the 1 th part of a straight angle. 180 Right Angle A 90 angle is called a right angle. Perpendicular Two lines are called perpendicular if they form a right angle. Congruent
Solving Quadratic Equations
9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation
Online Degree Ramsey Theory
UofL Discrete Math Workshop 2008 1 Online Degree Ramsey Theory posed by Illinois REGS (2007) problem 1 presented by Lesley Wiglesworth LATEX byadamjobson For a family of graphs F closed under subgraphs,
The last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
POLYNOMIAL FUNCTIONS
POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a
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
Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
The chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
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
Ummmm! Definitely interested. She took the pen and pad out of my hand and constructed a third one for herself:
Sum of Cubes Jo was supposed to be studying for her grade 12 physics test, but her soul was wandering. Show me something fun, she said. Well I wasn t sure just what she had in mind, but it happened that
c 2008 Je rey A. Miron We have described the constraints that a consumer faces, i.e., discussed the budget constraint.
Lecture 2b: Utility c 2008 Je rey A. Miron Outline: 1. Introduction 2. Utility: A De nition 3. Monotonic Transformations 4. Cardinal Utility 5. Constructing a Utility Function 6. Examples of Utility Functions
Previously, you learned the names of the parts of a multiplication problem. 1. a. 6 2 = 12 6 and 2 are the. b. 12 is the
Tallahassee Community College 13 PRIME NUMBERS AND FACTORING (Use your math book with this lab) I. Divisors and Factors of a Number Previously, you learned the names of the parts of a multiplication problem.
A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS
A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS PAWE L PRA LAT Abstract. In this note we consider the on-line Ramsey numbers R(P n, P m ) for paths. Using a high performance computing clusters,
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
Bicycle Math. presented to the Math, Computer Science, & Physics Seminar Bard College Annandale-on-Hudson, New York. Timothy E.
Bicycle Math presented to the Math, Computer Science, & Physics Seminar Bard College Annandale-on-Hudson, New York Timothy E. Goldberg Cornell University Ithaca, New York April 1, 2010 Abstract We report