The Platonic solids The five regular polyhedra

Size: px
Start display at page:

Download "The Platonic solids The five regular polyhedra"

Transcription

1 The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7

2 Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral agle i a regular pyramid.... Evaluatio of the dihedral agles ad the radii i the iscribed ad circumscribed spheres of the five regular polyhedra...6. The Tetrahedro Surface ad the volume of the tetrahedro...8. The Cube...9. The Octahedro Surface ad the volume of the octahedro.... The Dodecahedro..... Surface ad the volume of the dodecahedro.... The Icosahedro..... Surface ad the volume of the icosahedro...

3 The five regular polyhedra. Polygos A polygo is a closed curve, where the border cosists of straight lie segmets. Well kow examples are triagles, rectagles ad petagos. The straight lie segmets are the sides or edges of the polygo, ad the itersectio of sides are the corers or the agles of the polygo. The polygo is covex if oe of the agles are greater tha 8. The sum of the agles i a -sided polygo is ( - 8 or ( - π. This is straightforward to verify, oce you kow that the sum of the agles i a triagle is 8. That this is actually the case ca be verified from the two figures below. We oly have to apply three axioms (from Euclid s elemets.. Whe two parallel lies are itersected by a third lie, the correspodig agles of itersectio are equal.. For a give lie ad a give poit outside the lie, you may oly draw oe lie through the poit parallel to the give lie.. Whe two lies itersect, the opposite agles at the itersectio poit are equal. The figure shows a triagle ABC, which is redraw, ow with a lie through B, parallel to AB (axiom. By applyig axiom ad, we ca verify that the three agles above B are equal to the three agles i the triagle, ad their sum is 8. Sice a -sided polygo may always be divided ito a - side polygo ad a triagle the formula ( - 8 for the sum of the agles i a -sided polygo follows. A polygo is regular if all sides are equal ad all agles are equal. The agle i a regular polygo with corers is therefore. ( 8 6 (. v 8 ( Which shows e.g. That the agle i a regular triagle is ( 6, ad the agle i a regular petago is ( 8. A polyhedro is a closed solid, where the surface is built by regular polygos. The simplest polyhedro is the tetrahedro, cosistig of four regular triagles.. Topologically cosideratios The famous polyhedro theorem, first discovered by Euler is most ofte prove i topology.

4 The five regular polyhedra So we wish to map the surface of the polyhedro to a sphere, which circumvets the polyhedro. This will result i a closed et o the sphere, cosistig of masks (m, correspodig to the polygos i the polyhedro, cords (s correspodig to edges of the polygos ad kots (k correspodig to the corers of the polyhedra. We are iterested i trasformig the topological properties of the et to the same topological properties of the polyhedro. Topological properties are properties, that are ivariat upo a cotiuous oe-to-oe mappig (fuctio (ijective mappig. Such a fuctio is called a homeomorphism. Ijectivity of a mappig f from a set A ito a set B implies that to each elemet x i A correspods exactly oe elemet y = f(x i B (f is a fuctio, ad that to each elemet y i B correspods exactly oe elemet x = f - (x i A. Two sets which are geerated by each other by a homeomorphism are said to be topologically equivalet. A simple sectio of a curve is topologically equivalet to a straight lie sectio. Ay closed curve is topologically equivalet to a circle, ad ay piece of a flat sectio is topologically equivalet to a circular disc. Below are show three figures of which all of them are topologically equivalet to a circle. O the figure below E, F ad Y are topologically equivalet, while G ad Z are topologically equivalet, ad W ad X are topologically equivalet.. Euler s polyhedro theorem By a et o a sphere we uderstad a system cosistig of a fiite umber of flat pieces ad a fiite umber of curve pieces, which are deoted masks ad cords respectively, which fulfil the followig coditios.. Every poit o the sphere belogs to at least oe mask (iclusive its border, ad two differet masks do ot have ay iteral poits i commo.. The border of each mask is composed of cords. A poit lyig o a cord is ot a iteral poit, (that is, ot a ed poit of ay other cord or of ay mask

5 The five regular polyhedra To the left is show a et o a sphere, cosistig of masks, cords ad kots. A kot is the ed poit of a cord. The coditios, imply that o the border of each mask i a et there exits at least two kots, ad that every kot i a et lies o the border of exactly two masks. We shall first cosider a simple et cosistig of oly two masks, as show o the secod figure. The oe mask is the oe that you see, ad the secod mask is what is left over o the sphere. Both masks (m are cofied by the same cords (s, ad the same kots (k. Furthermore s = k, sice each cord coects two kots, ad each kot has two cords attached to it. Sice s =k, ad there are two masks, the followig relatio must hold for this most simple et. (. m + k s = I the ext figure we have created a ew mask by drawig a cord with p kots betwee A ad B, i the ier of the mask. I this maer we have added p kots, mask ad p+ cords, which meas that (. is uchaged, as demostrated below. m + + k +p (s + p + = m + k s = I the last figure, we have doe the same, but ow where the cord from A to B lies outside the mask, but it is easily coceived that the result (. is uchaged. What we realize is, that wheever we add a mask to a et, subdued to the coditios, the equatio (. is uchaged. We may the create the etire et (o the figure to the left by addig the masks show, oe by oe. The relatio (. will hold for the complete et, ad therefore for ay et o a sphere that comply to the coditios. If a sphere ecloses a polyhedro, the a cetral projectio of the polyhedro from the cetre of the sphere to the surface of the sphere will be a homeomorphism, which coserves the topology. The sides i the polyhedro, the corers of the polyhedro ad the flat pieces i the polyhedro will correspod to the cords, kots ad the masks of the et with respect to their umbers ad topological relatios. Cosequetly the same relatios betwee sides, corers ad flat pieces (polygos of the polyhedro will hold true as for the cords, kot ad masks of the et. This leads to Euler s Polyhedro theorem. For ay polyhedro, that is homeomorph with a et o a sphere, holds true that the umber of flat pieces (polygos (m, plus the umber of corers (k, mius the umber of cords(s are equal to. (. m + k s =

6 The five regular polyhedra. Regular ets o a sphere A et o a sphere is called regular if there exits two umbers λ ad μ, both beig at least, ad such that, from each kot leaves λ cords, ad the border of each mask cosists of μ cords. We cosider a regular et o a sphere, where the masks (m, kots (k ad cords (s bear the same meaig as before. Sice every mask is limited by μ cords, ad each cord belog to two masks, the followig must hold. m k s ad s Which we rewrite as. m s ad s k Whe isertig these expressios ito Euler s polyhedro theorem m + k s =, we get: Ad by divisio by s: (. s s s s Leadig to the iequality: From which follows that both umbers λ ad μ caot be greater tha, as Furthermore it follows, that oe of the umbers λ ad μ ca be greater tha, sice they are at least ad: 6 A polyhedro is regular, if it cosists of cogruet regular polygos, so that all agles ad all sides i the polygo are equal. For a regular polyhedro, oe ca easily covice oeself that there are oly possibilities for a regular polyhedro, show below i the table (. λ μ s m k polyhedro 6 Tetrahedro 6 8 Cube Dodecahedro 8 6 Octahedro Icosahedro

7 The five regular polyhedra. The dihedral agle i a regular pyramid Aimig at calculatig the dihedral agle, that is, the agle betwee two adjacet polygos which form the regular polyhedro, we shall first fid the dihedral agle i a regular pyramid. Cocerig the tetrahedro, cube ad octahedro this ca be doe usig plae geometry, but for the dodecahedro ad the icosahedro, it is ot possible, sice I have foud o referece to the issue i the mathematical literature. I have however foud a referece to the subject i a mathematical textbook used for the. year of the Daish 9 grade high school (gymasium, but it ivolves spherical geometry i a fairly advaced level. The trick is to itersect a corer at the base of a pyramid by a sphere, havig its cetre at a corer of the base of the pyramid. The poit of doig this is of course that ay corer of a polyhedro ca be cut of to form a regular pyramid. I the two drawigs below is show a corer of a regular pyramid, havig -corer surfaces ad - edges. The top agle i the pyramid is deoted v ad the dihedral agle is φ. As the corer surfaces are isosceles, the agle betwee a side i the corer surface ad a side i the base is ( v v. From the corer O is draw a sphere that itersects the pyramid i the two corer surfaces as well as i the base. So the sphere itersects the pyramid i the two great circle arcs AC ad BC, ad it itersects the base i the great circle arc AB, which accordig to (. is equal to AB =. The arcs AC = BC = v are the agles i the isosceles triagle, which has the top agle v. The arcs AC, BC, AB form a spherical triagle with AC = v, BC = v, AB =, ad where C = φ is the dihedral agle of the pyramid. The dihedral agle ca the be foud from the spherical triagle ABC, where we first write the cosie-relatio i the familiar form, usig the sides a, b, c, correspodig to the agles A, B, C. cos c cos a cosb si asi b cosc cos AB cos BC cos AC si BC si AC cos cos( cos( vcos( v si( vsi( v v cos( si ( cos ( cos v cos( si ( cos v cos ( v cos Spherical Geometry

8 The five regular polyhedra 6 cos From the formula: si, derived from cos x si x, we get whe isertig the expressio for cos φ. si v cos( si ( ( v cos ( v cos ( cos( cos v ( si ( v cos( cos ( v Where we have applied the relatio: cos x si x, ad the formula: cos x cos x cos x cos x I the umerator of the square root. Thus we fid: (. cos( si cos( v. Evaluatio of the dihedral agles ad the radii i the iscribed ad circumscribed spheres of the five regular polyhedra The dihedral agle is the agle betwee two adjacet polygos. If oe cuts a corer of a polyhedro alog the edges of the corer oe has a regular pyramid, where the top agle is the agle i the regular polygos, that costitute the polyhedro, ad where the sides i the base i the pyramid ca be foud from the regular polygo, ad where the pyramid has the same dihedral agle as the regular polyhedro! This is illustrated below for a dodecahedro ad a icosahedro. We start out from (. cos( si cos( v the umber of sides i the pyramid, beig same as the umber of edges from a corer of a regular polyhedro, ad as we i sectio deoted by λ. The umber of corers i the polygos that costitutes the polyhedro we have previously deoted μ.

9 The five regular polyhedra 7 I the formula (. ½v is half the top agle i the pyramid, beig the same as the agle i the regular polygo that costitutes the polyhedro Accordig to (. v. With these otatios, we fid for the half of the dihedral agle: cos( (. si cos( => si cos( si( The values for λ ad μ are give i table (., which we for coveiece repeat below. λ μ s m k polyhedro 6 Tetrahedro 6 8 Cube Dodecahedro 8 6 Octahedro Icosahedro. The Tetrahedro Accordig to the table above (, (,, ad we fid for the dihedral agle. (. si tetrahedro cos( si( 7,,7 The dihedro ad the radii for the iscribed ad circumscribed spheres may relatively easy be calculated usig plae trigoometry. Below is show a tetrahedro, where some lies have bee draw to that purpose. To the right, the triagle ABC has bee extracted, which is used to calculate the radii of the iscribed ad circumscribed spheres. For symmetry reasos the heights i a regular triagle are also the medias of the triagle. If you draw the height from a corer, the the bottom poit will lie i the itersectio poit of the heights i the base triagle.

10 The five regular polyhedra 8 The cetres for the iscribed ad circumscribed spheres, will lie i the commo itersectio of the three heights from the corers. For simplicity we shall put the legth of the side i the polyhedra equal to. The height i the regular triagles ca be foud from Pythagoras: h FB ( From ΔABF we fid the dihedral agle, by drawig the height from B to the opposite edge at G. AG (. si. 7 tetrahedro 7. AB To determie the radii r ad R of the iscribed ad circumscribed spheres, we apply the two oe agled triagles ABC ad AOD. Here AB h ad sice the itersectio poit of the medias divides the media i the fractio : the: AD AB. 6 Furthermore: AC AF FC ( From the two oe agled triagles ABC ad AOD, we thus fid, sice R : r :. (. AO AB AD AC 6 r R 8 The last equatio because O divides AC i the same proportio as D divides AB. R.. Surface ad the volume of the tetrahedro The plae surface ad the volume of the tetrahedro, ca rather easily be determied, but this time we put the legth of the edge to a. R The area of the regular triagle is T ah a, ad the surface of the triagles is therefore: O tetrahedro a The volume of a pyramid is as it is well kow / height of the pyramid times the area of the base. We have the height AC a, ad the volume becomes: V tetrahedro a a a

11 The five regular polyhedra 9. The Cube The dihedral agle of the cube is 9, which also ca be calculated from the formula (. (. si cos( cos( si with (, (,. cos( 9 cube si( We put the legth of the side i the polygos to. I this case it is very easy to determie the radii r ad R of the iscribed ad circumscribed spheres, sice their cetre is the cetre of symmetry, so the radius of the iscribed sphere is. (.6 r The radius of the circumscribed sphere is simply half the diagoal BE. The diagoal of the square is: BH, ad therefore: BE BH EH, so (.7 The surface ad volume of the cube are of course: O Cube = 6a ad V Cube = a R BE. The Octahedro O the figure to the left is show a octahedro. We wish to determie the dihedral agle φ ad the radii r ad R of the iscribed ad circumscribed spheres. I the figure to the left, we have draw the height h from E o BC i the regular triagle BCE, ad we have draw the height h from E o ABCD. The cetre O the iscribed ad circumscribed spheres, lies for symmetry reasos i the cetre of the square ABCD. We fid the half dihedral agle as the agle OFE. EF ( ad Thus we fid: OF OF (.8 cos si 9, 8 9 EF This may be compared with the formula (. cos( si si( med (, (,.

12 The five regular polyhedra si cos( si( Radius i circumscribed sphere is simply half the diagoal of the square ABCD. (.9 R Radius r i the iscribed sphere ca be determied from the triagle OFG, where r = OG, sice the poit of cotact with the sides must be placed i the itersectio poit of the medias (ad the heights of the regular triagle. We therefore have: FG EF. We the get from the right agle triagle OFG: (. r ( ( Surface ad the volume of the octahedro The surface of the octahedro is simply 8 times the area of a regular triagle ad the volume of the octahedro is times the volume of a regular -sided pyramid with base area a. The height of the pyramid equals the radius i the circumscribed sphere. O octahedro. The Dodecahedro 9 8 a a ad V octahedro =,8 a a

13 The five regular polyhedra As remarked earlier, there is probablyo way to fid the dihedral agle, ad cosequetly the radii i the iscribed ad circumscribed spheres from elemetary trigoometry. We therefore resort to formula (.. cos( si with (, (, si( cos( (. si v v 6, 6. si( To determie radii i the iscribed ad circumscribed spheres, we eed to kow the distace r from the cetre of the iscribed ad circumscribed circle of the regular petago to the side, ad the distace R from this cetre to a corer of the petago. As previously, we put the side of the petago to. ( 8 The agle of the petago is 8, ad half the agle is therefore. The cetre agle to a side is therefore 7, ad its half is 6. From the drawig of the petago at the top to the right is see: R (.8 og r ta (.69 si 6 si 6 Radius i the iscribed sphere is determied by the. figure above to the left, which shows a sectio of the dodecahedro, with two petagos itersectig with the dihedral agle. We have draw the two perpediculars from the cetre O for the sphere o the two petagos havig the commo edge DE. The agle ACB is equal to the dihedral agle v of the dodecahedro ad the agle O is O =8 v. The agle AOC is therefore 9 - ½v. The radius r = OA=OB, ad from the triagle AOC is see (. r r ta( 9 v r r ta v (.69 ta 8,. From the triagle ADO, show at the figure to the right, we fid: (. R r r (... Surface ad the volume of the dodecahedro The plae surface of the dodecahedro ca be determied as times the area of a regular petago which is times a triagular sectio with the side a: r a a a ta T petago O dodecahedro ta a I the same maer, the volume determied as times the volume of a regular petago pyramid with a height equal to the radius of the iscribed sphere.

14 The five regular polyhedra V dodecahedro a ar a ta r ta. The Icosahedro As it is the case with the dodecahedro, it is ot possible to determie the dihedral agle of the icosahedro from pure geometry. We therefore use the formula (.. cos( si si( med (, (,. cos( v cos 6 (. si v 8.. si( si 6 Cocerig the radii of the iscribed ad circumscribed spheres, we shall apply the same method as we did for the dodecahedro. r = AC is the radius of the iscribed circle i the regular triagle. r = h 6. R AD is the radius i the circumscribed circle i the regular triagle. From the triagle OAC is see: v r (. r r si(9 r (.8 v cos Ad from the triagle OAD is see: (.6 R OA ( h r. 88 R h.. Surface ad the volume of the icosahedro The plae surface ad the volume of the icosahedro are determied i the same maer as for the dodecahedro, as times the area of the regular triagle, ad times the volume of a sided pyramid with the height equal to the radius of the iscribed sphere. O V a i cos ahedro a i cos ahedro r a a a a v v cos cos

15 The five regular polyhedra V i cos ahedro 9 6 cos This eds our treatmet of the five regular polyhedra. v a

Visualization of Gauss-Bonnet Theorem

Visualization of Gauss-Bonnet Theorem Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Area As A Limit & Sigma Notation

Area As A Limit & Sigma Notation Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Counting Regions in the Plane and More 1

Counting Regions in the Plane and More 1 Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o

More information

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES INTERNATIONAL JOURNAL OF GEOMETRY Vol. 2 (2013), No. 1, 5-22 INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES NENAD U. STOJANOVIĆ Abstract. If above each side of a regular polygo

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

1. Sketch a concave polygon and explain why it is both concave and a polygon. A polygon is a simple closed curve that is the union of line segments.

1. Sketch a concave polygon and explain why it is both concave and a polygon. A polygon is a simple closed curve that is the union of line segments. SOLUTIONS MATH / Fial Review Questios, F5. Sketch a cocave polygo ad explai why it is both cocave ad a polygo. A polygo is a simple closed curve that is the uio of lie segmets. A polygo is cocave if it

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

GEOMETRY AREA UNIT. Day I Area Review. Triangle Parallelogram Rectangle. A b h. Square Trapezoid Kite. b 2. b 1. 1 Atrapezoid h b1 b2

GEOMETRY AREA UNIT. Day I Area Review. Triangle Parallelogram Rectangle. A b h. Square Trapezoid Kite. b 2. b 1. 1 Atrapezoid h b1 b2 GEOMETRY RE UNIT Day I Review Objectives: SWBT fid the area of various shapes Triagle Parallelogram Rectagle triagle base height b h parallelog ram base height b h recta gle base height b h Square Trapezoid

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

Convex hull ( 凸殻 ) property

Convex hull ( 凸殻 ) property Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

ABOUT A CONSTRUCTION PROBLEM

ABOUT A CONSTRUCTION PROBLEM INTERNATIONAL JOURNAL OF GEOMETRY Vol 3 (014), No, 14 19 ABOUT A CONSTRUCTION PROBLEM OVIDIU T POP ad SÁNDOR N KISS Abstract I this paper, we study the costructio of a polygo if we kow the midpoits of

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

CONVERGENCE OF THE RATIO OF PERIMETER OF A REGULAR POLYGON TO THE LENGTH OF ITS LONGEST DIAGONAL AS THE NUMBER OF SIDES OF POLYGON INCREASES

CONVERGENCE OF THE RATIO OF PERIMETER OF A REGULAR POLYGON TO THE LENGTH OF ITS LONGEST DIAGONAL AS THE NUMBER OF SIDES OF POLYGON INCREASES CONVERGENCE OF THE RATIO OF PERIMETER OF A REGULAR POLYGON TO THE LENGTH OF ITS LONGEST DIAGONAL AS THE NUMBER OF SIDES OF POLYGON INCREASES Pawa Kumar Bishwakarma Idepedet Researcher Correspodig Author:

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra 1 Mathematics ad Art Activity - Basic Plae Tessellatio with GeoGebra Worksheet: Explorig Regular Edge-Edge Tessellatios of the Cartesia Plae ad the Mathematics behid it. Goal: To eable Maths educators

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com) wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

Graphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)

Graphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU) Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Reading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended:

Reading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended: Readig Recommeded: Stollitz, DeRose, ad Salesi. Wavelets for Computer Graphics: Theory ad Applicatios, 996, sectio 6.-6.3, 0., A.5. Subdivisio curves ad surfaces Note: there is a error i Stollitz, et al.,

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s-

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s- PROPERTIES OF REGULAR POLYGONS The simplest D close figures which ca be costructe by the cocateatio of equal legth straight lies are the regular polygos icluig the equilateral triagle, the petago, a the

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

Content: Learning Area: Mathematics. Integration: Grade: 9. Lesson: Module 2: Algebra and geometry. Teaching methods and Lesson Progression:

Content: Learning Area: Mathematics. Integration: Grade: 9. Lesson: Module 2: Algebra and geometry. Teaching methods and Lesson Progression: Learig Area: Mathematics Lesso: Module 2: Algebra ad geometry Grade: 9 Itegratio: Cotet: Duratio: Date/Week: Learig LEARNING UNIT 1 - ASSESSMENT Multiply ad divide polyomials umbers ad their relatioships,

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

27 Refraction, Dispersion, Internal Reflection

27 Refraction, Dispersion, Internal Reflection Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

Intermediate Statistics

Intermediate Statistics Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Apparent Depth. B' l'

Apparent Depth. B' l' REFRACTION by PLANE SURFACES Apparet Depth Suppose we have a object B i a medium of idex which is viewed from a medium of idex '. If '

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

Spherical Mirrors. Types of spherical mirrors. Lecture convex mirror: the. geometrical center is on the. opposite side of the mirror as

Spherical Mirrors. Types of spherical mirrors. Lecture convex mirror: the. geometrical center is on the. opposite side of the mirror as Lecture 14-1 Spherical Mirrors Types of spherical mirrors covex mirror: the geometrical ceter is o the opposite side of the mirror as the object. cocave mirror: the geometrical ceter is o the same side

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

COMPACT HYPERBOLIC COXETER THIN CUBES

COMPACT HYPERBOLIC COXETER THIN CUBES vailable olie at http://scik.org g. Math. Lett. 014, 014:18 ISSN: 049-97 OMPT HYPROLI OXTR THIN US PRN KLIT 1,*, N IHITR KLIT 1 epartmet of Mathematics, auhati Uiversity, uwahati-781014, ssam, Idia epartmet

More information

Hyperbolic polygonal spirals

Hyperbolic polygonal spirals Rose- Hulma Udergraduate Mathematics Joural Hyperbolic polygoal spirals Jillia Russo a Volume 11, No., Fall, 010 Sposored by Rose-Hulma Istitute of Techology Departmet of Mathematics Terre Haute, IN 47803

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Some cycle and path related strongly -graphs

Some cycle and path related strongly -graphs Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i

More information

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed. MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

A study on Interior Domination in Graphs

A study on Interior Domination in Graphs IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

CS Polygon Scan Conversion. Slide 1

CS Polygon Scan Conversion. Slide 1 CS 112 - Polygo Sca Coversio Slide 1 Polygo Classificatio Covex All iterior agles are less tha 180 degrees Cocave Iterior agles ca be greater tha 180 degrees Degeerate polygos If all vertices are colliear

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30.

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30. Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. COS 31 Dscrete Math 1 Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. Nobody seems to care. Chage oce hours? Tuesday, 8 PM

More information

Thompson s Group F (p + 1) is not Minimally Almost Convex

Thompson s Group F (p + 1) is not Minimally Almost Convex Thompso s Group F (p + ) is ot Miimally Almost Covex Claire Wladis Thompso s Group F (p + ). A Descriptio of F (p + ) Thompso s group F (p + ) ca be defied as the group of piecewiseliear orietatio-preservig

More information

Section 4. Imaging and Paraxial Optics

Section 4. Imaging and Paraxial Optics 4-1 Sectio 4 Imagig ad Paraxial Optics Optical Sstems A optical sstem is a collectio of optical elemets (leses ad mirrors). While the optical sstem ca cotai multiple optical elemets, the first order properties

More information

ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION

ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

Some non-existence results on Leech trees

Some non-existence results on Leech trees Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract

More information

Partitions of a Convex Polygon

Partitions of a Convex Polygon HAPTER 6 Partitios of a ovex Polygo 6 INTRODUTION I our survey we have come across some results o eumeratio of ocrossig cofiguratios o the set of vertices of a covex polygo, such as triagulatios ad trees

More information

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets Throughput-Delay Scalig i Wireless Networks with Costat-Size Packets Abbas El Gamal, James Mamme, Balaji Prabhakar, Devavrat Shah Departmets of EE ad CS Staford Uiversity, CA 94305 Email: {abbas, jmamme,

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch

More information

Optimized Aperiodic Concentric Ring Arrays

Optimized Aperiodic Concentric Ring Arrays 24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity

More information

Module 8-7: Pascal s Triangle and the Binomial Theorem

Module 8-7: Pascal s Triangle and the Binomial Theorem Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Pacific Journal of Mathematics

Pacific Journal of Mathematics Pacific Joural of Mathematics SMLL HYPEROLI POLYHER SHWN RFLSKI Volume 55 No. 1 Jauary 01 PIFI JOURNL OF MTHEMTIS Vol. 55, No. 1, 01 SMLL HYPEROLI POLYHER SHWN RFLSKI We classify the -dimesioal hyperbolic

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information

CUTTING AND PASTING LIBERT E, EGALIT E, HOMOLOGIE! 1

CUTTING AND PASTING LIBERT E, EGALIT E, HOMOLOGIE! 1 CUTTING AND PASTING LIBERTÉ, EGALITÉ, HOMOLOGIE! 1 1. Heegaard splittigs Makig 3-maifolds from solid hadlebodies 2. Surface homeomorphisms Gluig maifolds together alog their boudaries 3. Surgery Cuttig

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

The Adjacency Matrix and The nth Eigenvalue

The Adjacency Matrix and The nth Eigenvalue Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Matrix representation of a solution of a combinatorial problem of the group theory

Matrix representation of a solution of a combinatorial problem of the group theory Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,

More information

Geometry. Parallel Lines. Slide 1 / 206. Slide 2 / 206. Slide 3 / 206. Table of Contents

Geometry. Parallel Lines. Slide 1 / 206. Slide 2 / 206. Slide 3 / 206. Table of Contents Slide 1 / 206 Slide 2 / 206 Geoetry Parallel Lies 2014-11-17 www.jctl.org Table of otets Slide 3 / 206 lic o the topic to go to that sectio Lies: Itersectig, Parallel & Sew Lies & Trasversals Parallel

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Computing Vertex PI, Omega and Sadhana Polynomials of F 12(2n+1) Fullerenes

Computing Vertex PI, Omega and Sadhana Polynomials of F 12(2n+1) Fullerenes Iraia Joural of Mathematical Chemistry, Vol. 1, No. 1, April 010, pp. 105 110 IJMC Computig Vertex PI, Omega ad Sadhaa Polyomials of F 1(+1) Fullerees MODJTABA GHORBANI Departmet of Mathematics, Faculty

More information