The Minimum Distance Energy for Polygonal Unknots

Size: px
Start display at page:

Download "The Minimum Distance Energy for Polygonal Unknots"

Transcription

1 The Miimum Distace Eergy for Polygoal Ukots By:Johaa Tam Advisor: Rollad Trapp Abstract This paper ivestigates the eergy U MD of polygoal ukots It provides equatios for fidig the eergy for ay plaar regular -go ad for ay m-go, where the vertices lie o the vertices of a regular m -go ad o the midpoits of each edge I additio, we show that a regular 4-go miimizes the eergy for ay quadrilateral Fially, this paper icludes a proof showig that if we have a regular -go, R, iscribed i a circle ad ca move oly oe vertex of R, v, alog the circle betwee its two adjacet vertices, the the U MD is miimized whe v is a vertex o R 1 Itroductio The miimum distace eergy for polygoal kots, U MD, was itroduced by Joatho Simo i [] This eergy aalyzes the miimum distaces betwee the edges of a kot Furthermore, Rawdo ad Simo i [1] relates this miimum distace eergy to the Möbius eergy for smooth kots They show that U MD (P ) U MD (R ) approaches the Möbius eergy of the smooth kot K as P approaches K It is cojectured that the regular -go miimizes U MD for all kots with -sticks If this cojecture holds true, the U MD (P ) U MD (R ) will ever be egative, ad accordig to Joatho Simo [3], that limitig umber is the same as the miimum Möbius eergy for the kot type K My goal was to prove this cojecture This paper provides a itroductio to some of the observatios that ca be made about the eergy of the regular -go Now we will briefly cover some importat defiitios that are used throughout this paper To start with the basics, a kot is a cotiuous closed curve/loop i space It ca be thought of as a kotted strad of strig that is coected at the eds, where the strig has o thickess A polygoal kot is a kot equivalet to a polygo i R 3 It is depicted usig straight edges (sticks) ad vertices This is the type of kot that we will be focusig o The ukot is a kot that has a diagram with o crossigs ad therefore has a crossig umber of zero Oe type of ukot is the regular -go, which is a polygo that has edges of equal legth ad correspodig agles of equal degree which will be deoted as R throughout this paper 1

2 Fially, the mai topic of this paper is the miimum distace eergy Whe give two o-adjacet edges X, Y of a polygoal kot K, we defie the miimum distace eergy, U MD, by U MD (X, Y) = l(x) l(y) MD(X,Y) such that l(x), l(y ) are the legths of X ad Y cosecutively, ad MD(X, Y ) is the miimum distace betwee X ad Y Now we defie the miimum distace eergy of K by U MD (K) = U MD (X, Y) where the sum is take over all pairs of o-adjacet edges, X ad Y, of polygo K Note: The eergy U MD is scale ivariat This holds true because if we icrease the kot by a costat c, the the legths of all the edges ad the distaces betwee them would all icrease by c Therefore, we have U MD (X, Y ) = c l(x) c l(y ) (c MD(X,Y )) = c l(x) l(y ) c (MD(X,Y )) = l(x) l(y ) MD(X,Y ) Eergy Equatios for a Regular -go This sectio discusses two geeral equatios that ca be used to compute the U MD of a regular -go ad the methods we used to geerate them Oe equatio is for whe is odd ad the other is for whe is eve The U MD of ay regular -go ca be obtaied easily by just pluggig the equatio ito MAPLE ad chagig accordigly For the first step, we decided to view the regular -go as iscribed iside a uit circle (see Figure 1) sice U MD is scale ivariat Every vertex of the -go lies o the followig circle Thus vertex v j = (cos( π j Figure 1 Uit Circle ), si( π j )) For example, v 1 = (cos( π π ), si( )) We the foud the legth of a edge, l e, by fidig the distace betwee two cosecutive vertices of the polygo Sice the legth of each edge is equal by defiitio, we ca make it simple by just choosig to fid the distace betwee v 0 ad v 1, where v 0 = (1, 0) We have l e = (cos( π ) 1) (si( π )), which ca be simplified to l e = (1 cos( π ))

3 thus, for the regular -go l(x) l(y ) = (1 cos( π )) where X ad Y are o-adjacet edges Next we ivestigated the miimum distaces betwee the o-adjacet edges Due to the symmetry of a regular -go, the U MD for e 1 ad its oadjacet edges is the same as the U MD for ay other edge ad its o-adjacet edges so we ca multiply 1 j=3 U MD(e 1, e j ) by However, ote that the U MD of each pair of o-adjacet edges have bee couted twice, ad hece we must divide by Therefore, the U MD (K) = j=3 U MD(e 1, e j ) where K is the ukot with edges The miimum distace betwee two edges is the distace betwee the head of oe edge ad the tail of the other where the head is farther couterclockwise tha the tail 1 The Miimum Distace Eergy of R Whe is Odd We will ow discuss how to fid the equatio for the U MD (R, = odd) Note that each edge of a -go where is odd, has a eve umber of o-adjacet edges We ca utilize this fact ad the symmetry of R to make fidig the equatio more feasible Throughout this subsectio we ca refer to the regular 5-go i figure as a example Figure We oticed that j=3 U MD(e 1, e j ) = j= 1 U MD(e 1, e j ) therefore we ca just calculate j=3 U MD(e 1, e j ) ad multiply by two So the first step is to fid a formula for the U MD (e 1, e j ) where e j is o-adjacet to e 1 We kow that l(e 1 ) l(e j ) = (1 cos( π )) from earlier Next we ee to fid the miimum distace betwee the head of e 1 ad the tail of e j Usig trigoometry ad geometry, we fid that the head of e 1 is at (cos( π π ), si( )) ad that the tail of e j is at (cos( π (j 1) ), si( π (j 1) )) Thus the MD(e 1, e j ) = (cos( π i π ) cos( )) (si( π i π ) si( )), where i = (j 1) Whe we put it all together, the U MD (R, = odd) = i= (cos( π i (1 cos( π )) ) cos( π )) (si( π i π ) si( )) The usig some trigoometric idetities, we ca simplify the equatio to the followig Propositio 11-The miimum distace eergy for R whe is odd is U MD (R ) = 3

4 i= (si( π )) (si( π (i 1) )) The Miimum Distace Eergy of R Whe is Eve Throughout this paper, fidig a formula for the miimum distace eergy is more complicated whe the kot has a eve umber of sticks tha whe there is a odd umber of sticks I this subsectio we ca refer to the followig 8-go as a example, where the bolded edge is e 1 ad the dotted lies represet the miimum distace betwee two edges (see Figure 3) Figure 3 We the ca follow the same procedures for whe is eve for R with oe additio Ulike whe is odd, a -go with a eve umber of edges will have a odd umber of o-adjacet edges for each edge as see i the 8-go above However, otice that with the exceptio of the edge opposite of e 1, it follows the same patter/symmetry as R whe is odd Due to this differece, the U MD of e 1 ad all its o-adjacet edges mius the farthest edge is the same as whe is odd with differet limits So to complete the geeral equatio for whe is eve, we eed to take the product of the legths of e 1 ad e ( 1) ad divide it by their miimum distace squared After that, we must multiply the resultig equatio by ad divide by to prevet double coutig Whe we put it all together the U MD (R, = eve) = 1 (1 cos( π )) )) i= π (1 cos( π ) si( )) (1cos( π However, (cos( π i ) cos( π )) (si( π i ) like the previous equatio, we ca simplify the equatio usig trigoometric idetities to the followig Propositio 1-The miimum distace eergy for R whe is eve is U MD ( go) = 1 (si( π )) i= (si( π (i 1) )) (ta( π )) 3 Eergy Equatios for a Flatteed -go I this sectio, we discuss how to fid the U MD for a specific irregular -go We let K be a plaar regular -go, ad let L be the plaar -go obtaied by takig K ad addig a vertex o the midpoit of each edge I other words, the flatteed -go is whe you take every other outer agle of a regular -go ad flatte it to 180 The equatios for U MD (L) were foud by followig the same steps used to fid the U MD for R Let e 1 s head be located o a 4

5 midpoit of a edge i K The miimum distace is still from the head of oe edge to the tail of the other Oce agai we chose to focus o the U MD of oe edge ad its correspodig o-adjacet edges The we multiplied that quatity by The legth of a edge i L is equivalet to the legth of a edge i R divided by two We have l e = 1 (cos( π ) 1) (si( π )), which ca be simplified to l e = 1 (1 )) therefore, the product of the legths for two o-adjacet edges, X ad Y, for L is give by l(x) l(y ) = 1 (1 cos( 4 π )) As i the previous sectio, the U MD (L) requires two equatios, oe for whe = eve ad oe for whe = odd 31 U MD (L, = odd) This subsectio focuses o L whe is odd However, the -go still has a eve umber of edges ad thus L has a odd umber of o-adjacet edges for each edge Oce agai we ca rely o the symmetry of the -go to simplify the problem Figure 4 Before we compute the equatio, make ote that the head of e 1 is closest to the tails of e j whe 3 j ( 1) Also ote that the tail of e 1 is the closest to the heads of e j whe ( ) j ( 1) We ca ow fid U MD (L, / = odd) by breakig up the problem ito four sectios by lookig at the four possible cases of o-adjacet edge pairs First we fid the U MD of e 1 ad e j whe 3 j ( 1) where the tail of e j is located o a vertex of the regular -go, which equals (1 )) 4 (( )1 i )) ( si( 4 π ) si( 4 π i )) ) Secodly, we fid the U MD of e 1 ad e j whe 3 j ( 1) where the tail of e j is located o a midpoit of a edge i K, which equals 4 (( )1 ( i (1 )) )cos( ) )) ( Next we fid the U MD of e 1 ad e j whe ( si( 4 π ) ( si( 4 π i )si( ) )) ) ) j ( 1) where the 5

6 head of e j is located o a vertex from the regular -go, which equals 4 1 (( (1 )) ) cos( )) (si( 4 π ) si( )) ) Lastly, we fid the U MD of e 1 ad e j whe ( ) j ( 1) where the head of e j is located o a midpoit of a edge i K, which equals 4 (( (1 )) i )cos( ) ) ( )) (si( 4 π si( 4 π i ) ( )si( ) )) ) Now after all these computatios, we oly eed to add up these summatios, simplify ad multiply the result by Therefore, we have U MD (L, = odd) = ( 4 4 (( (( )1 ( (( (( )1 i i ) cos( i ) ( (si( π )) )cos( ) si( 4 π ) si( 4 π i )) ( (si( π )) )) ( (si( π )) )) (si( 4 π )cos( ) (si( π )) )) ) si( 4 π ) si( 4 π i ( )si( ) ) si( )) (si( 4 π )) ) si( 4 π i ) ( )) ) )si( ) )) ) ) 3 U MD (L, = eve) I this subsectio we will show how we fid a formula for the U MD (L, = eve) We follow the same procedures as whe fidig the U MD (R ), where the equatio for the case eve builds from the equatio used for the whe odd case Use the 16-go below as a example for this subsectio (see Figure 5) Oce agai the dotted lies represet the miimum distace betwee two o-adjacet edges Figure 5 For fidig the equatio for U MD (L, = eve), we ca use the same method used above whe is odd Actually we ca use the exact same summads with differet bouds to represet the same cases of o-adjacet edge pairs of the ukot However, whe is eve, we have a odd umber of oadjacet edges for each edge Similar to computig the U MD (R, = eve), the U MD (e 1, e ( 1) ) requires a extra term added o to the formula for whe is odd The product of these two edges is the same as the rest of the oadjacet pairs The miimum distace is foud by computig the miimum distace betwee the head of e 1 ad the head of e ( 1), which is equal to (( (si( π )) )1) (si( 4 π )) Therefore if we add this quatity to the summatios 6

7 foud for U MD (L, = odd) ad chage the limits appropriately, we ed up with U MD (L, = eve) = ( (( (( )1 )1 i ( i (1 )) )) ( )cos( ) si( 4 π ) si( 4 π i (si( π )) )) ( )) ) si( 4 π ) si( 4 π i ( )si( ) )) ) (( (( ) cos( i ) ( (si( π )) )) (si( 4 π )cos( ) ) si( (si( π )) )) (si( 4 π )) ) si( 4 π i ) ( )si( ) )) ) (si( π )) ( )1) (si( 4 π )) ) 4 Regular 4-go Miimizes U MD for all Quadrilaterals This sectio provides a proof that the regular 4-go miimizes the U MD for all quadrilaterals, which icludes irregular, ot covex, ad o-plaar 4-gos Before we begi the proof we must calculate the actual value of U MD (R 4 ) Let the edge legths of R 4 equal a,b,c,d where the edges with legths a ad b are o-adjacet WLOG, U MD (R 4 ) is give by a b d c d a Sice we kow that for a regular 4-go, a=b=c=d,the above quatity ca be writte as a a a a a a = a a a a = 1 1 = Theorem 1: The regular 4-go miimizes the miimal distace eergy U MD for all kots with four edges Figure 6 Proof Let F be ay ukot with 4 edges, e a, e b, e c, e d, with edge legths a, b, c, d respectively, where e a ad e b are o-adjacet ad a < b ad d < c 7

8 Note that for each arbitrary 4-go above the largest possible MD(e a, e b ) equals d, ad the largest possible MD(e c, e d ) equals a Sice this maximizes the deomiator, it miimizes the U MD (F ) The we have U MD (F ) = a b c d (MD(e a,e b )) (MD(e c,e d )) a b d c d a > a d d a = a4 d 4 a d We kow that x y x y Let x = a ad y = d Thus a 4 d 4 a d It follows that a 4 d 4 a d Therefore the U MD (4 go) is miimized by a regular 4-go sice the U MD (R 4 ) = 5 Movemet of Oe Vertex Alog the Circumferece of a Circle If we have a regular -go, R, iscribed i a circle, all of its vertices will lie o the circumferece of the circle Now if we are allowed to move oly oe of these vertices, v, alog the circle betwee its two adjacet vertices, how does this affect the U MD of the kot? I this sectio we will show that if v moves from its origial positio o R, it will oly icrease the miimum distace eergy of the kot To start the ivestigatio, let this altered R be deoted as A where oe of its vertices have the coordiates (1, 0), ad let v be adjacet ad located at (cos(θ), si(θ)), where 0 < θ < 4 π Before computig the miimum distace eergy, otice that oly two of the edges, e 1 ad e, from R will be altered Therefore, U MD of those two edges ad their correspodig o-adjacet edges will chage, while the cotributios to U MD of the remaiig edge pairs will remai the same Let e 1 have the edpoits (1, 0) ad (cos(θ), si(θ)), ad e have the edpoits (cos(θ), si(θ)) ad ( 4 π ), si( )) Therefore we have l(e 1) = si( θ ) ad l(e ) = si( 4 π θ ) 51 U MD (A, = odd) To fid the U MD (e 1 ) we eed to fid U MD (e 1, e i ), where e i is o-adjacet to e 1, there are two cases to cosider: whe (1, 0) is the poit closest to the oadjacet edge ad whe (cos(θ), si(θ)) is the closest The eergy for whe (1, 0) is the poit earest to e i equals i= si( π ) si( θ ) The eergy for whe v is si( π (i 1) ) the closest to e i is equal to i= si( π ) si( θ ) The sum used for computig si( θ π i ) the U MD (e ) is similar to the U MD (e 1 ), but istead of si( π ) si( θ ), the 8

9 umerator chages to si( π 4 π ) si( θ ) Therefore, the U MD (e ) equals 4 π θ 4 π θ to i= (si( π )) si( ) si( π (i 1) )) i= (si( π )) si( ) The remaiig si( θ π i )) edge pairs have the same U MD as if the -go were regular, ad therefore equal i= ( 4) (si( π )) We ca ow add up these summatios to get the (si( π (i 1) )) miimal distace eergy of the kot Whe simplified, U MD (A, = odd) = i= ( si( π ) (si( θ )si( (si( π (i 1) 5 U MD (A, = eve) 4 π θ )) )) si( π (si( π )) (si( π (i 1) )) ) Figure 7 ) (si( θ 4 π )si( θ )) (si( θ π i )) ( 4) Oce agai whe fidig the equatio for U MD ( go, = eve), we ca employ the same method used above whe is odd, which will give us the same summads, but with differet limits ad some extra terms The summads from U MD (A, = odd) do ot iclude the U MD (e i, e (i ) ) where e i is ay edge i the -go Whe e i ad e (i ) are ot e 1 or e, the we kow from the U MD (R ) that the U MD (e i, e (i ) ) = ( ) (ta( π )) We eed to fid the U MD (e 1, e ( 1) ) ad the U MD (e, e ( ) ) The MD(e 1, e ( 1) ) is the distace betwee (cos(θ), si(θ)) ad ( 1, 0) The MD(e, e ( ) ) is the distace betwee ( 4 π π () ), si( )) ad (cos( ), si( π () )) Therefore the 4 π θ U MD (e 1, e ( 1) ) = (si( π )) si( θ ) ad the U (cos( θ MD (e, e )) ) = (si( π )) si( ) (si( π ( ) )) We ca ow add up these equatios ad simplify to get the followig equatio U MD (A, = eve) = 1 4) i= ( (si( π )) (si( θ )si( (si( π )) (si( π (i 1) (si( π (i 1) 4 π θ )) )) (si( π ) ( )) ) (ta( π )) (si( π )) si( θ ) (cos( θ )) Figure 8 53 U MD (A ) is Miimized Whe θ = π )) (si( θ 4 π )si( θ )) (si( θ π i )) ( (si( π )) si( 4 π θ ) (si( π ( ) )) To aalyze the U MD (A ) further, we will look at the rate of chage of θ The followig proof will use calculus to show that U MD (A ) is miimized whe θ = π However, before the proof we eed to fid the derivative of U MD(A ) 9

10 d dθ (U MD(A, = odd)(θ)) = (si( π )) ( 1 cos( θ ) 1 π cos( θ )) (si( θ π i )) (si( π d dθ (U MD(A, = eve)(θ) = 1 π cos( θ )) (si( π (i 1) )) )) (si( θ π ) si( θ )) cos( θ π i ) ) (si( θ π i ))3 i= ( (si( π )) ( 1 cos( θ ) 1 π cos( θ )) (si( π (i 1) )) π ) si( θ )) cos( θ π i ) ) (si( θ π i ))3 π ) cos( θ ) (si( π ( ) )) i= ( (si( π )) ( 1 cos( θ ) 1 (si( π )) ( 1 cos( θ ) 1 π cos( θ )) (si( π (si( θ π i )) (si( θ )) si( π ) si( π cos( θ ) (si( θ )) si( π ) (cos( θ ))3 Figure 9 Theorem : The U MD (A ) is miimized whe A = R Proof Give U MD (A ) ad d dθ (U MD(A )), we eed to show that the fuctio U MD (A )(θ) icreases if θ starts at π ad decreases towards 0 or icreases towards 4 π Due to symmetry (see Figure 9), we ca aalyze the oe-sided derivative of U MD (A ) where θ π We wat to show that d dθ (U MD(A ))( π ) > 0 Usig trigoometric idetities we are able to simplify d dθ (U MD(A ))( π ) where d dθ (U MD(A, = odd)( π )) = 4 (si( π )) cot( (i 1) π ) i= (si( (i 1) π )) d dθ (U MD(A, = eve)( π )) = 1 i= 4 (si( π )) cot( (i 1) π ) (si( (i 1) π )) ) (ta( π ))3 Sice we proved that the regular 4-go miimizes the eergy U MD for all 4- gos, we ca let 5 Whe we plug i the limits, ad, we fid that π (i 1) π < ( ) π Thus, 0 < (i 1) π < π Hece, 4 (si( π )) cot( (i 1) π ) > (si( (i 1) π )) 0 ad (ta( π ))3 > 0 sice we kow that cot(θ) > 0 ad ta(θ) > 0 whe 0 < θ < π So it follows that U MD(A ) is icreasig as θ is icreasig from π Therefore, U MD(A ) is miimized whe θ = π Remark: Sice d dθ (U MD(A ))( π ) 0, we kow that U MD(A ) is ot differetiable at θ = π 6 Coclusio I coclusio, we have foud some equatios for computig the miimum distace eergy for the regular -go ad other types of polygoal ukots I additio, we proved that the regular 4-go miimizes U MD for all ukots with 4 sticks We also proved that if we have a regular -go, R, iscribed i a circle ad ca move oly oe vertex of R, v, alog the circle betwee its two adjacet vertices, the U MD of that kot is miimized whe the kot is a regular -go Overall, we employed differet methods to aalyze the U MD of the 10

11 ukot We focused o the miimum distace betwee edges i sectio ad sectio 3 The i sectio 4 we focused o edge legths Fially, for sectio 5 we focused o the agles betwee the edpoits The miimum distace eergy of a regular -go has yet be prove to miimize the U MD for all ukots with sticks There are defiitely differet ways to ivestigate this cojecture Oe directio to go is to fid equatios for the regular -go ad other polygoal ukots that ca be compared effectively This ca maybe be doe by ivestigatig whether the ukot is easier to aalyze whe we are focusig o the edge legths, miimum distaces, agles, etc Sice this paper discusses maily plaar, o-covex -gos, maybe we ca aalyze covex or o-plaar -gos If the regular -go is prove to miimize the U MD for all -gos, the maybe U MD of other kot types with higher crossig umbers ca be miimized by equalizig the edges ad expadig the agles betwee the edges evely Overall, it will give us a better uderstadig of the miimum distace eergy U MD ad its properties 7 Ackowledgemets I wat to thak Dr Rollad Trapp for advisig me throughout this project ad for his time ad patiece Also, I wat to thak Dr Joatho Simo for his advice ad ideas for for my project Fially, I wat to thak the CSUSB REU 006 group ad Dr Joseph Chavez for their support All this was made possible by the Natioal Sciece Foudatio REU Grat DMS It was truly a hoor to be give this opportuity Thak you 8 Refereces [1] Rawdo, Eric J; Simo, Joatha K Polygoal approximatio ad eergy of smooth kots J Kot Theory Ramificatios 15 (006), o 4, E10 (57M5) [] Simo, Joatha K Eergy fuctios for polygoal kots Radom kottig ad likig (Vacouver, BC, 1993), 67 88, Ser Kots Everythig, 7, World Sci Publishig, River Edge, NJ, M5 [3] Simo, Joatha K Persoal Commuicatio 11

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

Upper bound for ropelength of pretzel knots

Upper bound for ropelength of pretzel knots Upper boud for ropelegth of pretzel kots Safiya Mora August 25, 2006 Abstract A model of the pretzel kot is described. A method for predictig the ropelegth of pretzel kots is give. A upper boud for the

More information

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?

More information

MATH 10550, EXAM 3 SOLUTIONS

MATH 10550, EXAM 3 SOLUTIONS MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

For example suppose we divide the interval [0,2] into 5 equal subintervals of length

For example suppose we divide the interval [0,2] into 5 equal subintervals of length Math 1206 Calculus Sec 1: Estimatig with Fiite Sums Abbreviatios: wrt with respect to! for all! there exists! therefore Def defiitio Th m Theorem sol solutio! perpedicular iff or! if ad oly if pt poit

More information

Riemann Sums y = f (x)

Riemann Sums y = f (x) Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

Polynomial Functions and Their Graphs

Polynomial Functions and Their Graphs Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

INEQUALITIES BJORN POONEN

INEQUALITIES BJORN POONEN INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad

More information

For example suppose we divide the interval [0,2] into 5 equal subintervals of length

For example suppose we divide the interval [0,2] into 5 equal subintervals of length Math 120c Calculus Sec 1: Estimatig with Fiite Sums I Area A Cosider the problem of fidig the area uder the curve o the fuctio y!x 2 + over the domai [0,2] We ca approximate this area by usig a familiar

More information

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Math 21B-B - Homework Set 2

Math 21B-B - Homework Set 2 Math B-B - Homework Set Sectio 5.:. a) lim P k= c k c k ) x k, where P is a partitio of [, 5. x x ) dx b) lim P k= 4 ck x k, where P is a partitio of [,. 4 x dx c) lim P k= ta c k ) x k, where P is a partitio

More information

4.1 SIGMA NOTATION AND RIEMANN SUMS

4.1 SIGMA NOTATION AND RIEMANN SUMS .1 Sigma Notatio ad Riema Sums Cotemporary Calculus 1.1 SIGMA NOTATION AND RIEMANN SUMS Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each

More information

The Advantage Testing Foundation Solutions

The Advantage Testing Foundation Solutions The Advatage Testig Foudatio 202 Problem I the morig, Esther biked from home to school at a average speed of x miles per hour. I the afteroo, havig let her bike to a fried, Esther walked back home alog

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

ROSE WONG. f(1) f(n) where L the average value of f(n). In this paper, we will examine averages of several different arithmetic functions.

ROSE WONG. f(1) f(n) where L the average value of f(n). In this paper, we will examine averages of several different arithmetic functions. AVERAGE VALUES OF ARITHMETIC FUNCTIONS ROSE WONG Abstract. I this paper, we will preset problems ivolvig average values of arithmetic fuctios. The arithmetic fuctios we discuss are: (1)the umber of represetatios

More information

Sequences I. Chapter Introduction

Sequences I. Chapter Introduction Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which

More information

AP Calculus BC Review Applications of Derivatives (Chapter 4) and f,

AP Calculus BC Review Applications of Derivatives (Chapter 4) and f, AP alculus B Review Applicatios of Derivatives (hapter ) Thigs to Kow ad Be Able to Do Defiitios of the followig i terms of derivatives, ad how to fid them: critical poit, global miima/maima, local (relative)

More information

We will conclude the chapter with the study a few methods and techniques which are useful

We will conclude the chapter with the study a few methods and techniques which are useful Chapter : Coordiate geometry: I this chapter we will lear about the mai priciples of graphig i a dimesioal (D) Cartesia system of coordiates. We will focus o drawig lies ad the characteristics of the graphs

More information

Appendix F: Complex Numbers

Appendix F: Complex Numbers Appedix F Complex Numbers F1 Appedix F: Complex Numbers Use the imagiary uit i to write complex umbers, ad to add, subtract, ad multiply complex umbers. Fid complex solutios of quadratic equatios. Write

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

Honors Calculus Homework 13 Solutions, due 12/8/5

Honors Calculus Homework 13 Solutions, due 12/8/5 Hoors Calculus Homework Solutios, due /8/5 Questio Let a regio R i the plae be bouded by the curves y = 5 ad = 5y y. Sketch the regio R. The two curves meet where both equatios hold at oce, so where: y

More information

APPENDIX F Complex Numbers

APPENDIX F Complex Numbers APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios

More information

Z ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew

Z ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew Problem ( poits) Evaluate the itegrals Z p x 9 x We ca draw a right triagle labeled this way x p x 9 From this we ca read off x = sec, so = sec ta, ad p x 9 = R ta. Puttig those pieces ito the itegralrwe

More information

Problem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =

Problem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t = Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

If the escalator stayed stationary, Billy would be able to ascend or descend in = 30 seconds. Thus, Billy can climb = 8 steps in one second.

If the escalator stayed stationary, Billy would be able to ascend or descend in = 30 seconds. Thus, Billy can climb = 8 steps in one second. BMT 01 INDIVIDUAL SOLUTIONS March 01 1. Billy the kid likes to play o escalators! Movig at a costat speed, he maages to climb up oe escalator i 4 secods ad climb back dow the same escalator i 40 secods.

More information

Complex Numbers. Brief Notes. z = a + bi

Complex Numbers. Brief Notes. z = a + bi Defiitios Complex Numbers Brief Notes A complex umber z is a expressio of the form: z = a + bi where a ad b are real umbers ad i is thought of as 1. We call a the real part of z, writte Re(z), ad b the

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let. Joh Riley 8 Jue 03 ANSWERS TO EXERCISES IN APPENDIX B Sectio B VECTORS AND SETS Exercise B-: Covex sets (a) Let 0 x, x X, X, hece 0 x, x X ad 0 x, x X Sice X ad X are covex, x X ad x X The x X X, which

More information

Ray-triangle intersection

Ray-triangle intersection Ray-triagle itersectio ria urless October 2006 I this hadout, we explore the steps eeded to compute the itersectio of a ray with a triagle, ad the to compute the barycetric coordiates of that itersectio.

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

Math 176 Calculus Sec. 5.1: Areas and Distances (Using Finite Sums)

Math 176 Calculus Sec. 5.1: Areas and Distances (Using Finite Sums) Math 176 Calculus Sec. 5.1: Areas ad Distaces (Usig Fiite Sums) I. Area A. Cosider the problem of fidig the area uder the curve o the f y=-x 2 +5 over the domai [0, 2]. We ca approximate this area by usig

More information

Chapter 5.4 Practice Problems

Chapter 5.4 Practice Problems EXPECTED SKILLS: Chapter 5.4 Practice Problems Uderstad ad kow how to evaluate the summatio (sigma) otatio. Be able to use the summatio operatio s basic properties ad formulas. (You do ot eed to memorize

More information

R is a scalar defined as follows:

R is a scalar defined as follows: Math 8. Notes o Dot Product, Cross Product, Plaes, Area, ad Volumes This lecture focuses primarily o the dot product ad its may applicatios, especially i the measuremet of agles ad scalar projectio ad

More information

Coffee Hour Problems of the Week (solutions)

Coffee Hour Problems of the Week (solutions) Coffee Hour Problems of the Week (solutios) Edited by Matthew McMulle Otterbei Uiversity Fall 0 Week. Proposed by Matthew McMulle. A regular hexago with area 3 is iscribed i a circle. Fid the area of a

More information

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

Lecture 2: April 3, 2013

Lecture 2: April 3, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,

More information

18th Bay Area Mathematical Olympiad. Problems and Solutions. February 23, 2016

18th Bay Area Mathematical Olympiad. Problems and Solutions. February 23, 2016 18th Bay Area Mathematical Olympiad February 3, 016 Problems ad Solutios BAMO-8 ad BAMO-1 are each 5-questio essay-proof exams, for middle- ad high-school studets, respectively. The problems i each exam

More information

Analysis of Experimental Measurements

Analysis of Experimental Measurements Aalysis of Experimetal Measuremets Thik carefully about the process of makig a measuremet. A measuremet is a compariso betwee some ukow physical quatity ad a stadard of that physical quatity. As a example,

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

PUTNAM TRAINING PROBABILITY

PUTNAM TRAINING PROBABILITY PUTNAM TRAINING PROBABILITY (Last udated: December, 207) Remark. This is a list of exercises o robability. Miguel A. Lerma Exercises. Prove that the umber of subsets of {, 2,..., } with odd cardiality

More information

MATH 2411 Spring 2011 Practice Exam #1 Tuesday, March 1 st Sections: Sections ; 6.8; Instructions:

MATH 2411 Spring 2011 Practice Exam #1 Tuesday, March 1 st Sections: Sections ; 6.8; Instructions: MATH 411 Sprig 011 Practice Exam #1 Tuesday, March 1 st Sectios: Sectios 6.1-6.6; 6.8; 7.1-7.4 Name: Score: = 100 Istructios: 1. You will have a total of 1 hour ad 50 miutes to complete this exam.. A No-Graphig

More information

TECHNIQUES OF INTEGRATION

TECHNIQUES OF INTEGRATION 7 TECHNIQUES OF INTEGRATION Simpso s Rule estimates itegrals b approimatig graphs with parabolas. Because of the Fudametal Theorem of Calculus, we ca itegrate a fuctio if we kow a atiderivative, that is,

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Simple Polygons of Maximum Perimeter Contained in a Unit Disk

Simple Polygons of Maximum Perimeter Contained in a Unit Disk Discrete Comput Geom (009) 1: 08 15 DOI 10.1007/s005-008-9093-7 Simple Polygos of Maximum Perimeter Cotaied i a Uit Disk Charles Audet Pierre Hase Frédéric Messie Received: 18 September 007 / Revised:

More information

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Quadratic Functions. Before we start looking at polynomials, we should know some common terminology.

Quadratic Functions. Before we start looking at polynomials, we should know some common terminology. Quadratic Fuctios I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively i mathematical

More information

On a Smarandache problem concerning the prime gaps

On a Smarandache problem concerning the prime gaps O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps

More information

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series

More information

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the

More information

Appendix: The Laplace Transform

Appendix: The Laplace Transform Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

FIR Filter Design: Part II

FIR Filter Design: Part II EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak

More information

Assignment 1 : Real Numbers, Sequences. for n 1. Show that (x n ) converges. Further, by observing that x n+2 + x n+1

Assignment 1 : Real Numbers, Sequences. for n 1. Show that (x n ) converges. Further, by observing that x n+2 + x n+1 Assigmet : Real Numbers, Sequeces. Let A be a o-empty subset of R ad α R. Show that α = supa if ad oly if α is ot a upper boud of A but α + is a upper boud of A for every N. 2. Let y (, ) ad x (, ). Evaluate

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

More information

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

Name: Math 10550, Final Exam: December 15, 2007

Name: Math 10550, Final Exam: December 15, 2007 Math 55, Fial Exam: December 5, 7 Name: Be sure that you have all pages of the test. No calculators are to be used. The exam lasts for two hours. Whe told to begi, remove this aswer sheet ad keep it uder

More information

A Note on the Symmetric Powers of the Standard Representation of S n

A Note on the Symmetric Powers of the Standard Representation of S n A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,

More information

Properties and Tests of Zeros of Polynomial Functions

Properties and Tests of Zeros of Polynomial Functions Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by

More information

Now we are looking to find a volume of solid S that lies below a surface z = f(x,y) and R= ab, cd,,[a,b] is the interval over

Now we are looking to find a volume of solid S that lies below a surface z = f(x,y) and R= ab, cd,,[a,b] is the interval over Multiple Itegratio Double Itegrals, Volume, ad Iterated Itegrals I sigle variable calculus we looked to fid the area uder a curve f(x) bouded by the x- axis over some iterval usig summatios the that led

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots. 15 Cubics, Quartics ad Polygos It is iterestig to chase through the argumets of 14 ad see how this affects solvig polyomial equatios i specific examples We make a global assumptio that the characteristic

More information

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said

More information

Curve Sketching Handout #5 Topic Interpretation Rational Functions

Curve Sketching Handout #5 Topic Interpretation Rational Functions Curve Sketchig Hadout #5 Topic Iterpretatio Ratioal Fuctios A ratioal fuctio is a fuctio f that is a quotiet of two polyomials. I other words, p ( ) ( ) f is a ratioal fuctio if p ( ) ad q ( ) are polyomials

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

Areas and Distances. We can easily find areas of certain geometric figures using well-known formulas:

Areas and Distances. We can easily find areas of certain geometric figures using well-known formulas: Areas ad Distaces We ca easily fid areas of certai geometric figures usig well-kow formulas: However, it is t easy to fid the area of a regio with curved sides: METHOD: To evaluate the area of the regio

More information

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example: 74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig

More information

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim Math 3, Sectio 2. (25 poits) Why we defie f(x) dx as we do. (a) Show that the improper itegral diverges. Hece the improper itegral x 2 + x 2 + b also diverges. Solutio: We compute x 2 + = lim b x 2 + =

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Complex Number Theory without Imaginary Number (i)

Complex Number Theory without Imaginary Number (i) Ope Access Library Joural Complex Number Theory without Imagiary Number (i Deepak Bhalchadra Gode Directorate of Cesus Operatios, Mumbai, Idia Email: deepakm_4@rediffmail.com Received 6 July 04; revised

More information

x c the remainder is Pc ().

x c the remainder is Pc (). Algebra, Polyomial ad Ratioal Fuctios Page 1 K.Paulk Notes Chapter 3, Sectio 3.1 to 3.4 Summary Sectio Theorem Notes 3.1 Zeros of a Fuctio Set the fuctio to zero ad solve for x. The fuctio is zero at these

More information

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5 Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You

More information

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α Nice plottig of proteis: I A widely used display of protei shapes is based o the coordiates of the alpha carbos - - C α -s. The coordiates of the C α -s are coected by a cotiuous curve that roughly follows

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm

More information

SOLUTIONS TO PRISM PROBLEMS Junior Level 2014

SOLUTIONS TO PRISM PROBLEMS Junior Level 2014 SOLUTIONS TO PRISM PROBLEMS Juior Level 04. (B) Sice 50% of 50 is 50 5 ad 50% of 40 is the secod by 5 0 5. 40 0, the first exceeds. (A) Oe way of comparig the magitudes of the umbers,,, 5 ad 0.7 is 4 5

More information

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients. Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,

More information

Synopsis of Euler s paper. E Memoire sur la plus grande equation des planetes. (Memoir on the Maximum value of an Equation of the Planets)

Synopsis of Euler s paper. E Memoire sur la plus grande equation des planetes. (Memoir on the Maximum value of an Equation of the Planets) 1 Syopsis of Euler s paper E105 -- Memoire sur la plus grade equatio des plaetes (Memoir o the Maximum value of a Equatio of the Plaets) Compiled by Thomas J Osler ad Jase Adrew Scaramazza Mathematics

More information

Chapter Vectors

Chapter Vectors Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it

More information

Chapter 1. Complex Numbers. Dr. Pulak Sahoo

Chapter 1. Complex Numbers. Dr. Pulak Sahoo Chapter 1 Complex Numbers BY Dr. Pulak Sahoo Assistat Professor Departmet of Mathematics Uiversity Of Kalyai West Begal, Idia E-mail : sahoopulak1@gmail.com 1 Module-2: Stereographic Projectio 1 Euler

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

Expectation and Variance of a random variable

Expectation and Variance of a random variable Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio

More information

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007 UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =

More information