DOCSLIB.ORG

Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities Student Outcomes . Students find the perimeter of a triangle or quadrilateral in the coordinate plane given a description by inequalities. Students find the area of a triangle or quadrilateral in the coordinate plane given a description by inequalities by employing Green’s theorem. Lesson Notes In previous lessons, students found the area of polygons in the plane using the “shoelace” method. In this lesson, the method is given a name—Green’s theorem. Students draw polygons described by a system of inequalities, find the perimeter of the polygon, and use Green’s theorem to find the area. Classwork Opening Exercise (5 minutes) The opening exercises are designed to review key concepts of graphing inequalities. The teacher should assign them independently and circulate to assess understanding. Opening Exercise Graph the following: a. 풚 ≤ ퟕ b. 풙 > −ퟑ Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 135 This work is licensed under a This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. This file derived from GEO-M4-TE-1.3.0 -09.2015 NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY ퟏ ퟐ 풚 < 풙 − ퟒ d. 풚 ≥ − 풙 + ퟓ c. ퟐ ퟑ Example 1 (10 minutes) Example 1 A parallelogram with base of length 풃 and height 풉 can be situated in the coordinate plane, as shown. Verify that the shoelace formula gives the area of the parallelogram as 풃풉. What is the area of a parallelogram? Base × height . The distance from the 푦-axis to the top left vertex is some number 푥. What are Scaffolding: the coordinates of that vertex? If students are confused about (푥, ℎ) the coordinates, provide either . Can you determine the coordinates of the top right vertex? What do we know a graph of a parallelogram with about opposite sides of a parallelogram? the coordinates showing (more They must be equal. concrete) or a graph with at least tick marks so that . What is the length of the bottom side? students may count the 푏 units distances for base and height. So what is the length of the top side? 푏 units . The bottom side starts at the origin (where 푥 = 0); where does the top side start? Hint: What is the 푥-coordinate of the top left vertex? 푥 Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 136 This work is licensed under a This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. This file derived from GEO-M4-TE-1.3.0 -09.2015 NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY . So, if the length is 푏 units, what would the 푥-coordinate of the top right vertex be? 푥 + 푏 . So, what are the coordinates of the top right vertex? (푥 + 푏, ℎ) . List the coordinates of the vertices starting at the origin and moving counterclockwise. (0, 0), (푥, ℎ), (푥 + 푏, ℎ), and (푏, 0) . Use the shoelace formula (Green’s theorem) to find the area moving counterclockwise. 1 (0 ∙ 0 + 푏 ∙ ℎ + (푥 + 푏) ∙ ℎ + 푥 ∙ 0 − 0 ∙ 푏 − 0 ∙ (푥 + 푏) − ℎ ∙ 푥 − ℎ ∙ 0) = 2 1 1 (푏 ∙ ℎ + 푥 ∙ ℎ + 푏 ∙ ℎ − ℎ ∙ 푥) = (2(푏 ∙ ℎ)) = 푏 ∙ ℎ 2 2 Example 2 (5 minutes) Example 2 A triangle with base 풃 and height 풉 can be situated in the coordinate plane, as shown. According to Green’s theorem, what is the area of the triangle? Let students try to do this problem on their own following the steps used above. Scaffold with the following questions as MP.1 necessary. What is the area of a triangle? 1 base × height 2 . Let the distance from the 푦-axis to the top vertex be some number 푥. What are the coordinates of that vertex? (푥, ℎ) . List the coordinates of the vertices starting at the origin and moving clockwise. (0,0), (푥, ℎ), and (푏, 0) . Use the shoelace formula (Green’s theorem) to find the area moving counterclockwise. 1 1 (0 ∙ 0 + 푏 ∙ ℎ + 푥 ∙ 0 − 0 ∙ 푏 − 0 ∙ 푥 − ℎ ∙ 0) = (푏 ∙ ℎ) 2 2 . Summarize what you have learned so far with a partner. We have verified well-known formulas using Green’s theorem. Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 137 This work is licensed under a This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. This file derived from GEO-M4-TE-1.3.0 -09.2015 NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY Exercises (15 minutes) In this exercise, students work with a partner to compute the area and perimeter of a quadrilateral region in the plane defined by a set of inequalities. Have each student do one problem, parts (a) and (b), and then check in with their partner and check each other’s work. Then, do parts (c) and (d) and check in again. Students should graph the inequalities, solve pairs of inequalities to find the coordinates of the vertices, use the distance formula to find the perimeter, and apply the shoelace formula (Green’s theorem) to find the area. Exercises 1. A quadrilateral region is defined by the system of inequalities below: 풚 ≤ 풙 + ퟔ 풚 ≤ −ퟐ풙 + ퟏퟐ 풚 ≥ ퟐ풙 − ퟒ 풚 ≥ −풙 + ퟐ a. Sketch the region. b. Determine the vertices of the quadrilateral. (ퟐ, ퟖ), (ퟒ, ퟒ), (ퟐ, ퟎ), (−ퟐ, ퟒ) Ask students how they can verify the intersection points. (By showing that each set of coordinates satisfies the equations of both intersecting lines that determine the vertex.) c. Find the perimeter of the quadrilateral region. Approximately ퟐퟎ. ퟐퟔ units d. Find the area of the quadrilateral region. ퟐퟒ square units 2. A quadrilateral region is defined by the system of inequalities below: ퟓ 풚 ≤ 풙 + ퟓ 풚 ≥ 풙 − ퟒ 풚 ≤ ퟒ 풚 ≥ − 풙 − ퟒ ퟒ a. Sketch the region. Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 138 This work is licensed under a This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. This file derived from GEO-M4-TE-1.3.0 -09.2015 NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY b. Determine the vertices of the quadrilateral. (−ퟒ, ퟏ), (−ퟏ, ퟒ), (ퟖ, ퟒ), (ퟎ, −ퟒ) c. Which quadrilateral is defined by these inequalities? How can you prove your conclusion? A trapezoid is defined by these inequalities. We can prove that one pair of opposite sides is parallel. d. Find the perimeter of the quadrilateral region. The perimeter is approximately ퟑퟎ. ퟗퟔ units. e. Find the area of the quadrilateral region. The area of the quadrilateral region is ퟒퟗ. ퟓ square units. Closing (2 minutes) Gather the entire class, and ask these questions. Have students share answers. The shoelace method for finding the area of a polygon is also known as…? Green’s theorem . How did we verify the formulas for the area of a parallelogram and triangle? We used Green’s theorem with variables as coordinates to verify the known formulas. Exit Ticket (8 minutes) Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 139 This work is licensed under a This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. This file derived from GEO-M4-TE-1.3.0 -09.2015 NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY Name Date Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities Exit Ticket A quadrilateral region is defined by the system of inequalities below: 푦 ≤ 5 푦 ≥ −3 푦 ≤ 2푥 + 1 푦 ≥ 2푥 − 7 1. Sketch the region. 2. Determine the coordinates of the vertices. 3. Find the area of the quadrilateral region. Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 140 This work is licensed under a This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. This file derived from GEO-M4-TE-1.3.0 -09.2015 NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY Exit Ticket Sample Solutions A quadrilateral region is defined by the system of inequalities below: 풚 ≤ ퟓ 풚 ≥ −ퟑ 풚 ≤ ퟐ풙 + ퟏ 풚 ≥ ퟐ풙 − ퟕ 1. Sketch the region. 2. Determine the coordinates of the vertices. (ퟐ, ퟓ), (ퟔ, ퟓ), (ퟐ, −ퟑ), (−ퟐ, −ퟑ) 3. Find the area of the quadrilateral region. ퟑퟐ square units Problem Set Sample Solutions For Problems 1–2 below, identify the system of inequalities that defines the region shown. 1. ퟐ ퟏퟑ 풚 ≥ −ퟏ 풙 ≥ −ퟏ 풚 ≤ − 풙 + , , ퟑ ퟑ Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 141 This work is licensed under a This work is derived from Eureka Math ™ and licensed by Great Minds. ©2015 Great Minds. eureka-math.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. This file derived from GEO-M4-TE-1.3.0 -09.2015 NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY 2.
Load more

Recommended publications
  • CC Geometry H
    CC Geometry H Aim #8: How do we find perimeter and area of polygons in the Cartesian Plane? Do Now: Find the area of the triangle below using decomposition and then using the shoelace formula (also known as Green's theorem). 1) Given rectangle ABCD, a. Identify the vertices. b. Find the exact perimeter. c. Find the area using the area formula. d. List the vertices starting with A moving counterclockwise and apply the shoelace formula. Does the method work for quadrilaterals? 2) Calculate the area using the shoelace formula and then find the perimeter (nearest hundredth). 3) Find the perimeter (to the nearest hundredth) and the area of the quadrilateral with vertices A(-3,4), B(4,6), C(2,-3), and D(-4,-4). 4) A textbook has a picture of a triangle with vertices (3,6) and (5,2). Something happened in printing the book and the coordinates of the third vertex are listed as (-1, ). The answers in the back of the book give the area of the triangle as 6 square units. What is the y-coordinate of this missing vertex? 5) Find the area of the pentagon with vertices A(5,8), B(4,-3), C(-1,-2), D(-2,4), and E(2,6). 6) Show that the shoelace formula used on the trapezoid shown confirms the traditional formula for the area of a trapezoid: 1 (b1 + b2)h 2 D (x3,y) C (x2,y) A B (x ,0) (0,0) 1 7) Find the area and perimeter (exact and nearest hundredth) of the hexagon shown.
    [Show full text]
  • Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities
    NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities Student Outcomes . Students find the perimeter of a triangle or quadrilateral in the coordinate plane given a description by inequalities. Students find the area of a triangle or quadrilateral in the coordinate plane given a description by inequalities by employing Green’s theorem. Lesson Notes In previous lessons, students found the area of polygons in the plane using the “shoelace” method. In this lesson, we give a name to this method—Green’s theorem. Students will draw polygons described by a system of inequalities, find the perimeter of the polygon, and use Green’s theorem to find the area. Classwork Opening Exercises (5 minutes) The opening exercises are designed to review key concepts of graphing inequalities. The teacher should assign them independently and circulate to assess understanding. Opening Exercises Graph the following: a. b. Lesson 11: Perimeters and Areas of Polygonal Regions Defined by Systems of Inequalities 135 Date: 8/28/14 This work is licensed under a © 2014 Common Core, Inc. Some rights reserved. commoncore.org Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 11 M4 GEOMETRY d. c. Example 1 (10 minutes) Example 1 A parallelogram with base of length and height can be situated in the coordinate plane as shown. Verify that the shoelace formula gives the area of the parallelogram as . What is the area of a parallelogram? Base height . The distance from the -axis to the top left vertex is some number .
    [Show full text]
  • Lesson 10: Perimeter and Area of Polygonal Regions in the Cartesian Plane
    NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 10 M4 GEOMETRY Lesson 10: Perimeter and Area of Polygonal Regions in the Cartesian Plane Student Outcomes . Students find the perimeter of a quadrilateral in the coordinate plane given its vertices and edges. Students find the area of a quadrilateral in the coordinate plane given its vertices and edges by employing Green’s theorem. Classwork Opening Exercise (5 minutes) Scaffolding: . Give students time to The Opening Exercise allows students to practice the shoelace method of finding the area struggle with these of a triangle in preparation for today’s lesson. Have students complete the exercise questions. Add more individually, and then compare their work with a neighbor’s. Pull the class back together questions as necessary to for a final check and discussion. scaffold for struggling If students are struggling with the shoelace method, they can use decomposition. students. Consider providing students with pre-graphed Opening Exercise quadrilaterals with axes on Find the area of the triangle given. Compare your answer and method to your neighbor’s, and grid lines. discuss differences. Go from concrete to abstract by starting with finding the area by decomposition, then translating one vertex to the origin, and then using the shoelace formula. Post the shoelace diagram and formula from Lesson 9. Shoelace Formula Decomposition Coordinates: 푨(−ퟑ, ퟐ), 푩(ퟐ, −ퟏ), 푪(ퟑ, ퟏ) Area of Rectangle: ퟔ units ⋅ ퟑ units = ퟏퟖ square Area Calculation: units ퟏ Area of Left Rectangle: ퟕ. ퟓ square units ((−ퟑ) ∙ (−ퟏ) + ퟐ ∙ ퟏ + ퟑ ∙ ퟐ − ퟐ ∙ ퟐ − (−ퟏ) ∙ ퟑ − ퟏ ∙ (−ퟑ)) ퟐ Area of Bottom Right Triangle: ퟏ square unit Area: ퟔ.
    [Show full text]
  • 1 Introduction 2 Problems Without the Formula
    DG Kim Spokane Math Circle The Shoelace Theorem March 3rd 1 Introduction The Shoelace Theorem is a nifty formula for finding the area of a polygon given the coordinates of its vertices. In this lecture, we'll explore the Shoelace Theorem and its applications. 2 Problems without the Formula Find the areas of the following shapes: 1 DG Kim Spokane Math Circle The Shoelace Theorem March 3rd 3 Answers to Exercises 1. 4 × 4 = 16 2. 1=2 × 6 × 2 = 6 3. 6 × 4 − 1=2 × 4 × 4 = 24 − 8 = 16 4. 4 × 6 − 1=2 × 4 × 1 − 1=2 × 4 × 2 = 24 − 2 − 4 = 18 5. 8 × 3 − 1=2 × 8 × 1 = 24 − 4 = 20 4 The Cartesian Plane One quick note that you should know is about the Cartesian Plane. Cartesian Planes are in an (x; y) format. The first number in a Cartesian point is the number of spaces it goes horizontally, and the second number is the number of spaces it goes vertically. You should be able to find the Cartesian coordinates in all the diagrams that were provided earlier. 5 The Shoelace Formula! n−1 n−1 1 X X A = x y + x y − x y − x y 2 i i+1 n 1 i+1 i 1 n i=1 i=1 Okay, so this looks complicated, but now we'll look at why the shoelace formula got its name. 2 DG Kim Spokane Math Circle The Shoelace Theorem March 3rd The reason this formula is called the shoelace formula is because of the method used to find it.
    [Show full text]
  • Areas and Shapes of Planar Irregular Polygons
    Forum Geometricorum b Volume 18 (2018) 17–36. b b FORUM GEOM ISSN 1534-1178 Areas and Shapes of Planar Irregular Polygons C. E. Garza-Hume, Maricarmen C. Jorge, and Arturo Olvera Abstract. We study analytically and numerically the possible shapes and areas of planar irregular polygons with prescribed side-lengths. We give an algorithm and a computer program to construct the cyclic configuration with its circum- circle and hence the maximum possible area. We study quadrilaterals with a self-intersection and prove that not all area minimizers are cyclic. We classify quadrilaterals into four classes related to the possibility of reversing orientation by deforming continuously. We study the possible shapes of polygons with pre- scribed side-lengths and prescribed area. In this paper we carry out an analytical and numerical study of the possible shapes and areas of general planar irregular polygons with prescribed side-lengths. We explain a way to construct the shape with maximum area, which is known to be the cyclic configuration. We write a transcendental equation whose root is the radius of the circumcircle and give an algorithm to compute the root. We provide an algorithm and a corresponding computer program that actually computes the circumcircle and draws the shape with maximum area, which can then be deformed as needed. We study quadrilaterals with a self-intersection, which are the ones that achieve minimum area and we prove that area minimizers are not necessarily cyclic, as mentioned in the literature ([4]). We also study the possible shapes of polygons with prescribed side-lengths and prescribed area.
    [Show full text]
  • Lesson 10: Perimeter and Area of Polygonal Regions in the Cartesian Plane
    NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 10 M4 GEOMETRY Lesson 10: Perimeter and Area of Polygonal Regions in the Cartesian Plane Student Outcomes . Students find the perimeter of a quadrilateral in the coordinate plane given its vertices and edges. Students find the area of a quadrilateral in the coordinate plane given its vertices and edges by employing Green’s theorem. Classwork Scaffolding: Opening Exercise (5 minutes) . Give students time to The Opening Exercise allows students to practice the shoelace method of finding the area struggle with these of a triangle in preparation for today’s lesson. Have students complete the exercise questions. Add more individually, and then compare their work with a neighbor’s. Pull the class back together questions as necessary to for a final check and discussion. scaffold for struggling If students are struggling with the shoelace method, they can use decomposition. students. Consider providing students with pre-graphed Opening Exercise quadrilaterals with axes on Find the area of the triangle given. Compare your answer and method to your neighbor’s and grid-lines. discuss differences. Go from concrete to abstract by starting with finding the area by decomposition, then translating one vertex to the origin, then using the shoelace formula. Post shoelace diagram and formula from Lesson 9. Shoelace Formula Decomposition Coordinates: Area of Rectangle: square units Area Calculation: Area of Left Rectangle: square units Area of Bottom Right Triangle: square unit ( ) Area of Top Right Triangle: square units Area: square units Area of Shaded Triangle: square units Lesson 10: Perimeter and Area of Polygonal Regions in the Cartesian Plane Date: 124 This work is licensed under a © 2014 Common Core, Inc.
    [Show full text]
  • And Generalization of Shoelace Algorithm Usage in Convex Polygon
    A new approach (extra vertex) and generalization of Shoelace Algorithm usage in convex polygon (Point-in-Polygon) Rakhmanov Ochilbek Department of Computer Science Nile University of Nigeria Abuja, Nigeria [email protected] Abstract- In this paper we aim to bring new approach into Of course, the shape of polygon is also important in usage of Shoelace Algorithm for area calculation in convex application of those methods. Some will show high polygons on Cartesian coordinate system, with concentration efficiency only for convex polygons, but may not do same on point in polygon concept. Generalization of usage of the for concave polygons. While others can deal with concave concept will be proposed for line segment and polygons. polygons, but time complexity may increase. Testing of new method will be done using Python language. Results of tests show that the new approach is more effective This paper aims to bring a new approach to “Sum of than the current one. area” method in a way of calculation and coding. Generalization of usage of this method will be proposed as Keywords— Shoelace Algorithm, Point in polygon, Area of well. Python will be used as a medium for tests. polygon, Python The well-known shoelace algorithm (shoelace formula) is used to calculate the area related problems in polygons. The I. INTRODUCTION algorithm is called so, since it looks like a shoelace during Point-in-polygon (PiP) is one of the fundamental cross product calculation of matrix. It was proposed by operations of Geographic Information Systems. Yet, Gauss, in 1795 [2]. The basic idea be-hind the algorithm is to nowadays this concept is also getting big attention in divide the polygon into triangles and calculate sum of area of graphical programming, mobile game programming, and all formed triangles.
    [Show full text]
  • Volume 18 2018
    FORUM GEOMETRICORUM A Journal on Classical Euclidean Geometry and Related Areas published by Department of Mathematical Sciences Florida Atlantic University FORUM GEOM Volume 18 2018 http://forumgeom.fau.edu ISSN 1534-1188 Editorial Board Advisors: John H. Conway Princeton, New Jersey, USA Julio Gonzalez Cabillon Montevideo, Uruguay Richard Guy Calgary, Alberta, Canada Clark Kimberling Evansville, Indiana, USA Kee Yuen Lam Vancouver, British Columbia, Canada Tsit Yuen Lam Berkeley, California, USA Fred Richman Boca Raton, Florida, USA Editor-in-chief: Paul Yiu Boca Raton, Florida, USA Editors: Eisso J. Atzema Orono, Maine, USA Nikolaos Dergiades Thessaloniki, Greece Roland Eddy St. John’s, Newfoundland, Canada Jean-Pierre Ehrmann Paris, France Chris Fisher Regina, Saskatchewan, Canada Rudolf Fritsch Munich, Germany Bernard Gibert St Etiene, France Antreas P. Hatzipolakis Athens, Greece Michael Lambrou Crete, Greece Floor van Lamoen Goes, Netherlands Fred Pui Fai Leung Singapore, Singapore Daniel B. Shapiro Columbus, Ohio, USA Man Keung Siu Hong Kong, China Peter Woo La Mirada, California, USA Li Zhou Winter Haven, Florida, USA Technical Editors: Yuandan Lin Boca Raton, Florida, USA Aaron Meyerowitz Boca Raton, Florida, USA Xiao-Dong Zhang Boca Raton, Florida, USA Consultants: Frederick Hoffman Boca Raton, Floirda, USA Stephen Locke Boca Raton, Florida, USA Heinrich Niederhausen Boca Raton, Florida, USA Table of Contents Stefan Liebscher and Dierck-E. Liebscher, The relativity of conics and circles,1 Carl Eberhart, Revisiting the quadrisection problem of Jacob Bernoulli,7 C. E. Garza-Hume, Maricarmen C. Jorge, and Arturo Olvera, Areas and shapes of planar irregular polygons,17 √ Samuel G. Moreno and Esther M. Garc´ıa–Caballero, Irrationality of 2:Yet another visual proof,37 Manfred Pietsch, Two hinged regular n-sided polygons, 39–42 Hiroshi Okumura, A remark on the arbelos and the regular star polygon,43 Lubomir P.
    [Show full text]
  • Superior Mathematics from an Elementary Point of View ” Course Notes Jacopo D’Aurizio
    ” Superior Mathematics from an Elementary point of view ” course notes Jacopo d’Aurizio To cite this version: Jacopo d’Aurizio. ” Superior Mathematics from an Elementary point of view ” course notes. Master. Italy. 2017. cel-01813978 HAL Id: cel-01813978 https://cel.archives-ouvertes.fr/cel-01813978 Submitted on 12 Jun 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. \Superior Mathematics from an Elementary point of view" course notes Undergraduate course, 2017-2018, University of Pisa Jack D'Aurizio Contents 0 Introduction 2 1 Creative Telescoping and DFT 3 2 Convolutions and ballot problems 15 3 Chebyshev and Legendre polynomials 30 4 The glory of Fourier, Laplace, Feynman and Frullani 40 5 The Basel problem 60 6 Special functions and special products 70 7 The Cauchy-Schwarz inequality and beyond 97 8 Remarkable results in Linear Algebra 121 9 The Fundamental Theorem of Algebra 125 10 Quantitative forms of the Weierstrass approximation Theorem 133 11 Elliptic integrals and the AGM 137 12 Dilworth, Erdos-Szekeres, Brouwer and Borsuk-Ulam's Theorems 147 13 Continued fractions and elements of Diophantine Approximation 158 14 Symmetric functions and elements of Analytic Combinatorics 173 15 Spherical Trigonometry 183 0 Introduction This course has been designed to serve University students of the first and second year of Mathematics.
    [Show full text]
  • Form Distance Distributions in Arbitrarily Shaped Polygons with Arbitrary Reference Point Ross Pure Salman Durrani
    The Mathematica® Journal Computing Exact Closed- Form Distance Distributions in Arbitrarily Shaped Polygons with Arbitrary Reference Point Ross Pure Salman Durrani We propose and implement an algorithm to compute the exact cumulative density function (CDF) of the distance from an arbitrary reference point to a randomly located node within an arbitrarily shaped (convex or concave) simple polygon. Using this result, we also obtain the closed-form probability density function (PDF) of the Euclidean distance between an arbitrary reference point and its ith neighbor node when N nodes are uniformly and independently distributed inside the arbitrarily shaped polygon. The implementation is based on the recursive approach proposed by Ahmadi and Pan [1] in order to obtain the distance distributions associated with arbitrary triangles. The algorithm in [1] is extended for arbitrarily shaped polygons by using a modified form of the shoelace formula. This modification allows tractable computation of the overlap area between a disk of radius r centered at the arbitrary reference point and the arbitrarily shaped polygon, which is a key part of the implementation. The obtained distance distributions can be used in the modeling of wireless networks, especially in the context of emerging ultra-dense small cell deployment scenarios, where network regions can be arbitrarily shaped. They can also be applied in other branches of science, such as forestry, mathematics, operations research, and material sciences. The Mathematica Journal 17 © 2015 Wolfram Media, Inc. 2 Ross Pure and Salman Durrani ■ 1. Introduction Wireless networks are generally modeled as a finite region in Euclidean space (this article considers those regions that are simple polygons in two-dimensional Euclidean space ℝ2) with nodes independently and uniformly distributed throughout the region.
    [Show full text]
  • Competitive Programmer's Handbook
    Competitive Programmer’s Handbook Antti Laaksonen Draft August 19, 2019 ii Contents Preface ix I Basic techniques 1 1 Introduction 3 1.1 Programming languages . .3 1.2 Input and output . .4 1.3 Working with numbers . .6 1.4 Shortening code . .8 1.5 Mathematics . 10 1.6 Contests and resources . 15 2 Time complexity 17 2.1 Calculation rules . 17 2.2 Complexity classes . 20 2.3 Estimating efficiency . 21 2.4 Maximum subarray sum . 21 3 Sorting 25 3.1 Sorting theory . 25 3.2 Sorting in C++ . 29 3.3 Binary search . 31 4 Data structures 35 4.1 Dynamic arrays . 35 4.2 Set structures . 37 4.3 Map structures . 38 4.4 Iterators and ranges . 39 4.5 Other structures . 41 4.6 Comparison to sorting . 44 5 Complete search 47 5.1 Generating subsets . 47 5.2 Generating permutations . 49 5.3 Backtracking . 50 5.4 Pruning the search . 51 5.5 Meet in the middle . 54 iii 6 Greedy algorithms 57 6.1 Coin problem . 57 6.2 Scheduling . 58 6.3 Tasks and deadlines . 60 6.4 Minimizing sums . 61 6.5 Data compression . 62 7 Dynamic programming 65 7.1 Coin problem . 65 7.2 Longest increasing subsequence . 70 7.3 Paths in a grid . 71 7.4 Knapsack problems . 72 7.5 Edit distance . 74 7.6 Counting tilings . 75 8 Amortized analysis 77 8.1 Two pointers method . 77 8.2 Nearest smaller elements . 79 8.3 Sliding window minimum . 81 9 Range queries 83 9.1 Static array queries .
    [Show full text]
  • Notes on Euclidean Geometry Kiran Kedlaya Based On
    Notes on Euclidean Geometry Kiran Kedlaya based on notes for the Math Olympiad Program (MOP) Version 1.0, last revised August 3, 1999 c Kiran S. Kedlaya. This is an unfinished manuscript distributed for personal use only. In particular, any publication of all or part of this manuscript without prior consent of the author is strictly prohibited. Please send all comments and corrections to the author at [email protected]. Thank you! Contents 1 Tricks of the trade 1 1.1 Slicing and dicing . 1 1.2 Angle chasing . 2 1.3 Sign conventions . 3 1.4 Working backward . 6 2 Concurrence and Collinearity 8 2.1 Concurrent lines: Ceva’s theorem . 8 2.2 Collinear points: Menelaos’ theorem . 10 2.3 Concurrent perpendiculars . 12 2.4 Additional problems . 13 3 Transformations 14 3.1 Rigid motions . 14 3.2 Homothety . 16 3.3 Spiral similarity . 17 3.4 Affine transformations . 19 4 Circular reasoning 21 4.1 Powerofapoint.................................. 21 4.2 Radical axis . 22 4.3 The Pascal-Brianchon theorems . 24 4.4 Simson line . 25 4.5 Circle of Apollonius . 26 4.6 Additional problems . 27 5 Triangle trivia 28 5.1 Centroid . 28 5.2 Incenter and excenters . 28 5.3 Circumcenter and orthocenter . 30 i 5.4 Gergonne and Nagel points . 32 5.5 Isogonal conjugates . 32 5.6 Brocard points . 33 5.7 Miscellaneous . 34 6 Quadrilaterals 36 6.1 General quadrilaterals . 36 6.2 Cyclic quadrilaterals . 36 6.3 Circumscribed quadrilaterals . 38 6.4 Complete quadrilaterals . 39 7 Inversive Geometry 40 7.1 Inversion .
    [Show full text]