Hyperbolic polygonal spirals
|
|
- Oswald Bond
- 5 years ago
- Views:
Transcription
1 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 mathjoural@rose-hulma.edu a Aquias College
2 Rose-Hulma Udergraduate Mathematics Joural Volume 11, No., Fall, 010 Hyperbolic polygoal spirals Jillia Russo Abstract. This article is based o the costructio of Nested Hyperbolic Polygoal Spirals. The costructio uses costructible Euclidea agles to create hyperbolic polygos of five or more sides. The ested polygos are formed by coectig the midpoits of the sides of the origial polygo, thus creatig a spiral. The costructio is icluded for the readers to be able to costruct oe for themselves as they read alog. This costructio, alog with hyperbolic trigoometric formulas, led to the results: measures of the agles, side legths ad areas of all the parts of the spiral. Furthermore, the costructio is used to prove the costructible hyperbolic regular polygos have the same umber of sides as the costructible Euclidea polygos. Ackowledgemets: We thak the Deiso ad Marguerite Mohler Fud for creatig a summer research experiece for my advisor, Dr. Michael McDaiel, ad me. Dr. Aaro Cizori s talk o geometric spirals at our Math Club ispired our hyperbolic versio. We appreciate the referee s directios, which helped clarify the article.
3 RHIT Udergrad. Math. J., Vol. 11, No. Page Itroductio I this paper we costruct ad examie what we have amed ested hyperbolic polygoal spirals withi the Poicaré Disk (Figure 1). The costructio is easy to follow, so the readers will be able to costruct oe for themselves as they read alog. My advisor ad I studied the areas, agles ad side legths of the parts of the spiral. Also, the costructio leads to a proof describig which regular hyperbolic polygos with all right agles are costructible. Figure 1. Nested hyperbolic petagos. Hyperbolic geometry dates back to the ieteeth cetury with Bolyai ad Lobachevsky beig credited as the cofouders. This geometry comes from a chage i the parallel postulate. Istead of the Euclidea requiremet that for every give lie ad a give poit ot o that lie, there is oe parallel lie through the give poit, i hyperbolic geometry there are may parallel lies through a give poit (P) ot o a give lie (l) (Figure.) There are differet models for represetig this type of geometry, but for our purposes we focused o the Poicaré Disk Model.
4 Page 198 RHIT Udergrad. Math. J., Vol. 11, No. Figure. Hyperbolic disk properties. I the disk model, the hyperbolic space is cofied by a boudary circle. There are two kids of hyperbolic lies: diameters ad arcs of circles orthogoal to the boudary. I this space, hyperbolic lies may appear bet i the Euclidea sese, but i hyperbolic space they are straight lies. Also, agles withi this geometry are measured usig their tagets. This creates the characteristic property that the sum of the agles of a hyperbolic triagle is betwee 0 ad π. Furthermore, all similar triagles are cogruet ad o-itersectig lies have exactly oe mutual perpedicular lie. We ca ow examie Figure 1 with the vocabulary of hyperbolic geometry. The complete circle is the boudary of the space. The outermost petago is the level 1 hyperbolic petago. It has all right agles. Oe side has bee draw with the hyperbolic lie cotaiig it. The other lies have bee hidde i order to keep the drawig simple. Ay ested petago has the midpoits of the sides of the previous petago for vertices, givig us the k levels we use throughout the paper. The ested petagos form hyperbolic triagles; we will fid properties of oe triagle from each level. The shadig is to emphasize choosig oe triagle from each level. Here are a few more hyperbolic geometry facts we will use without proof. We ca have a hyperbolic polygo with all right agles ad as may sides as we wat, as log as we wat more tha four. The ested polygos have a limitig case as they are costructed iward: the Euclidea regular polygo of that may sides. The hyperbolic segmets get Euclidea straighter as the polygos get smaller.
5 RHIT Udergrad. Math. J., Vol. 11, No. Page 199 As the polygos go iward, the hyperbolic legth of a side approaches zero. The vertex agles grow from π to the Euclidea limit. The ested polygos are ot cogruet ad do ot form a tilig. The iitial vertex agles do ot have to be π ; they could be ay size less tha the Euclidea value of π, where 5. I the secod sectio, we recall a few useful hyperbolic trigoometric idetities. We give istructios for the costructio of this figure i the third sectio. Our fourth sectio has area calculatios, icludig a telescopic series. The proof that the sum of the hyperbolic legths of oe side of each level polygo coverges takes up the fifth sectio. We close with our costructibility proof. Hyperbolic Trigoometry The hyperbolic disk has its ow trigoometry, usig sih x ad cosh x. We oly eed two hyperbolic idetities, available i ay hyperbolic trigoometry text [Keelly]. We use triagle ABC whose sides are hyperbolic segmets with hyperbolic legths a, b, c. Figure 3. Hyperbolic triagle ABC. cosh c = cosh a cosh b sih a sih b cos C (1) The equatio above resembles the Law of Cosies i that C, the oly agle ivolved, correspods with the isolated side o the left had of the equatio. Sice the formula uses cosh a istead of the hyperbolic legth a, we will use cosh a i our calculatios much more tha a, eve though we will ivestigate the hyperbolic legths of the sides of our ested polygos. We will also use the special structure of our polygos to simplify the secod useful idetity.
6 Page 00 RHIT Udergrad. Math. J., Vol. 11, No. Figure 4. Level k sketch of OF D. I Figure 4, the poit O is the ceter of our hyperbolic polygos ad our disk. Euclidea arcs AC ad CE represet two cosecutive sides of a level k hyperbolic polygo ad arc BD represets a side of the hyperbolic polygo at the ext level, k + 1. Usig the otatio ad relatioships i this figure, we have the followig equatio. si OF D si ODF cosh F D = cos DOF +cos OF D cos ODF () The triagle OF D has specific values so that we ca simplify quickly. We will take segmet BD as legth L k, ad the cetral agle coectig cosecutive midpoits of a level k polygo as A k, makig ODF = A k. Sice OF D = π, formula () becomes si A k cosh L k = cos π. (3) With these formulas, we calculated agles, areas, ad legths for as may levels as we wated. We used cosh L k = S k for all our calculatios ad otes ad coverted to hyperbolic legth oly whe we wated actual hyperbolic legths. Our empirical ivestigatio poited the way to the theoretical results i this paper. The level oe side legth, S 1, of the petago is worth lookig at. Lemma 1 For the five-sided, all right-agled, regular hyperbolic petago, cosh L 1 = S 1 = ϕ (the Golde Ratio.) Proof. From equatio () applied to the hyperbolic triagle OGE i Figure 8 (below), we have cosh GE si π si π = cos π + cos π cos π. This implies S = cosh GE = cos π A trig ratio from regular Eulcidea petagos gives us cos π 5 fiishes our proof: cos π + 1 = 5 ϕ + 1 = ϕ. 3 Nested Hyperbolic Polygos = ϕ. A double agle formula We will ow provide a algorithm to costruct a regular, right agled hyperbolic polygo ad create layers of polygos iside it usig the midpoits of the sides. The costructio is
7 RHIT Udergrad. Math. J., Vol. 11, No. Page 01 simple (provided the iitial agle is costructible) ad ca be doe with a series of Euclidea moves usig a compass ad straight edge. This limitatio of the first agle forms a crucial part of our work i the last sectio. Figures 5, 6, ad 7 below will illustrate our procedure i the = 5 case. Regular Right Agled Hyperbolic Polygo Costructio Figure 5. Figure 6. Boudary locatio. Figure 7. Polygo costructio. Before drawig aythig, choose the umber of sides ad calculate ( 180( ) ). Create a segmet AB of ay legth R. Rotate the lie by the agle ( 180( ) ) 90 aroud poit B with legth R, creatig segmet BC. Thus begis Figure 5. Now rotate the segmet BC a egative 90 degrees aroud poit C, creatig segmet CD. We cotiue the first two steps repeatedly, rotatig aroud the ewest created edpoit, util the sides close i o each other, creatig Figure 5. Coect the vertices at the agles of measure ( 180( ) ) 90; it will create a -sided polygo with iterior agles ( 180( ) ). As we see i Figure 6, we have created isosceles right triagles, each with hypoteuse a outer side, like BD. The rotatio ( 180( ) ) 90 is just right to get such a figure for sides. Coect two vertices of the -sided polygo, skippig oe i betwee, like the segmet BH. Now we ca costruct the first side of the hyperbolic regular polygo. Use a vertex, J, of the -sided polygo as the ceter. Use radius of legth R, so the hyperbolic lie will go through the two poits of legth R away from the chose vertex. Now costruct the diagoals of the -sided polygo to fid the ceter. (Lies through O i Figures 6 ad 7)
8 Page 0 RHIT Udergrad. Math. J., Vol. 11, No. The ceter of the hyperbolic space will be the ceter of the -sided polygo (O), where all the diagoals meet. To fid the radius of the disk, we follow the segmet BH we coected betwee two vertices (skippig oe), startig at oe of the vertices, B, ad travelig toward the other util we hit the hyperbolic lie. This ulabeled itersectio gives us the disk radius distace. Fiish the polygo by creatig the hyperbolic lies as before. Use the vertices of the -sided polygo with radii of legth R. (Figure 7) To make the first ested polygo, we start by creatig lies perpedicular to the diagoals at all the vertices of the -sided polygo. The itersectios of these perpedicular lies create a ew -sided polygo. (Figure 8 - Petago MNPRS) Note: The midpoits of the arcs of the hyperbolic lies are the poits where the diagoals itersect the arcs. Use the vertices of the ewly created -sided polygo as the ceter of the circles for the sides of the ested hyperbolic polygo. The radius will be the legth from the vertices to the midpoit of the arc of oe of the circles cotaiig that poit. (It will go through both midpoits). Repeat the last step for all vertices to fiish the first ested hyperbolic polygo. Use the same three steps to costruct multiple ested hyperbolic polygos always buildig off the previous step.
9 RHIT Udergrad. Math. J., Vol. 11, No. Page 03 Figure 8. Nested polygo costructio. These Euclidea steps make hyperbolic objects. These steps my be used for ay umber of sides, give that first agle. We will ow justify the key steps i the costructio. Lemma Proof. JAB = π. The level 1 costructio gives a chai of mutually orthogoal circles. We costructed eighborig circles to have perpedicular radii. For example, Lemma 3 The level 1 costructio gives hyperbolic lies. Proof. The circle with ceter J has two (ulabeled) poits o Euclidea segmet HB. Sice the circle J is orthogoal to circle B, these two ulabeled poits are a poit ad its iverse. Ay circle through a poit ad its iverse is orthogoal to the circle of iversio. The circle with ceter O passes through these two poits. Therefore circles J ad B cotai hyperbolic lies i the disk bouded by circle O.
10 Page 04 RHIT Udergrad. Math. J., Vol. 11, No. Lemma 4 The level k costructio gives hyperbolic lies. Proof. The midpoits at ay level lie o alteratig Euclidea rays (of the rays we costruct) through O. Two cosecutive midpoits determie oe hyperbolic lie. The Euclidea ray from O through oe midpoit passes through the circle cotaiig that midpoit agai, at the iverse of that poit. The midpoit, the ceter of the cotaiig circle ad its iverse are Euclidea colliear with O. By costructig the ceter of the ext level usig the itersectio of the Euclidea perpedicular lies at vertices of the previous level Euclidea polygo, we get the ext level circle through the midpoit ad its iverse, makig the level k circle cotai a hyperbolic lie. (I our Figure 8, circle S passes through a midpoit ad its iverse.) We are relyig o a property of orthogoal circles which ca be foud i [Goodma- Strauss], that a circle through a poit ad its iverse must be orthogoal to the circle of iversio. We deped o the diagoals which skip oe vertex, like HB, to fid the ceters of the circles which cotai our hyperbolic lies. The Euclidea segmet HB passes through the itersectio of two circles ad is called the radical axis of circles J ad O. Lemma 5 Whe oe circle is a hyperbolic lie ad the other is the boudary, the the radical axis cotais the ceter of ay hyperbolic lie orthogoal to the give hyperbolic lie (except the diameter, of course.) Proof. Without loss of geerality, cosider the circle cetered at J i Figure 8. We have already built circle J orthogoal to the boudary. We ca chage our poit of view ad see that we have circle O orthogoal to circle J, treatig circle J as the boudary, temporarily, of a hyperbolic disk. The two ulabeled poits form a poit ad its iverse across circle J. This use of the radical axis is also give as a homework problem o the iversio of circles i [Veema]. We wat to emphasize that this costructio works for ay umber of sides, give that first Euclidea agle. 4 The Area of Oe Spiral Figure 1 shows five spirals made from hyperbolic triagles, oe from each level, distiguished by color. The sum of the areas of these triagles is easily calculated. First, we eed the area formula for a hyperbolic triagle ABC. With agles i radias, the area is π (A + B + C). (There is a multiplicatio costat which we will take as 1.) I Figure 1, we see 5 spirals all covergig at O. The picture would look similar for sides, except the level 1 polygo gets bigger as icreases (see Sectio 5 for the limit.) The the spirals fill the iterior of the first level polygo, with o overlap. For sides, the spiral cosists of 1 of the area of the first level polygo. The hyperbolic area formula of the first level is ( ) π π = π π.
11 RHIT Udergrad. Math. J., Vol. 11, No. Page 05 We ca divide by to see the spiral has area π π. A more iterestig calculatio ca be made for this area, this time applyig the hyperbolic area formula at each level ad addig. We will get a hoest-to-goodess telescopic series whose sum is, agai, π π. A telescopic sum has terms which cacel throughout the series, usually leavig a frot term ad a back term, as we will see i our example. We begi with a figure of two cosecutive levels i a polygo of sides. Figure 9. Supplemetary agles at D. Usig the area formula for a hyperbolic triagle agai, we fid the area of triagle BCD is π (γ + β) = π (γ + (π δ) ) = δ γ. (4) Now, these two agles γ ad δ are just the vertex agles of isosceles hyperbolic triagles from two cosecutive levels. The sum of the areas of hyperbolic triagles i the spiral would be a telescopic sum where the survivig terms would be the limit of the iermost agle mius the outermost agle. Luckily, both of these are available. The ested polygos approach a Euclidea regular polygo of sides. The outermost agle is a right agle because we started with all right agles. We get the same area of the spiral: π π = π π. From this example, we see that we ca fix the starter agle at size α ad the area of the spiral becomes π α π because the telescopic series will still happe. If we use o-midpoits for the ested polygo vertices, we lose the ice isosceles structure. Yet, we keep the telescopig series! To see this i Figure 8, thik of the two β s as β 1 ad β. The calculatio for the area of triagle BCD, from (4), becomes π (γ + β 1 + β ) = γ + (π β 1 β )) = δ γ. The limit of the series is π α = π α π, the same aswer as usig midpoits. This makes sese because, eve though we chose vertices off the midpoits, we still geerate a spiral which stads for 1 of the area iside the first polygo.
12 Page 06 RHIT Udergrad. Math. J., Vol. 11, No. 5 Sum of side legths For hyperbolic triagle ABC, the hyperbolic trigoometric formulas (1) ad () work icely with our ested polygos. We ca show that the hyperbolic legth of oe side of the first level polygo is bouded as icreases. Lemma 6 For the -sided, all right agled, regular, hyperbolic polygo, lim S 1 = 3. Proof. From formula () applied to triagle OCE, si π si π cosh L = cos π + cos π cos π. Solvig for cosh L = S 1 ad takig the limit gives the desired result. To traslate ito our levels, we use A k for the agle C. We will use L k for the hyperbolic legth of oe side at level k. More ofte, we will use S k = cosh L k. The isosceles structure of the triagle makes a = b =.5 cosh 1 (S k ). The side opposite agle A k already has a ame: S k+1. (The reaso cosh 1 S k turs up so much is that S k is ot hyperbolic legth. We have to take cosh 1 S k to get hyperbolic legth.) Substitutio ito formula (1) gives us our recursive formula for the hyperbolic legth of a side of oe of our ested hyperbolic polygos: S k+1 = [cosh (.5 cosh 1 (S k )) (cos A k sih (.5 cosh 1 (S k ))]. Simplificatios for the compositios cosh (.5 cosh 1 (S k )) = S k + 1 ad sih (.5 cosh 1 (S k ) = S k 1 have bee kow sice at least 1707 [Keelly]. (The substitutios sih 1 x = l(x + x + 1) ad cosh 1 x = l(x + x 1) from ay calculus text provide the key step.) The simplificatios lead to a shorter recursive formula: S k+1 = 1[S k(1 cos A k ) + (1 + cos A k )]. (5) We are ow ready to cosider the sum of oe side from each level. Theorem 1 cosh 1 (S k ) < for fixed, the umber of sides i the polygo. k=1 Proof. Startig with the ratio test, we apply our recursive formula (5) to the umerator. Sice all the subscripts have become k, we ca suppress the subscripts. We are goig to treat both S ad A as fuctios of k. So, for example, S = ds. dk cosh 1 (S k+1 ) lim k cosh 1 (S k ) cosh 1 ( 1 [S(1 cos A) + (1 + cos A)]) = lim k cosh 1 (S) Sice the limitig case is the ceter poit O, we kow the umerator ad deomiator go to 0. So we apply L Hopital s rule with k as the idepedet variable. lim k cosh 1 ( 1 [S(1 cos A) + (1 + cos A)]) cosh 1 (S).
13 RHIT Udergrad. Math. J., Vol. 11, No. Page 07 1 = lim [S (1 cos A) + (S 1)A si A] S 1 k S(1 cos A)+(1+cos A) [ ] S 1 [S (1 cos A) + (S 1)A si A] S 1 = lim k [S (1 cos A + cos A) + S(1 cos A) + (1 + cos A + cos A)] 4 S [S (1 cos A) + (S 1)A si A] S 1 = lim k [cos A(S 1) cos A(S 1) + (S + 3)(S 1) S [S (1 cos A) + (S 1)A si A] S + 1 = lim. k [cos A(S 1) cos A(S + 1) + (S + 3) S The lim S = 1; we see the factors of S 1 have caceled by divisio i the last step, k so we ca get ready to take the limit. Before we ca let the (S 1)A si A go to zero, A si A however, we eed to check that lim <. This is worth a look because the umber k S S k approaches 1; so S ca get small quickly. We will ow make sure that the factor A gets small quickly eough to hadle it. We ca rewrite our hyperbolic trigoometry formula (3) for A = (si 1 ( cos ( ) π )) (subscripts suppressed). The we fid da ds = cos( π ) (S + 1) by the Chai Rule. The S + 1 cos ( π ) S = 1 implies that this fractio is fiite for ay fixed. We ca fiish takig our limit. lim k So the difficult-lookig factor A cosh 1 (S k+1 ) si A cacels i the limit ad we fid lim k cosh 1 = (S k ) 1 cos A < 1 for ay fixed. lim k 6 The costructible, regular, all right agled hyperbolic polygos Our costructios give us oe more result. Recall that our costructio method i Sectio 3 begis with a agle. If that agle is costructible, the the resultig regular hyperbolic polygo is costructible. The costructible agles correspod to the costructible regular Euclidea polygos, which are kow. Specifically, a -sided regular Euclidea polygo is costructible if ad oly if is a product of distict Fermat primes ad a power of. A Fermat prime is a prime umber of the form m + 1. May sources give a detailed ivestigatio of the rich history of this result, [Veema] amog them. Theorem The costructible regular hyperbolic polygos with all right agles have the same umber of sides as the costructible Euclidea regular polygos. Proof. We ca show that the family of costructible regular hyperbolic polygos is the same as the family of costructible Euclidea regular polygos. I this case, by family, we S+1
14 Page 08 RHIT Udergrad. Math. J., Vol. 11, No. mea the umber of sides, more tha four. If we ca costruct a regular -sided Euclidea polygo, we ca costruct a regular, right agled hyperbolic polygo from it. We gave its costructio i Sectio 3. I order to show the families are the same, we suppose we could costruct a regular, - sided, right agled hyperbolic polygo where is ot a power of times a product of distict Fermat primes, like = 7. I other words, suppose we have a costructio for a regular, right agled, hyperbolic polygo whose Euclidea versio is ot i the costructible family. If this costructio has O as its ceter, we ca draw Euclidea segmets coectig cosecutive ceters of circles cotaiig hyperbolic sides to costruct a regular Euclidea polygo, which has bee proved impossible. If this hyperbolic costructio is off-ceter, the hyperbolic sides will ot be cogruet Euclidea arcs or segmets. The ceters of the circles cotaiig these Euclidea arcs will ot be spaced symmetrically aroud O. Steps exist, however, which will ceter the drawig, usig compass ad straightedge [Goodma-Strauss]. We ca traslate the off-ceter polygo to the locatio we use i this paper. The we are right back to the previous paragraph, costructig a impossible Euclidea polygo. Therefore, our assumptio that we ca costruct a regular, right agled hyperbolic polygo from outside the Euclidea family leads to a cotradictio. Right agled hyperbolic polygos appear i the study of Riema surfaces, as metioed i the paper by Castro ad Martiez [Castro/Martiez] These authors also metio that oly a few papers exist which study these objects. The Euclidea versios of this problem have received more attetio, i [Emmedorfer et al] ad [Stewart]. 7 Refereces A. E. Keelly, The Applicatio of Hyperbolic Fuctios to Electrical Egieerig Problems, McGraw-Hill (1916). G. Veema, Foudatios of Geometry, Pretice Hall (005). C. Goodma-Strauss, Compass ad straightedge i the Poicaré disk, The America Mathematical Mothly, 108, No. 1 (001), A. F. Costa ad E. Martiez, O hyperbolic right-agled polygos, Geometricae Dedicata, 58, No. 3, (December 1995), D. Emmedorfer, M. Precup, ad A. Warre, Classificatio of Geometric Spirals, Pi Mu Epsilo to appear. J. Stewart, Calculus, 6th editio, (Thomso) 799.
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 informationAlpha 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 informationThe Platonic solids The five regular polyhedra
The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7 www.olewitthase.dk Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral
More informationRecursive 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 informationCounting 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 informationModule 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 informationCONVERGENCE 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 information27 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 information1.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 informationLecture 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 informationLecture 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 informationComputational 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 informationBezier 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 informationINSCRIBED 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 informationThe 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 informationOnes 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 informationThe 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 informationcondition 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 information9.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 informationThe 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 informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationMath 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 informationABOUT 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 informationVisualization 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 informationArea 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 informationSouth 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 informationCHAPTER 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 informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More informationGraphs. 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 informationFURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)
Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES
More informationPattern 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 informationCS 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 informationA 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 informationOn (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 informationOptimal 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 informationMathematics 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. 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 information1. 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 informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationIntro 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 informationAssignment 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 informationPolynomial 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 information1 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 informationThe 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 informationn 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 informationOctahedral 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 informationOur 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 informationCOMP 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 informationApparent 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 informationFundamentals 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 informationChapter 18: Ray Optics Questions & Problems
Chapter 18: Ray Optics Questios & Problems c -1 2 1 1 1 h s θr= θi 1siθ 1 = 2si θ 2 = θ c = si ( ) + = m = = v s s f h s 1 Example 18.1 At high oo, the su is almost directly above (about 2.0 o from the
More informationNew 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 informationSD 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 informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationLecture 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 informationNumerical 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 informationMath 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 informationGEOMETRY 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. 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 informationCombination 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 informationReading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.
Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for
More informationThe 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 informationReading. 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 informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationSection 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 informationHomework 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 informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationBOOLEAN 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 informationInvestigation Monitoring Inventory
Ivestigatio Moitorig Ivetory Name Period Date Art Smith has bee providig the prits of a egravig to FieArt Gallery. He plas to make just 2000 more prits. FieArt has already received 70 of Art s prits. The
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationMath 3201 Notes Chapter 4: Rational Expressions & Equations
Learig Goals: See p. tet.. Equivalet Ratioal Epressios ( classes) Read Goal p. 6 tet. Math 0 Notes Chapter : Ratioal Epressios & Equatios. Defie ad give a eample of a ratioal epressio. p. 6. Defie o-permissible
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationIntroduction to Sigma Notation
Itroductio to Siga Notatio Steph de Silva //207 What is siga otatio? is the capital Greek letter for the soud s I this case, it s just shorthad for su Siga otatio is what we use whe we have a series of
More informationA 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 informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationParametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015
Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationNormals. In OpenGL the normal vector is part of the state Set by glnormal*()
Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct
More informationSome 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 informationPLEASURE 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 informationRelationship 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 informationCIS 121. Introduction to Trees
CIS 121 Itroductio to Trees 1 Tree ADT Tree defiitio q A tree is a set of odes which may be empty q If ot empty, the there is a distiguished ode r, called root ad zero or more o-empty subtrees T 1, T 2,
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationComputers 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 informationA Resource for Free-standing Mathematics Qualifications
Ope.ls The first sheet is show elow. It is set up to show graphs with equatios of the form = m + c At preset the values of m ad c are oth zero. You ca chage these values usig the scroll ars. Leave the
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationIt just came to me that I 8.2 GRAPHS AND CONVERGENCE
44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationWebAssign Lesson 6-1b Geometric Series (Homework)
WebAssig Lesso 6-b Geometric Series (Homework) Curret Score : / 49 Due : Wedesday, July 30 204 :0 AM MDT Jaimos Skriletz Math 75, sectio 3, Summer 2 204 Istructor: Jaimos Skriletz. /2 poitsrogac alcet2
More information