星の研究. A Study of Stars. Junten Science Library 4. Revised English version based on the lecture on 2 nd Dec for
|
|
- Rosalyn Griffith
- 5 years ago
- Views:
Transcription
1 Junten Science Library Revised English version based on the lecture on nd Dec. 00 for Junten Junior High School and Chua Chu Kan Higih School in Singapore 星の研究 A Study of Stars Written and translated by Dr. Nakahara --
2 Junten Science Library A Study of Stars An n-pointed Star --- Our Definition of the Star Shape Draw star shapes. What kind of star-shape did you draw? These are the examples of the star shapes I found on the web. Left one is called a pentagram. It is the most common shape almost everyone reminds of when he hears the word star-shape. The right one is a hexagram. It is also called the David s star and is considered as sacred in Judaism. You can find the one on the national flag of Israel (the picture on the right.) I did not expect to find the centre one. It is sometimes adopted by the Manga authors to represent a girl s bright eye or the star twinkling in the winter sky. The stars in the real sky are either the planets or fixed stars. The planets wax and wane, changing their shapes. They are by no means of the star shapes. The fixed stars are similar to the sun and are round. It is not the star-shape either. We can not recognize the fixed stars as a disk with definite radius because they are too far from us. They are seen as the bright points. As our photoreceptor cells are of the finite size, the points smear to some shapes which may be star shapes. To investigate the star shapes mathematically, we will have to define them first. Pentagram is a star shape with 5 vertices. Hexagram is the one with 6. When we go further to the decagram, the dodecagram and the icosapentagram, the Latin words for the large numbers are practically undecipherable. Therefore we will use the plainer words with Arabic figures. We call pentagram a 5-pointed star and hexagram a 6-pointed star. These names are less interesting but easier to generalize. Now let us define an n-pointed star. n-pointed star n-pointed star is a closed graph(*) with n sides which connects all n vertices of a regular n-gon, the regular polygon(**) with n vertices, and is an Euler s circuit(***). --
3 All the angles are of the same magnitude and all the sides are of the same length. 3No sides are shared with the regular polygon. (*) closed graph A graph with no open segments of line. Every vertex is connected by more than one sides (**)regular polygon A polygon with all the sides are of the same length and all the angles are of the same magnitude. (***)Euler s circuit A path you can draw by the pencil without lifting it. Exercise Find the one in the above pictures which is a n-pointed star. Drawing n-pointed stars Let us draw various stars with various polygons. Exercise The following are the polygons with 3,,5,6,7,8,9 and 0 vertices. Draw as many different stars using these polygons. Can you draw stars with any kind of polygons? Can you draw two or more different stars with the same polygon? 3-pointed star -pointed star 5 pointed star 6-pointed star 7-pointed star -3-
4 8-pointed star 9-pointed star 0-pointed star Let us summarize the exercise. There are no such things as( )-pointed stars, ( )pointed-stars or( )-pointed stars. There is only one each of( )-pointed star, ( )-pointed star and ( )-pointed star. There are two different shapes in ( )-pointed stars and( )-pointed stars. You may have a lot of questions unanswered at the moment. How many polygons with which we cannot draw any stars? We have two polygons with two different kinds of stars. Are they exceptions? Let us proceed to the next polygon and find our idea is not quite right. In fact, there are as many as four different stars we can draw with -gon. --
5 Exercise 3 Draw the four different stars with -gon. It is now clear that the polygon with many different stars is not the exception at all. For example you can draw 8 different stars with 9-gon. How do we see the number of the different stars with a 360-gon? Our final aim of these lectures is to find the number of the different stars with a given polygon. If the only way we can see is just drawing the stars, our way to the goal will be very long and winding. Is there any systematic method of calculating the number of different stars from the number of vertices? We need to look at the problem from the different angle to make a breakthrough. 3 Stars and Modular Arithmetic This is a 7-pointed star. I put the numbers to the vertices of the 7-gon. The vertex on the right is 0. Then the number is getting larger as we move anti-clockwise and the final vertex is 6. Start from vertex 0 and travel along the 0 star sides to the direction shown by an arrow. As the star is an Eulerian circuit, we travel through all the vertices of 7-gon and finally come back to the vertex 0. Let us write down the number in the order of our travel Look at the sequence of the numbers and you will see that the sequence is the same as the one appeared in the multiplication table of modulo 7 arithmetic. -5-
6 Shown here is the multiplication table of Mod the modulo 7 arithmetic. Each entry represents a class of the numbers whose remainders are the same when they are divided by 7. The class contains the numbers, 9, 6, 3 and so on as well as -5, -, -9. The table is the multiplication table. You can find the result of the multiplication among the classes. The table shows that the class multiplied by the class 3 makes the class, which means, a number belonging to the class multiplied by a number belonging to the class 3 makes a number belonging to the class. The row in pink colour represents the multiples of 3, that is: , and is exactly the same as the sequence we have seen in the previous page. The result suggests us that the other rows may correspond to one of the 7-pointed stars. Exercise Look at the other rows of the multiplication table and draw the graphs which correspond to the rows. The result tells us that the row corresponds to 7-gon and the row corresponds to another 7-pointed star which is different from the one corresponded by the row 3. Let us try with the row. What kind of shape do we get? The classes attached to the vertices are in the order of the path. When we compare this sequence to the one with the row 3, which is you will see that the order of the classes is in the opposite direction. Therefore the shapes drawn with these two sequences are exactly the same although the directions we draw them are opposite. -6-
7 Similarly the star drawn using the row 5 is as same as the one with row, and we have the 7-gon again with the row 6 just like with the row. Exercise 5 Complete the multiplication table of modulo 0 arithmetic and find the shape drawn using each row. We know that there is only one 0-pointed star. Find the rows which we can draw the 0-pointed star with. Investigate why we can not draw the stars with the other rows. Mod You saw that in the rows we can not draw the stars the same class appears more than once and certain classes never appear. On the other hand, in the row corresponding to the star every class from 0 up to 9 appears and it does only once. This property means the n-pointed stars are Eulerian circuit. Counting the stars Let us summarize the conclusion of the previous section. ()Every n-pointed star can be drawn with a row of the multiplication table of modulo n arithmetic connecting the vertices of the n-gon in the order of the number in the row. ()If we can draw an n-pointed star with a certain row (let us call it the row r) then the same star can be drawn with the row n-r. In this case the pen travels in the opposite direction to the one -7-
8 with the row r. (3)If a certain row contains all of the classes from 0 up to n-, then the corresponding shape will be an Eulerian circuit connecting all of the vertices of n-gon. Otherwise, the path reaches the original vertex labelled 0 again before it connects all of the vertices. ()With the row and the row n-, we can not draw the n-pointed stars despite that these two rows satisfy all the conditions above, because the shape we can draw with them is the n-gon itself. Of these four conditions, the condition (3) is the most complicated one to state. It needs further investigation. We would like to know whether a certain row contains all the classes without writing down the whole row. In the multiplication table of modulo 0 arithmetic the rows, 3, 7 and 9 contain all the classes. Exercise 6 Find the greatest common measure (g.c.m.) of 0 and r when r is a positive integer less than 0. r g.c.m. of 0 and r Exercise 6 implies that the row r contains all of the classes if and only if the g.c.m. of 0 and r is. If the g.c.m. of two integers m and n is then we say that the integers m and n are co-prime. Exercise 7 Show that if two numbers n and r are not co-prime then the row r does not include class. Let us now prove that the row r contains all the classes if n and r are co-prime. First of all let us show that if no class appears in the row r more than once, then all the classes appear in it. It is because there are n places in the row r and there are n classes in modulo n arithmetic. Now we will prove the main statement using the method called reductio ad absurdum. Assume that a certain class appears in the row r twice. Then r p=r q where p and q are two different classes. The equality implies that the remainder of both rp and rq are the same when divided by n. Therefore r q p nk, where k is an integer. As r and n are co-prime, -8- q p must be a multiple of n. Hence p=q. The conclusion p=q contradicts with the assumption; p and q are two different classes.
9 The contradiction shows that the assumption was wrong. Therefore the statement that no classes appear in the same row twice is proved. Q.E.D Summary If the number r labelling the row r in the multiplication table and the modulus n are co-prime, then all the classes appear in the row r, and then the shape drawn using the row r is the Eulerian circuit connecting all the vertices of the n-gon. The shape is the n-pointed star except the case with the row or n- which are the n-gon itself. The n-pointed star with the row r and the one with the row n-r are the same star. 5 Euler s totient function In the number theory, the totient n of a positive integer n is defined as the number of positive integers less than or equal to n that are co-prime to n. In particular since is co-prime to itself ( being the only natural number with this property). For example, 9 6 since the six numbers,,, 5, 7 and 8 are co-prime to 9. The function so defined is the Euler s totient function, or Euler s function. The investigation we have done in the previous section shows that the number of the different n-pointed stars can be described using Euler s function. If n=7, the positive integers which are co-prime to 7 are,,3,,5 and 6. As there are 6 such numbers the value of the Euler s function is 6. That is 7 6. There are 6 rows in which all the classes appear, in the multiplication table of modulo 7 arithmetic. Of 6 rows, the rows and 6 correspond to the 7-gon. The remaining 7 rows correspond to the stars. Two each rows are designated to the same star. Hence the number of the different stars are the half of 7. The number of the different n-pointed stars 7 calculated by the expression S S is For 0-pointed stars we can find that 0 as there are positive integers less than 0 which are co-prime to 0, namely,3,7 and 9. Therefore the number of the different 0-pointed stars is S0 0 In general, the number of the different n-pointed stars is Sn n (*)
10 If we can find the value of the Euler s function when n 360, then we can find the number of the different the 360-pointed stars S 360 S Now our problem has reduced to the finding the values of Euler s function n when n is given. How can we find the values of Euler s function then? If the only way to do so is to count the all the integers co-prime to n, our task remains as enormous as before. Is there any more efficient way? 6 Properties of the Euler s function As 7 is a prime number, the only measures of 7 are and 7 itself. All the positive integers less than 7 are co-prime to 7. Therefore the value of the Euler s function is one less than The same argument applies to any prime numbers. Therefore we get the following property. p p, where p is a prime number When n 7, the positive integers not co-prime to n must be multiples of 7. When we check the integers from in ascending order, the multiple of 7 occurs once in 7 times. 7, 7, 7 3,, The number of the positive multiples of 7 less than are co-prime to property is one seventh of The other integers As the same argument applies to the other powers of a prime number, we get the following n n p p p, where p is a prime number and n is a positive integer Now we can find the values of the Euler s function -0- n when n is a prime number or a power of a prime number without counting all the integers co-prime to n. Most difficult part of the theory is to expand the property to the n which consists of more than one prime factor. For the example of the number with more than one prime factor, let us investigate n 36. As n , n has two different prime factors: and 3. We shall look here at the remainders of the numbers when they are divided by and 9. Suppose that an integer r is co-prime to 36, say r=3. Then we get the remainders, mod, 3 5 mod Note that the remainders 3 and 5 are co-prime to the moduli and 9 respectively. Since r is co-prime to 36 two remainders must be co-prime to the moduli. There is only one integer less than 36 which is congruent to 3 modulus and is congruent to 5
11 modulus 9. The reason is as follows; Let us list all the integers less than 36 which are congruent to 3 modulus. They are: 3 3+=7 3+ = 3+ 3=5 3+ =9 3+ 5=3 3+ 6=7 3+ 7=3 3+ 8=35. As you can see, there are nine of them. The remainders of these integers when they are divided by 9 are 3,7,,6,,5,0,,8 respectively. Note that the remainders are all different. This is the consequence of the fact that the row in the multiplication table of modulo 9 arithmetic contains one (and only one) each of all the classes. Since the remainders are all different, 5 appears only once. If an integer r which is less than 36 is co-prime to 36 then the remainders a and b when r is divided by and 9 are co-prime to and 6 respectively, and conversely if r has remainders a and b co-prime to and 9 when r is divided by and 9 respectively then r is co-prime to 36 and there is only one such an integer which is less than 36. Now we have one to one correspondence between the set of all the integers less than 36 which are co-prime to 36 and the set of all the pairs of integers (a,b) co-prime to and 9 respectively. Exercise 8 Complete the table showing the correspondence of the integers co-prime to 36 and the pairs of integers co-prime to and 9 respectively. Each row is labelled by a, while each column is labelled by b. Each entry is the integer r whose remainders are a and b when divided by and 9 respectively. b a In the table, all the integers co-prime to 36 appear once. Therefore the number of the integers co-prime to 36 is the number of the integers co-prime to 9 times that of the integers co-prime to. If we remind the definition of the Euler s function we will get
12 Note that the fact that two moduli and 9 are co-prime is essential. If the two moduli are not co-prime as 3 and, the integers do not correspond to the pairs of remainders. There are twelve integers less than 36 which are congruent to modulus 3. They are,5,8,,,7,0,3,6,9,3 and 35. The remainders when divided by are,5,8,,,5,8,,,5,8, respectively. We can see that the same remainder appears three times and there are some remainders such as and 7 which do not appear in the sequence. This is because only classes appear in the row 3 in the multiplication table of the modulo arithmetic. When divided by 3 and, the pair of the remainders (,7) does not correspond to any of the integers co-prime to 36 although and 7 are co-prime to 3 and respectively. Hence the number of the pairs of the remainders is not necessarily equal to the number of the integers co-prime to Theorem If the integer n is the product of two integers a and b co-prime to each other then n ab a b 3 7 Calculating the Euler s function We discovered three important properties of Euler s function in the 6. If p is a prime number then p p n n If p is a prime number and n is an integer then If p p p a, b are the integers co-prime to each other then ab a b 3 We can now calculate any values of Euler s function making use of these properties. 0 can be found by the following procedure ()Get the prime factorization of ()Calculate value of each Euler s function of the factor with powers of one prime number. As 3 8, using the property, The factor 5 being a prime number, property shows us that 5 5 (3)Finally, the product of all the values found in () will make the value of the Euler s function. We can do so since two factors are co-prime to each other. of them Let us check our result by writing down all the integers co-prime to 0.,3,7,9,,3,7,9,,3,7,9,3,33,37 and 39. There are in fact 6 --
13 Let us find the value 360 : Exercise 9 Find the following values of the Euler s function () () 6 (3) 77 () 00 (5) The number of different n-pointed stars We can finally count the number the previous sections. The formula (*) on page 9 shows that Sn n The number of different 36-pointed star is: S The number of different 360-pointed star is: S S n of the different n-pointed stars, with all the result of We can now conclude that there are as many as 7 different 360-pointed stars. Exercise 0 Find the number of the following stars. () 5-pointed stars () 8-pointed stars (3) -pointed stars Exercise List all the possible integer n so that there is n-gon but that there are no n-pointed stars. -3-
14 Exercise List all the possible integer n so that there is only one n-pointed star. Exercise 3 List all the possible integer n so that there are just two different n-pointed stars. 9 Conclusion Connecting every r-th vertex of the n-gon, we can draw an Euler s circuit if n and r are co-prime, where n is an integer greater than and r is a positive integer less than n. Of these cases, with r= and r=n- we will draw n-gon, and otherwise we will draw an n-pointed star. The n-pointed star we draw with r is the same one as the one with n-r. The number S n of the different n-pointed stars can be found by the formula Sn n. A 8-pointed star with the row 3 In the part II, we will investigate the angles of the n-pointed stars. --
Mathematics Background
Finding Area and Distance Students work in this Unit develops a fundamentally important relationship connecting geometry and algebra: the Pythagorean Theorem. The presentation of ideas in the Unit reflects
More informationChapter 3: Theory of Modular Arithmetic 1. Chapter 3: Theory of Modular Arithmetic
Chapter 3: Theory of Modular Arithmetic 1 Chapter 3: Theory of Modular Arithmetic SECTION A Introduction to Congruences By the end of this section you will be able to deduce properties of large positive
More informationBrief 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.
More informationGraph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers & Number Systems
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics Numbers & Number Systems Introduction Numbers and Their Properties Multiples and Factors The Division Algorithm Prime and Composite Numbers Prime Factors
More informationExcerpt from "Art of Problem Solving Volume 1: the Basics" 2014 AoPS Inc.
Chapter 5 Using the Integers In spite of their being a rather restricted class of numbers, the integers have a lot of interesting properties and uses. Math which involves the properties of integers is
More informationTHE PRINCIPLE OF INDUCTION. MARK FLANAGAN School of Electrical, Electronic and Communications Engineering University College Dublin
THE PRINCIPLE OF INDUCTION MARK FLANAGAN School of Electrical, Electronic and Communications Engineering University College Dublin The Principle of Induction: Let a be an integer, and let P(n) be a statement
More informationFigure 2.1: A bipartite graph.
Matching problems The dance-class problem. A group of boys and girls, with just as many boys as girls, want to dance together; hence, they have to be matched in couples. Each boy prefers to dance with
More informationTopic 10 Part 2 [474 marks]
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
More informationInternational Mathematics TOURNAMENT OF THE TOWNS. Junior A-Level Solutions Fall 2013
International Mathematics TOURNAMENT OF THE TOWNS Junior A-Level Solutions Fall 201 1. There are 100 red, 100 yellow and 100 green sticks. One can construct a triangle using any three sticks all of different
More information(Refer Slide Time: 00:02:00)
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts
More informationCircuits 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
More informationINTRODUCTION 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
More informationGeometric Constructions
HISTORY OF MATHEMATICS Spring 2005 Geometric Constructions Notes, activities, assignment; #3 in a series. Note: I m not giving a specific due date for this somewhat vague assignment. The idea is that it
More informationBasics of Computational Geometry
Basics of Computational Geometry Nadeem Mohsin October 12, 2013 1 Contents This handout covers the basic concepts of computational geometry. Rather than exhaustively covering all the algorithms, it deals
More informationKuratowski Notes , Fall 2005, Prof. Peter Shor Revised Fall 2007
Kuratowski Notes 8.30, Fall 005, Prof. Peter Shor Revised Fall 007 Unfortunately, the OCW notes on Kuratowski s theorem seem to have several things substantially wrong with the proof, and the notes from
More information14 More Graphs: Euler Tours and Hamilton Cycles
14 More Graphs: Euler Tours and Hamilton Cycles 14.1 Degrees The degree of a vertex is the number of edges coming out of it. The following is sometimes called the First Theorem of Graph Theory : Lemma
More informationTheta Circles & Polygons 2015 Answer Key 11. C 2. E 13. D 4. B 15. B 6. C 17. A 18. A 9. D 10. D 12. C 14. A 16. D
Theta Circles & Polygons 2015 Answer Key 1. C 2. E 3. D 4. B 5. B 6. C 7. A 8. A 9. D 10. D 11. C 12. C 13. D 14. A 15. B 16. D 17. A 18. A 19. A 20. B 21. B 22. C 23. A 24. C 25. C 26. A 27. C 28. A 29.
More informationGraph 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
More informationCongruence Arithmetic
Module 4 Congruence Arithmetic Popper 4 Introduction to what is like Modulus choices Partitions by modulus Mod 5 Mod 7 Mod 30 Modular Arithmetic Addition Subtraction Multiplication INTEGERS! Mod 12 Cayley
More informationModular Arithmetic. Marizza Bailey. December 14, 2015
Modular Arithmetic Marizza Bailey December 14, 2015 Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find a quicker
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Wednesday, September 22, 2010. The syllabus will be sections 1.1 and 1.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More information1. 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
More informationTILING RECTANGLES SIMON RUBINSTEIN-SALZEDO
TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO. A classic tiling problem Question.. Suppose we tile a (large) rectangle with small rectangles, so that each small rectangle has at least one pair of sides with
More informationWhich n-venn diagrams can be drawn with convex k-gons?
Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple
More informationGraph 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,
More informationIntermediate Math Circles Wednesday, February 8, 2017 Graph Theory I
Intermediate Math Circles Wednesday, February 8, 2017 Graph Theory I Many of you are probably familiar with the term graph. To you a graph may mean a line or curve defined by a function y = f(x). It may
More informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
More information2-1 Transformations and Rigid Motions. ENGAGE 1 ~ Introducing Transformations REFLECT
2-1 Transformations and Rigid Motions Essential question: How do you identify transformations that are rigid motions? ENGAGE 1 ~ Introducing Transformations A transformation is a function that changes
More informationSlide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng
Slide Set 1 for ENEL 339 Fall 2014 Lecture Section 02 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2014 ENEL 353 F14 Section
More informationCOVERING SPACES AND SUBGROUPS OF THE FREE GROUP
COVERING SPACES AND SUBGROUPS OF THE FREE GROUP SAMANTHA NIEVEEN AND ALLISON SMITH Adviser: Dennis Garity Oregon State University Abstract. In this paper we will use the known link between covering spaces
More informationMITOCW watch?v=kvtlwgctwn4
MITOCW watch?v=kvtlwgctwn4 PROFESSOR: The idea of congruence was introduced to the world by Gauss in the early 18th century. You've heard of him before, I think. He's responsible for some work on magnetism
More informationIntegrated 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
More information1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationGraphs and networks Mixed exercise
Graphs and networks Mixed exercise E.g. 2 a, e and h are isomorphic. b and i are isomorphic. c and g are isomorphic. d and f are isomorphic. 3 a b i ii iii Pearson Education Ltd 208. Copying permitted
More information1 Counting triangles and cliques
ITCSC-INC Winter School 2015 26 January 2014 notes by Andrej Bogdanov Today we will talk about randomness and some of the surprising roles it plays in the theory of computing and in coding theory. Let
More informationInductive Reasoning: Observing Patterns to make generalizations is induction.
Inductive Reasoning Inductive Reasoning: Observing Patterns to make generalizations is induction. Geometry.1 Example: Every crow I have seen is black, therefore I generalize that all crows are black. Inferences
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationPROBLEM SET 1 SOLUTIONS MAS341: GRAPH THEORY 1. QUESTION 1
PROBLEM SET 1 SOLUTIONS MAS341: GRAPH THEORY 1. QUESTION 1 Find a Hamiltonian cycle in the following graph: Proof. Can be done by trial an error. Here we find the path using some helpful observations.
More informationMath 485, Graph Theory: Homework #3
Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the
More informationCONSTRUCTIONS Introduction Division of a Line Segment
216 MATHEMATICS CONSTRUCTIONS 11 111 Introduction In Class IX, you have done certain constructions using a straight edge (ruler) and a compass, eg, bisecting an angle, drawing the perpendicular bisector
More informationMATH CIRCLE ACTIVITY: STARS AND CYCLIC GROUPS
MATH CIRCLE ACTIVITY: STARS AND CYCLIC GROUPS. Drawing a regular star A regular star is a self-intersecting polygon which is symmetric around its center. Let s start with a concrete example. Take a circle,
More informationUNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours
UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI February 7, 009 Second Round Three Hours (1) An equilateral triangle is inscribed in a circle which is circumscribed by a square. This square is inscribed in
More information(1) Modular arithmetic
(1) Modular arithmetic In mathematics, modular arithmetic (sometimes called clock arithmetic) is a system of arithmetic for integers, where numbers "wrap يلتف حولaround " after they reach a certain value
More informationMontana City School GRADE 5
Montana City School GRADE 5 Montana Standard 1: Students engage in the mathematical processes of problem solving and reasoning, estimation, communication, connections and applications, and using appropriate
More informationThe Probabilistic Method
The Probabilistic Method Po-Shen Loh June 2010 1 Warm-up 1. (Russia 1996/4 In the Duma there are 1600 delegates, who have formed 16000 committees of 80 persons each. Prove that one can find two committees
More informationChinle USD CURRICULUM GUIDE. SUBJECT: Math GRADE: 5th TIMELINE: 4th QUARTER
Strand 1: Number and Number Sense PO 1. Determine equivalence by converting between benchmark fractions, decimals, and percents. M I will convert between fractions, decimals, and percents. Evaluation Fractions
More informationAssignment 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
More informationPRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES
UNIT 12 PRACTICAL GEOMETRY SYMMETRY AND VISUALISING SOLID SHAPES (A) Main Concepts and Results Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines,
More informationMill Hill School. 13+ Entrance Examination Mathematics. January Time: 1 hour. School: Mark: Materials required for examination
Name: School: Mark: Mill Hill School 13+ Entrance Examination Mathematics January 2014 Time: 1 hour Materials required for examination Ruler, protractor, compasses, pen, pencil, eraser Calculators must
More informationAbstract We proved in this paper that 14 triangles are necessary to triangulate a square with every angle no more than 72, answering an unsolved probl
Acute Triangulation of Rectangles Yibin Zhang Hangzhou Foreign Languages School Xiaoyang Sun Hangzhou Foreign Languages School Zhiyuan Fan Hangzhou Xuejun High School 1 Advisor Dongbo Lu Hangzhou Foreign
More informationAngles of Polygons. Essential Question What is the sum of the measures of the interior angles of a polygon?
7.1 Angles of Polygons Essential Question What is the sum of the measures of the interior angles of a polygon? The Sum of the Angle Measures of a Polygon Work with a partner. Use dynamic geometry software.
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationTWO 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
More informationAlgorithms (III) Yu Yu. Shanghai Jiaotong University
Algorithms (III) Yu Yu Shanghai Jiaotong University Review of the Previous Lecture Factoring: Given a number N, express it as a product of its prime factors. Many security protocols are based on the assumed
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationTable : IEEE Single Format ± a a 2 a 3 :::a 8 b b 2 b 3 :::b 23 If exponent bitstring a :::a 8 is Then numerical value represented is ( ) 2 = (
Floating Point Numbers in Java by Michael L. Overton Virtually all modern computers follow the IEEE 2 floating point standard in their representation of floating point numbers. The Java programming language
More informationWhat is a tessellation???? Give an example... Daily Do from last class Homework Answers 10 7 These are similar: What does y =? x =?
Daily Do from last class Homework Answers 10 7 These are similar: What does y =? x =? 36 74 0 78 0 154 o 44 48 54 o y x 154 o 78 0 12 74 0 9 1. 8 ft 2. 21m 3. 21 ft 4. 30cm 5. 6mm 6. 16 in 7. yes 9 = 7
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.6 Indirect Argument: Contradiction and Contraposition Copyright Cengage Learning. All
More informationDawood Public School Course Outline Class IV Math
Dawood Public School Course Outline 2016-2017 Class IV Math Books: Lu jitan, New Syllabus Primary Mathematics 4 along with practice books 4a and 4b, Singapore; Oxford University Monthly Syllabus for the
More informationIntroduction to Modular Arithmetic
Randolph High School Math League 2014-2015 Page 1 1 Introduction Introduction to Modular Arithmetic Modular arithmetic is a topic residing under Number Theory, which roughly speaking is the study of integers
More information4-1. Classifying Triangles. Lesson 4-1. What You ll Learn. Active Vocabulary
4-1 Classifying Triangles What You ll Learn Scan Lesson 4-1. Predict two things that you expect to learn based on the headings and the Key Concept box. 1. Active Vocabulary 2. New Vocabulary Label the
More informationCONSTRUCTION SOL PROBLEMS
Modified and Animated By Chris Headlee Dec 2011 CONSTRUCTION SOL PROBLEMS Super Second-grader Methods SOL Problems; not Dynamic Variable Problems Use scratch paper to measure AB See which line segment
More informationAQR UNIT 7. Circuits, Paths, and Graph Structures. Packet #
AQR UNIT 7 NETWORKS AND GRAPHS: Circuits, Paths, and Graph Structures Packet # BY: Introduction to Networks and Graphs: Try drawing a path for a person to walk through each door exactly once without going
More informationAnswer each of the following problems. Make sure to show your work. Points D, E, and F are collinear because they lie on the same line in the plane.
Answer each of the following problems. Make sure to show your work. Notation 1. Given the plane DGF in the diagram, which points are collinear? Points D, E, and F are collinear because they lie on the
More informationAlgorithms (III) Yijia Chen Shanghai Jiaotong University
Algorithms (III) Yijia Chen Shanghai Jiaotong University Review of the Previous Lecture Factoring: Given a number N, express it as a product of its prime factors. Many security protocols are based on the
More information7th Bay Area Mathematical Olympiad
7th Bay Area Mathematical Olympiad February 22, 2005 Problems and Solutions 1 An integer is called formidable if it can be written as a sum of distinct powers of 4, and successful if it can be written
More informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More informationGeometry Unit 6 Properties of Quadrilaterals Classifying Polygons Review
Geometry Unit 6 Properties of Quadrilaterals Classifying Polygons Review Polygon a closed plane figure with at least 3 sides that are segments -the sides do not intersect except at the vertices N-gon -
More informationARITHMETIC operations based on residue number systems
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 2, FEBRUARY 2006 133 Improved Memoryless RNS Forward Converter Based on the Periodicity of Residues A. B. Premkumar, Senior Member,
More information2 Eulerian digraphs and oriented trees.
2 Eulerian digraphs and oriented trees. A famous problem which goes back to Euler asks for what graphs G is there a closed walk which uses every edge exactly once. (There is also a version for non-closed
More informationSTANDARDS OF LEARNING CONTENT REVIEW NOTES GEOMETRY. 3 rd Nine Weeks,
STANDARDS OF LEARNING CONTENT REVIEW NOTES GEOMETRY 3 rd Nine Weeks, 2016-2017 1 OVERVIEW Geometry Content Review Notes are designed by the High School Mathematics Steering Committee as a resource for
More informationBasic 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
More informationPolygon Angle-Sum Theorem:
Name Must pass Mastery Check by: [PACKET 5.1: POLYGON -SUM THEOREM] 1 Write your questions here! We all know that the sum of the angles of a triangle equal 180. What about a quadrilateral? A pentagon?
More informationIntroduction to Programming in C Department of Computer Science and Engineering\ Lecture No. #02 Introduction: GCD
Introduction to Programming in C Department of Computer Science and Engineering\ Lecture No. #02 Introduction: GCD In this session, we will write another algorithm to solve a mathematical problem. If you
More informationSenior Math Circles Cryptography and Number Theory Week 1
Senior Math Circles Cryptography and Number Theory Week 1 Dale Brydon Feb. 2, 2014 1 One-Time Pads Cryptography deals with the problem of encoding a message in such a way that only the intended recipient
More informationMath Introduction to Advanced Mathematics
Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.
More informationVocabulary: Hubcaps, Kaleidoscopes and Mirrors
Vocabulary: Hubcaps, Kaleidoscopes and Mirrors Concept Two related ideas: Symmetry and Transformation. Symmetry is a property of some designs or shapes. A design either has symmetry or does not. For example,
More information(Refer Slide Time 3:31)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 5 Logic Simplification In the last lecture we talked about logic functions
More informationTechnische Universität München Zentrum Mathematik
Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for
More informationGraph Theory
Graph Theory 2012.04.18 Our goal today is to learn some basic concepts in graph theory and explore fun problems using graph theory. A graph is a mathematical object that captures the notion of connection.
More informationThe angle measure at for example the vertex A is denoted by m A, or m BAC.
MT 200 ourse notes on Geometry 5 2. Triangles and congruence of triangles 2.1. asic measurements. Three distinct lines, a, b and c, no two of which are parallel, form a triangle. That is, they divide the
More information13. (a) G,G. A circuit of length 1 is a loop. 14. (a) E,E. (c) A,B,C,A. 16. (a) BF, FG
13. (a) G,G. A circuit of length 1 is a loop. There are none. Such a circuit would consist of two vertices and two (different) edges connecting the vertices. 10. (a) 11. (a) C, B, A, H, F Other answers
More informationLesson 5: Identical Triangles
NS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 7 6 Classwork Opening When studying triangles, it is essential to be able to communicate about the parts of a triangle without any confusion. The following
More information2. Draw a non-isosceles triangle. Now make a template of this triangle out of cardstock or cardboard.
Tessellations The figure at the left shows a tiled floor. Because the floor is entirely covered by the tiles we call this arrangement a tessellation of the plane. A regular tessellation occurs when: The
More informationGEOMETRY BASIC GEOMETRICAL IDEAS. 3) A point has no dimensions (length, breadth or thickness).
CLASS 6 - GEOMETRY BASIC GEOMETRICAL IDEAS Geo means Earth and metron means Measurement. POINT 1) The most basic shape in geometry is the Point. 2) A point determines a location. 3) A point has no dimensions
More informationLet a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines, a line which passes through the point P
Let a line l and a point P not lying on it be given. By using properties of a transversal and parallel lines, a line which passes through the point P and parallel to l, can be drawn. A triangle can be
More informationAnd Now From a New Angle Special Angles and Postulates LEARNING GOALS
And Now From a New Angle Special Angles and Postulates LEARNING GOALS KEY TERMS. In this lesson, you will: Calculate the complement and supplement of an angle. Classify adjacent angles, linear pairs, and
More informationCh 3.4 The Integers and Division
Integers and Division 1 Ch 3.4 The Integers and Division This area of discrete mathematics belongs to the area of Number Theory. Some applications of the concepts in this section include generating pseudorandom
More informationCS195H Homework 5. Due:March 12th, 2015
CS195H Homework 5 Due:March 12th, 2015 As usual, please work in pairs. Math Stuff For us, a surface is a finite collection of triangles (or other polygons, but let s stick with triangles for now) with
More informationModule 2 Congruence Arithmetic pages 39 54
Module 2 Congruence Arithmetic pages 9 5 Here are some excellent websites that can help you on this topic: http://mathcentral.uregina.ca/qq/database/qq.09.98/kupper1.html http://nrich.maths.org/public.viewer.php?obj_id=50
More information31.6 Powers of an element
31.6 Powers of an element Just as we often consider the multiples of a given element, modulo, we consider the sequence of powers of, modulo, where :,,,,. modulo Indexing from 0, the 0th value in this sequence
More information14.1 Encoding for different models of computation
Lecture 14 Decidable languages In the previous lecture we discussed some examples of encoding schemes, through which various objects can be represented by strings over a given alphabet. We will begin this
More informationChapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition
More informationFace Width and Graph Embeddings of face-width 2 and 3
Face Width and Graph Embeddings of face-width 2 and 3 Instructor: Robin Thomas Scribe: Amanda Pascoe 3/12/07 and 3/14/07 1 Representativity Recall the following: Definition 2. Let Σ be a surface, G a graph,
More information