FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES. To a 2π-periodic function f(x) we will associate a trigonometric series. a n cos(nx) + b n sin(nx),

Size: px
Start display at page:

Download "FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES. To a 2π-periodic function f(x) we will associate a trigonometric series. a n cos(nx) + b n sin(nx),"

Transcription

1 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES To -periodic fuctio f() we will ssocite trigoometric series + cos() + b si(), or i terms of the epoetil e i, series of the form c e i. Z For most of the fuctios tht we will be delig with, these series re i sese equl to f. Before we do so, we eed some termiology d itroduce clss of fuctios.. Piecewise cotiuous d piecewise smooth fuctios We will be usig the followig ottio: c + mes c d > c, c mes c d < c. For fuctio f() we will use the followig f(c + ) = lim c + f() d f(c ) = lim c f() provided tht the bove limits eist d re fiite. A fuctio f is sid to be piecewise cotiuous o the closed itervl [, b] if there eit fiitely my poits such tht: c = < c < c < < c < c = b f is cotiuous i ech ope itervl (c j, c j ), for j =,, ; f( + ), f(b ) eist d for j =,,, the limits f(c j ) d f(c+ j ) eist. Hece, f is cotiuous everywhere ecept possibly t fiite umber of poits where it hs jump discotiuities. The spce of piecewise cotiuous fuctios o [, b] will be deoted by C p[, b]. Emple. Cosider the fuctio + if < < ; f() = if < < ; if < The f C p[, ]. Iside the itervl, the oly discotiuities of f re t d Dte: Februry 9, 4.

2 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES y Figure. Piecewise cotiuous. We hve f( + ) =.5, f( ) =, f( + ) =, f( ) = f( + ) =, f( ) =. Emple. Cosider the fuctio y Figure. Not piecewise cotiuous { if < ; f() = if. The iside discotiuity of f is t =. Becuse lim f() = (ot fiite), the f / C p([, ]. A fuctio f is sid to be piecewise smooth o closed itervl [, b] if f is piecewise cotiuous o [, b] d f is lso piecewise cotiuous o [, b]. This mes tht f () eists d is cotiuous everywhere i (, b) ecept possibly t fiite umber of poits. Moreover, t ech poit where f is discotiuous the oe sided limits of f eist d re fiite. The spce of piecewise cotiuous o [, b] will be deoted by C p[, b]. Emple 3. The fuctio f() = is piecewise smooth o [, 5]. It is cotiuous o [, 5] d its derivtive eists everywhere ecept t =. At, we hve f (+) = d f ( ) =. Emple 4. The fuctio f() = { if < ; ( ) /3 if < <. is piecewise cotiuous but it is ot piecewise smooth. The fuctio is piecewise

3 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES 3 y Figure 3. Piecewise cotiuous but ot piecewise smooth cotiuous becuse f( + ) =, f( ) =, d t =, it hs jump discotiuity (f( ) = d f( + ) = ). The derivtive f is f () = for < < d f () = 3( ) /3 for < <, The derivtive f is ot piecewise cotiuous becuse f ( ± ) re ot fiite (the fuctio f hs cusp t = ). A fuctio f is sid to be piecewise cotiuous (respectively piecewise smooth) o the whole rel lie R if f is piecewise cotiuous (resp. piecewise smooth) o ech closed itervl [, b] R. Remrk. Note tht if f C p[, b], the f is itegrble o [, b]. Tht is, b f()d is fiite umber. Ideed, with c < c < < c the jump discotiuities of f, we hve b f()d = c c f()d + c c f()d + + c c f()d d ech itegrl o the right is fiite becuse withi the limits of itegrtio, the fuctio is bouded d cotiuous.. Eve d odd fuctios A fuctio f is sid to be eve (respectively odd) fuctio if f( ) = f() (resp. f( ) = f()) i domi of f. Note tht it follows from the defiitio tht the domi of eve or odd Figure 4. Grphs of eve d odd fuctios fuctio eeds to de symmetric with respect to R. Tht is, if is i the domi, the ( ) is lso i the domi. The grph of eve fuctio is symmetric with

4 4 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES respect to the y-is d the grph of odd fuctio is symmetric with respect to the origi. Whe itegrtig eve or odd fuctios, it is useful to use the followig property Lemm. If f C p[ A, A] is eve fuctio, the A A f()d = If f C p[ A, A] is odd fuctio, the A A Proof. For eve fuctio f, we hve A A f()d = = = = A A A A f()d + A f()d =. A f( u)d( u) + f(u)du + f()d A f()d A f()d. f()d (substitutio u = ) f()d (use f eve) A logous rgumet c be pplied whe f is odd. Remrk. I leve it s eercise for you to prove tht the product of two eve fuctios is eve; two odd fuctios is eve; d the product of eve d odd fuctio is odd. Thtis Eve Eve = Eve Odd Odd = Eve Eve Odd = Odd 3. Periodic fuctios Recll tht fuctio f is sid to be periodic with period T (T > ) if f( + T ) = f( T ) = f() i domi of f. This implies i prticulr tht if is i the domi of f, the + kt is lso i the domi of f for every iteger k d f( + kt ) = f(). y Figure 5. Grph of periodic fuctio, T =

5 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES 5 Emple. For emple, the fuctios si d cos re -periodic d t is -periodic. I geerl, if ω is costt, the si(ω) d cos(ω) hve period T = /ω. Emple. Deote by [ ] the gretest iteger fuctio. Thus, for R, [] the gretest iteger less or equl th. For istce, [.7] =, [ 5] =, [] = 3, y Figure 6. The step fuctio [] [.] =, [ 7] = 3, etc. Note tht [ ] stisfies the property [+] = []+ for ever R. y Figure 7. The swtooth fuctio: [] The fuctio f defied by f() = [] (the frctiol prt of ), lso clled the swtooth fuctio, is piecewise smooth i R d periodic with period T = f( + ) = ( + ) [ + ] = + ([] + ) = [] = f(), R. Emple 3. (Trigulr wve fuctio) I leve it s eercise for you to check tht the fuctio f defied by [ ] f() = + is cotiuous d periodic with period T =. A importt property of periodic fuctios is the followig. Theorem Let f be piecewise cotiuous i R d periodic with period T. The T f()d = +T f()d, R

6 6 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES y Figure 8. The trigulr wve fuctio Proof. Cosider the fuctio H() defied for R by H() = +T prove the Theorem, we eed to show tht H is costt. We rewrite H s H() = f()d + +T f()d = +T f()d f()d. f()d. To We c compute the derivtive H () by usig the Fudmetl Theorem of Clculus d fid H () = f( + T ) f() = becuse f is T -periodic. H gives H costt. 4. Orthogolity of fuctios We defie ier product <, > i the spce Cp[, b] of piecewise cotiuous fuctios o [, b] by < f, g >= b f()g()d, for f, g C p[, b] The orm of fuctio f Cp[, b] is defied f = ( / b < f, f > = f() d). { if < < Emple. Let f() =, g() =, d h() = if < <. Note tht h() = for > d h() = for <. I Cp[, ], we hve < f, g >= < f, h >= < g, h >= ( f = ( g = ( h = f()g()d = d = ()d + / d) = d + / d) = ( )d + d = d = 3 4d) / = 5 d = + = 3

7 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES 7 Two fuctios f, g C p[, b] re sid to be orthogol if < f, g >=. Tht is, f d g re orthogol if b f()g()d =. A set of fuctios S C p[, b] is orthoorml if the elemets of S re mutully orthogol d ech elemet of S hs orm. Tht is, < f, g >= for every f, g S, f g f = for every f S. Emple. The fuctios f() = d g() = ( ) re orthogol i Cp[, ] sice, < f, g >= ( )( ) d = 4 ( )4 = = =. The set S = {f, g} is orthogol but it is ot orthoorml becuse ( / f = ( ) d) = 3 ( / g = ( ) d) 4 = 5 However, if we replce f d g by f () = f() f = 3 f() d g () = g() g = We obti the set S = {f, g } which is orthoorml i C p[, ]. 5. The trigoometric system The followig trigoometric idetities will be used soo cos A cos B = cos(a + B) + cos(a B) cos A si B = si(a + B) si(a B) si A si B = cos(a B) cos(a + B) cos A = cos(a) + si A = cos(a) 5 g() The trigoometric system over the itervl [, ] (or over y itervl of legth ) cosists of the fuctios, cos, si, cos(), si(),, cos(k), si(k),, k Z + Lemm. The trigoometric system is orthogol over [, ]. Proof. We eed to verify tht the followig ier products re zero. <, si(k) >=<, cos(k) >= k Z + < cos(k), si(l) >= k, l Z + < cos(k), cos(l) >=< si(k), si(l) >= k, l Z +, k l We hve for k Z + <, si(k) >= si(k)d = ( cos(k) ) cos(k) cos = = k k

8 8 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES for k, l Z + d k l, we use oe of the bove trig idetities to get Whe k = l, we hve < cos(k), si(l) > = < cos(k), si(k) >= For k, l Z + d k l, we hve cos(k) si(l)d = (si(k + l) si(k l))d = ( ) cos(k + l) cos(k l) k + l k l = < si(k), si(l) > = si(k)d = si(k) si(l)d cos(4k) + cos 4k = (cos(k + l) cos(k l))d = ( ) si(k + l) si(k l) k + l k l = The verifictio of the remiig idetities is left s eercise. Lemm. The orm of the trig fuctios o [, ] re: Proof. We hve =, cos(k) = si(k) =. = d = cos(k) = cos (k)d = ( = + si(k) ) = 4k si(k) = si (k)d = ( = si(k) 4k As cosequece of the two lemms we hve ) = + cos(k) cos(k) Corollry. The followig system is orthoorml over [, ]:, si, cos si k,,, cos k, =. As we will see lter the trigoometric system forms bsis for the spce of piecewise cotiuous d -periodic fuctios.

9 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES 9 6. Fourier series of -periodic fuctios Let f Cp(R) d -periodic, we would like to ssocite to the fuctio f series + cos() + b si() i such wy tht t ech poit where f is cotiuous the vlues of f d the series re the sme: f( ) = + cos( ) + b si( ). A immedite questio is the followig. If give fuctio f hs such represettio, how c we fid the coefficiets,, b, i terms of f? The swer is ot relly difficult if we ssume tht we c iterchge the summtio d the itegrtio. The by usig the orthogolity of the trigoometric system, we would get < f, >= Therefore, To fid d b : d + cos()d + si()d = = < f, > = f()d. < f, cos > = <, cos > + < cos(), cos > +b < si(), cos > = < cos, cos >= cos = < f, si > = <, si > + < cos(), si > +b < si(), si > Hece Similr rgumets give = b < si, si >= b si = b < f, cos > = = < f, si > b = = < f, cos k > k = cos k = < f, si k > b k = si k = We hve therefore estblished the ssocitio f() cos d ; f() si d. f() cos(k)d ; f() si kd. f() + cos() + b si()

10 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES for -periodic fuctio f Cp(R). The ssocited series is clled the Fourier series of f. The coefficiets re give by = k = b k = f()d f() cos(k)d for k =,, f() si(k)d for k =,, Remrk. We hve worked the itegrtios over the itervl [, ]. Becuse of the -periodicity, we could hve used y itervl of legth. Hece, for y rel umber, we lso hve = k = b k = f()d f() cos(k)d for k =,, f() si(k)d for k =,, I my situtios with symmetry, it is useful to tke =. We hve the = k = b k = f()d f() cos(k)d for k =,, f() si(k)d for k =,, Remrk 3. By usig properties of eve d odd fuctios, we hve the followig. If F is eve, the the fuctios F () cos(k) re eve d the fuctios F () si(k) re odd. If G is odd, the the fuctios G() cos(k) re odd d the fuctios G() si(k) re eve. The Fourier coefficiets of eve fuctio F re = k = b k = F ()d = F () cos(k)d = F ()d F () si(k)d = for k =,, The Fourier coefficiets of odd fuctio G re = k = b k = G()d = G() cos(k)d = for k =,, G() si(k)d = F () cos(k)d for k =,, G() si(k) for k =,,

11 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES The Fourier series of eve fuctio F d odd fuctio G re: F () + cos(), G() b si(), = b = 7. Emples We give emples of Fourier series of some simple fuctios F () cos()d ; G() si()d. Emple. Let f() be the -periodic fuctio defied o [, ] by f() =. Hece the grph of f is the trigulr wve. Note tht f is eve fuctio d Figure 9. Trigulr wve so its Fourier series cotis oly the cosie terms (b = for every Z + ). The coefficiets of the cosies re: Hece, = d = ; = cos()d = ( ) cos() = = () =, d = (() ) = ( si() ) = cos() si() d if = k (eve) 4 (k + ) if = k + (odd) We hve obtied the ssocited Fourier series of f o [, ] 4 j= cos(j + ) (j + ). Emple. Let f() be the -periodic fuctio defied o [, ] by { if < < ; f() = if < <. Hece the grph of f is the rectgulr wve. Note tht f is odd fuctio d

12 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES Figure. Rectgulr wve so its Fourier series cotis oly the sie terms ( = d = for every Z + ). The coefficiets of the sies re: ( ) cos() b = si()d = = () Hece, b = ( () ) = if = k (eve) 4 (k + ) if = k + (odd) We hve obtied the ssocited Fourier series of f o [, ] f() 4 si(j + ). (j + ) Emple 3. Let f() be the -periodic fuctio defied o [, ] by { if < < ; f() = if < <. j= The grph of f is the give below. The fuctio f is either eve or odd d so Figure. Grph of f its Fourier series cotis sies d cosies terms. Its Fourier coefficiets re: We hve = = b = f()d = f() cos()d = f() si()d = f() 4 j= d = ; cos(j + ) (j + ) + cos()d = () si()d = () j= () j si j j..

13 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES 3 8. The comple epoetil form of Fourier series Recll tht the cosie d sie fuctio c be epressed i terms of the epoetil s { e iθ = cos θ + i si θ e iθ = cos θ i si θ Now we c rewrite the trigoometric series cos θ = eiθ + e iθ si θ = eiθ e iθ i + cos + b si, = i eiθ e iθ with rel coefficiets i terms of these epoetils. For this, we use cos + b si e i + e i e i e i = ib = ib e i + + ib e i = c e i + c e i where c deotes the comple cojugte of c For -periodic, R-vlued fuctio fuctio f C p(r), we hve with c f() c + c e i + c e i = ib = f() (cos i si ) d = f()e i d This comple form of the Fourier is equivlet to the oe give with cosies d sies. I my pplictios it is esier d more coveiet to use the comple form. Note tht the bove ssocitio tke the form f() c + Re ( c e i) where Re(C) deotes the rel prt of the comple umber C. Emple. Let f be the -periodic fuctio defied over the itervl (, ) by { if < < f() = if < <

14 4 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES To compute the Fourier coefficiets, we use itegrtio by prts. e i d = e i e i i i d = e i i e i e i ( i) + ( i) d = e i i = i e i We fid the the Fourier coefficiets c = d for, c = = (i e i = e i ( i) + e i f()e i d = + e i + e i ( i) 3 + C d = 6 i e i 3 e i d i e i 3 It gives ( c = () () + i + ) () 3 The Fourier series of f is therefore 6 + Re [ c e i] ) + C We c rewrite the Fourier series i terms of cosie d sie. First ( c e i = () () cos + ) () 3 si + ( ( () () +i si + ) ) () 3 cos The Fourier series of f is: 6 + () ( () cos + ) () 3 si Emple. Let f be the -periodic fuctio defied o [, ] s f() = e. The -th Fourier coefficiet of f is c = = e e i d = ( ) e ( i) = e ( i) d i = = (e ) i = (e ) + i + Hece (fter clcultio), we fid [ ] Re(c e i ) = (e ) cos si + +

15 FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES 5 The Fourier series of f is therefore, e c + Re(c e i ) [ ] (e ) cos si Eercises I ech eercise, fid the fourier series of the -periodic fuctio f tht is give by Eercise. f() = for < <. Eercise. f() = for < <. Eercise 3. f() = cos { if < < Eercise 4. f() = if < < Eercise 5. f() = cos Eercise 6. f() = si { if < < Eercise 7. f() = si if < < { /(d) if < d Eercise 8. f() = if d < < with d positive costt. Eercise 9. f() = e d for < <, where d positive costt Eercise. f() = cosh for < <. Eercise. f() = cosh for < <. Eercise. f() = cosh for < <. { ( )/(d) if < d Eercise 3. f() = with d positive costt. if d < <

Even and Odd Functions

Even and Odd Functions Eve d Odd Fuctios Beore lookig t urther emples o Fourier series it is useul to distiguish two clsses o uctios or which the Euler- Fourier ormuls or the coeiciets c be simpliied. The two clsses re eve d

More information

The Fundamental Theorems of Calculus

The Fundamental Theorems of Calculus The Fudmetl Theorems of Clculus The Fudmetl Theorem of Clculus, Prt II Recll the Tke-home Messge we metioed erlier Exmple poits out tht eve though the defiite itegrl solves the re problem, we must still

More information

1.2 Accumulation Functions: The Definite Integral as a Function

1.2 Accumulation Functions: The Definite Integral as a Function mth 3 more o the fudmetl theorem of clculus 23 2 Accumultio Fuctios: The Defiite Itegrl s Fuctio Whe we compute defiite itegrl b f (x) we get umber which we my iterpret s the et re betwee f d the x-xis

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series 8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series

More information

A function f whose domain is the set of positive integers is called a sequence. The values

A function f whose domain is the set of positive integers is called a sequence. The values EQUENCE: A fuctio f whose domi is the set of positive itegers is clled sequece The vlues f ( ), f (), f (),, f (), re clled the terms of the sequece; f() is the first term, f() is the secod term, f() is

More information

Secondary Math 2 Honors. Unit 2 Polynomials, Exponents, Radicals & Complex Numbers

Secondary Math 2 Honors. Unit 2 Polynomials, Exponents, Radicals & Complex Numbers Secodr Mth Hoors Uit Polomils, Epoets, Rdicls & Comple Numbers. Addig, Subtrctig, d Multiplig Polomils Notes Moomil: A epressio tht is umber, vrible, or umbers d vribles multiplied together. Moomils ol

More information

f(x + T ) = f(x), for all x. The period of the function f(t) is the interval between two successive repetitions.

f(x + T ) = f(x), for all x. The period of the function f(t) is the interval between two successive repetitions. Fourier Series. Itroductio Whe the Frech mathematicia Joseph Fourier (768-83) was tryig to study the flow of heat i a metal plate, he had the idea of expressig the heat source as a ifiite series of sie

More information

A black- line master of Example 3 You Try is on provided on page 10 for duplication or use with a projection system.

A black- line master of Example 3 You Try is on provided on page 10 for duplication or use with a projection system. Grde Level/Course: Algebr Lesso/Uit Pl Nme: Geometric Sequeces Rtiole/Lesso Abstrct: Wht mkes sequece geometric? This chrcteristic is ddressed i the defiitio of geometric sequece d will help derive the

More information

s = 1 2 at2 + v 0 t + s 0

s = 1 2 at2 + v 0 t + s 0 Mth A UCB, Sprig A. Ogus Solutios for Problem Set 4.9 # 5 The grph of the velocity fuctio of prticle is show i the figure. Sketch the grph of the positio fuctio. Assume s) =. A sketch is give below. Note

More information

Repeated multiplication is represented using exponential notation, for example:

Repeated multiplication is represented using exponential notation, for example: Appedix A: The Lws of Expoets Expoets re short-hd ottio used to represet my fctors multiplied together All of the rules for mipultig expoets my be deduced from the lws of multiplictio d divisio tht you

More information

STUDENT S COMPANIONS IN BASIC MATH: THE SECOND. Basic Identities in Algebra. Let us start with a basic identity in algebra:

STUDENT S COMPANIONS IN BASIC MATH: THE SECOND. Basic Identities in Algebra. Let us start with a basic identity in algebra: STUDENT S COMPANIONS IN BASIC MATH: THE SECOND Bsic Idetities i Algebr Let us strt with bsic idetity i lgebr: 2 b 2 ( b( + b. (1 Ideed, multiplyig out the right hd side, we get 2 +b b b 2. Removig the

More information

Gaussian Elimination Autar Kaw

Gaussian Elimination Autar Kaw Gussi Elimitio Autr Kw After redig this chpter, you should be ble to:. solve set of simulteous lier equtios usig Nïve Guss elimitio,. ler the pitflls of the Nïve Guss elimitio method,. uderstd the effect

More information

CHAPTER 7 EXPONENTS and RADICALS

CHAPTER 7 EXPONENTS and RADICALS Mth 40 Bittiger 8 th Chpter 7 Pge 1 of 0 CHAPTER 7 EXPONENTS d RADICALS 7.1 RADICAL EXPRESSIONS d FUNCTIONS b mes b Exmple: Simplify. (1) 8 sice () 8 () 16 () 4 56 (4) 5 4 16 (5) 4 81 (6) 0.064 (7) 6 (8)

More information

Arithmetic Sequences

Arithmetic Sequences Arithmetic equeces A simple wy to geerte sequece is to strt with umber, d dd to it fixed costt d, over d over gi. This type of sequece is clled rithmetic sequece. Defiitio: A rithmetic sequece is sequece

More information

More About Expected Value and Variance

More About Expected Value and Variance More Aout Expected Vlue d Vrice Pge of 5 E[ X ] Expected vlue,, hs umer of iterestig properties These re t likely to e used i this course eyod this lesso, ut my come ito ply i lter sttistics course Properties

More information

UNIT FIVE DETERMINANTS

UNIT FIVE DETERMINANTS UNIT FIVE DETERMINANTS. INTRODUTION I uit oe the determit of mtrix ws itroduced d used i the evlutio of cross product. I this chpter we exted the defiitio of determit to y size squre mtrix. The determit

More information

Application: Volume. 6.1 Overture. Cylinders

Application: Volume. 6.1 Overture. Cylinders Applictio: Volume 61 Overture I this chpter we preset other pplictio of the defiite itegrl, this time to fid volumes of certi solids As importt s this prticulr pplictio is, more importt is to recogize

More information

MATHEMATICS FOR ENGINEERING BASIC ALGEBRA

MATHEMATICS FOR ENGINEERING BASIC ALGEBRA MATHEMATICS FOR ENGINEERING BASIC ALGEBRA TUTORIAL - INDICES, LOGARITHMS AND FUNCTION This is the oe of series of bsic tutorils i mthemtics imed t begiers or yoe wtig to refresh themselves o fudmetls.

More information

8.2 Simplifying Radicals

8.2 Simplifying Radicals . Simplifig Rdicls I the lst sectio we sw tht sice. However, otice tht (-). So hs two differet squre roots. Becuse of this we eed to defie wht we cll the pricipl squre root so tht we c distiguish which

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

Showing Recursive Sequences Converge

Showing Recursive Sequences Converge Showig Recursive Sequeces Coverge Itroductio My studets hve sked me bout how to prove tht recursively defied sequece coverges. Hopefully, fter redig these otes, you will be ble to tckle y such problem.

More information

Summation Notation The sum of the first n terms of a sequence is represented by the summation notation i the index of summation

Summation Notation The sum of the first n terms of a sequence is represented by the summation notation i the index of summation Lesso 0.: Sequeces d Summtio Nottio Def. of Sequece A ifiite sequece is fuctio whose domi is the set of positive rel itegers (turl umers). The fuctio vlues or terms of the sequece re represeted y, 2, 3,...,....

More information

A proof of Goldbach's hypothesis that all even numbers greater than four are the sum of two primes.

A proof of Goldbach's hypothesis that all even numbers greater than four are the sum of two primes. A roof of Goldbch's hyothesis tht ll eve umbers greter th four re the sum of two rimes By Ket G Sliker Abstrct I this er I itroduce model which llows oe to rove Goldbchs hyothesis The model is roduced

More information

Math Bowl 2009 Written Test Solutions. 2 8i

Math Bowl 2009 Written Test Solutions. 2 8i Mth owl 009 Writte Test Solutios i? i i i i i ( i)( i ( i )( i ) ) 8i i i (i ) 9i 8 9i 9 i How my pirs of turl umers ( m, ) stisfy the equtio? m We hve to hve m d d, the m ; d, the 0 m m Tryig these umers,

More information

AP CALCULUS FORMULA LIST. f x + x f x f x + h f x. b a

AP CALCULUS FORMULA LIST. f x + x f x f x + h f x. b a AP CALCULUS FORMULA LIST 1 Defiitio of e: e lim 1+ x if x 0 Asolute Vlue: x x if x < 0 Defiitio of the Derivtive: ( ) f x + x f x f x + h f x f '( x) lim f '( x) lim x x h h f ( + h) f ( ) f '( ) lim derivtive

More information

Ae2 Mathematics : Fourier Series

Ae2 Mathematics : Fourier Series Ae Mthemtics : Fourier Series J. D. Gibbon (Professor J. D Gibbon, Dept of Mthemtics j.d.gibbon@ic.c.uk http://www.imperil.c.uk/ jdg These notes re not identicl word-for-word with my lectures which will

More information

MATHEMATICAL ANALYSIS

MATHEMATICAL ANALYSIS Mri Predoi Trdfir Băl MATHEMATICAL ANALYSIS VOL II INTEGRAL CALCULUS Criov, 5 CONTENTS VOL II INTEGRAL CALCULUS Chpter V EXTENING THE EFINITE INTEGRAL V efiite itegrls with prmeters Problems V 5 V Improper

More information

Chapter 04.05 System of Equations

Chapter 04.05 System of Equations hpter 04.05 System of Equtios After redig th chpter, you should be ble to:. setup simulteous lier equtios i mtrix form d vice-vers,. uderstd the cocept of the iverse of mtrix, 3. kow the differece betwee

More information

A REA AND INTEGRALS. 1 Sigma Notation 2. 2 Area 7. 3 The Definite Integral 16

A REA AND INTEGRALS. 1 Sigma Notation 2. 2 Area 7. 3 The Definite Integral 16 ALTERNATIVE TREATMENT: A REA AND INTEGRALS Sigm Nottio Are 7 The Defiite Itegrl Reprited with permissio from Clculus: Erl Trscedetls, Third Editio Jmes Stewrt 995 Brooks/Cole Pulishig Comp, A divisio of

More information

Fourier Series (Lecture 13)

Fourier Series (Lecture 13) Fourier Series (Lecture 3) ody s Objectives: Studets will be ble to: ) Determie the Fourier Coefficiets for periodic sigl b) Fid the stedy-stte respose for system forced with geerl periodic forcig Rrely

More information

EXPONENTS AND RADICALS

EXPONENTS AND RADICALS Expoets d Rdicls MODULE - EXPONENTS AND RADICALS We hve lert bout ultiplictio of two or ore rel ubers i the erlier lesso. You c very esily write the followig, d Thik of the situtio whe is to be ultiplied

More information

Parents Guide to helping your child with Higher Maths

Parents Guide to helping your child with Higher Maths Prets Guide to helpig your child with Higher Mths The essece of mthemtics is ot to mke simple thigs complicted, but to mke complicted thigs simple. S. Gudder Arithmetic is beig ble to cout up to twety

More information

Measurable Functions

Measurable Functions Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these

More information

11. Fourier series. sin mx cos nx dx = 0 for any m, n, sin 2 mx dx = π.

11. Fourier series. sin mx cos nx dx = 0 for any m, n, sin 2 mx dx = π. . Fourier series Summry of the bsic ides The following is quick summry of the introductory tretment of Fourier series in MATH. We consider function f with period π, tht is, stisfying f(x + π) = f(x) for

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

Geometric Sequences. Definition: A geometric sequence is a sequence of the form

Geometric Sequences. Definition: A geometric sequence is a sequence of the form Geometic equeces Aothe simple wy of geetig sequece is to stt with umbe d epetedly multiply it by fixed ozeo costt. This type of sequece is clled geometic sequece. Defiitio: A geometic sequece is sequece

More information

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S, Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σ-algebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio

More information

Chapter 3 Section 3 Lesson Additional Rules for Exponents

Chapter 3 Section 3 Lesson Additional Rules for Exponents Chpter Sectio Lesso Additiol Rules for Epoets Itroductio I this lesso we ll eie soe dditiol rules tht gover the behvior of epoets The rules should be eorized; they will be used ofte i the reiig chpters

More information

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1 1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,

More information

To multiply exponential expressions with the same base, keep the base, add the exponents.

To multiply exponential expressions with the same base, keep the base, add the exponents. RULES FOR EXPONENTS Epoets re used to write repeted multiplictio of the sme fctor. I the epoetil epressio, the epoet tells us how m times the bse is used s fctor:. Similrl, i the epressio, the epoet tells

More information

A. Description: A simple queueing system is shown in Fig. 16-1. Customers arrive randomly at an average rate of

A. Description: A simple queueing system is shown in Fig. 16-1. Customers arrive randomly at an average rate of Queueig Theory INTRODUCTION Queueig theory dels with the study of queues (witig lies). Queues boud i rcticl situtios. The erliest use of queueig theory ws i the desig of telehoe system. Alictios of queueig

More information

Hermitian Operators. Eigenvectors of a Hermitian operator. Definition: an operator is said to be Hermitian if it satisfies: A =A

Hermitian Operators. Eigenvectors of a Hermitian operator. Definition: an operator is said to be Hermitian if it satisfies: A =A Heriti Opertors Defiitio: opertor is sid to be Heriti if it stisfies: A A Altertively clled self doit I QM we will see tht ll observble properties st be represeted by Heriti opertors Theore: ll eigevles

More information

CHAPTER-10 WAVEFUNCTIONS, OBSERVABLES and OPERATORS

CHAPTER-10 WAVEFUNCTIONS, OBSERVABLES and OPERATORS Lecture Notes PH 4/5 ECE 598 A. L Ros INTRODUCTION TO QUANTUM MECHANICS CHAPTER-0 WAVEFUNCTIONS, OBSERVABLES d OPERATORS 0. Represettios i the sptil d mometum spces 0..A Represettio of the wvefuctio i

More information

Fourier Series and the Wave Equation Part 2

Fourier Series and the Wave Equation Part 2 Fourier Series ad the Wave Equatio Part There are two big ideas i our work this week. The first is the use of liearity to break complicated problems ito simple pieces. The secod is the use of the symmetries

More information

Section 4.3. By the Mean Value Theorem, for every i = 1, 2, 3,..., n, there exists a point c i in the interval [x i 1, x i ] such that

Section 4.3. By the Mean Value Theorem, for every i = 1, 2, 3,..., n, there exists a point c i in the interval [x i 1, x i ] such that Difference Equtions to Differentil Equtions Section 4.3 The Fundmentl Theorem of Clculus We re now redy to mke the long-promised connection between differentition nd integrtion, between res nd tngent lines.

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

MATHEMATICS SYLLABUS SECONDARY 7th YEAR

MATHEMATICS SYLLABUS SECONDARY 7th YEAR Europe Schools Office of the Secretry-Geerl Pedgogicl developmet Uit Ref.: 2011-01-D-41-e-2 Orig.: DE MATHEMATICS SYLLABUS SECONDARY 7th YEAR Stdrd level 5 period/week course Approved y the Joit Techig

More information

Section IV.5: Recurrence Relations from Algorithms

Section IV.5: Recurrence Relations from Algorithms Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by

More information

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers . Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

8.3 POLAR FORM AND DEMOIVRE S THEOREM

8.3 POLAR FORM AND DEMOIVRE S THEOREM SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

Gray level image enhancement using the Bernstein polynomials

Gray level image enhancement using the Bernstein polynomials Buletiul Ştiiţiic l Uiersităţii "Politehic" di Timişor Seri ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS o ELECTRONICS d COMMUNICATIONS Tom 47(6), Fscicol -, 00 Gry leel imge ehcemet usig the Berstei polyomils

More information

4: RIEMANN SUMS, RIEMANN INTEGRALS, FUNDAMENTAL THEOREM OF CALCULUS

4: RIEMANN SUMS, RIEMANN INTEGRALS, FUNDAMENTAL THEOREM OF CALCULUS 4: RIEMA SUMS, RIEMA ITEGRALS, FUDAMETAL THEOREM OF CALCULUS STEVE HEILMA Contents 1. Review 1 2. Riemnn Sums 2 3. Riemnn Integrl 3 4. Fundmentl Theorem of Clculus 7 5. Appendix: ottion 10 1. Review Theorem

More information

Not for Sale. Integration. 5.1 Approximating Areas under Curves

Not for Sale. Integration. 5.1 Approximating Areas under Curves Not for Sle Itegrtio Chter Preview We re ow t criticl oit i the clculus stor. M would rgue tht this chter is the corerstoe of clculus ecuse it elis the reltioshi etwee the two rocesses of clculus: differetitio

More information

Introduction to Algorithms Chapter 3 Growth of Functions. How fast will your program run?

Introduction to Algorithms Chapter 3 Growth of Functions. How fast will your program run? Itroductio to Algorithms Chpter 3 Growth of Fuctios 3 -- How fst will your progrm ru? The ruig time of your progrm will deped upo: The lgorithm The iput Your implemettio of the lgorithm i progrmmig lguge

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

SOME IMPORTANT MATHEMATICAL FORMULAE

SOME IMPORTANT MATHEMATICAL FORMULAE SOME IMPORTANT MATHEMATICAL FORMULAE Circle : Are = π r ; Circuferece = π r Squre : Are = ; Perieter = 4 Rectgle: Are = y ; Perieter = (+y) Trigle : Are = (bse)(height) ; Perieter = +b+c Are of equilterl

More information

2.7 Sequences, Sequences of Sets

2.7 Sequences, Sequences of Sets 2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For

More information

Section 3.3: Geometric Sequences and Series

Section 3.3: Geometric Sequences and Series ectio 3.3: Geometic equeces d eies Geometic equeces Let s stt out with defiitio: geometic sequece: sequece i which the ext tem is foud by multiplyig the pevious tem by costt (the commo tio ) Hee e some

More information

The Field of Complex Numbers

The Field of Complex Numbers The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that

More information

8.5 Alternating infinite series

8.5 Alternating infinite series 65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,

More information

Homework 1 Solutions

Homework 1 Solutions Homewor 1 Solutios Math 171, Sprig 2010 Please sed correctios to herya@math.staford.edu 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that (f g h = f (g h. Solutio. Let x X. Note that ((f g h(x = (f g(h(x

More information

Page 2 of 14 = T(-2) + 2 = [ T(-3)+1 ] + 2 Substitute T(-3)+1 for T(-2) = T(-3) + 3 = [ T(-4)+1 ] + 3 Substitute T(-4)+1 for T(-3) = T(-4) + 4 After i

Page 2 of 14 = T(-2) + 2 = [ T(-3)+1 ] + 2 Substitute T(-3)+1 for T(-2) = T(-3) + 3 = [ T(-4)+1 ] + 3 Substitute T(-4)+1 for T(-3) = T(-4) + 4 After i Page 1 of 14 Search C455 Chapter 4 - Recursio Tree Documet last modified: 02/09/2012 18:42:34 Uses: Use recursio tree to determie a good asymptotic boud o the recurrece T() = Sum the costs withi each level

More information

Chapter Suppose you wish to use the Principle of Mathematical Induction to prove that 1 1! + 2 2! + 3 3! n n! = (n + 1)! 1 for all n 1.

Chapter Suppose you wish to use the Principle of Mathematical Induction to prove that 1 1! + 2 2! + 3 3! n n! = (n + 1)! 1 for all n 1. Chapter 4. Suppose you wish to prove that the followig is true for all positive itegers by usig the Priciple of Mathematical Iductio: + 3 + 5 +... + ( ) =. (a) Write P() (b) Write P(7) (c) Write P(73)

More information

Sequences II. Chapter 3. 3.1 Convergent Sequences

Sequences II. Chapter 3. 3.1 Convergent Sequences Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,

More information

TAYLOR SERIES, POWER SERIES

TAYLOR SERIES, POWER SERIES TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Module 4: Mathematical Induction

Module 4: Mathematical Induction Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on. Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have

More information

Limits, Continuity and derivatives (Stewart Ch. 2) say: the limit of f(x) equals L

Limits, Continuity and derivatives (Stewart Ch. 2) say: the limit of f(x) equals L Limits, Cotiuity ad derivatives (Stewart Ch. 2) f(x) = L say: the it of f(x) equals L as x approaches a The values of f(x) ca be as close to L as we like by takig x sufficietly close to a, but x a. If

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

Solutions to Section 1

Solutions to Section 1 Solutions to Section Exercise. Show tht nd. This follows from the fct tht mx{, } nd mx{, } Exercise. Show tht = { if 0 if < 0 Tht is, the bsolute vlue function is piecewise defined function. Grph this

More information

Tangent circles in the ratio 2 : 1. Hiroshi Okumura and Masayuki Watanabe. In this article we consider the following old Japanese geometry problem

Tangent circles in the ratio 2 : 1. Hiroshi Okumura and Masayuki Watanabe. In this article we consider the following old Japanese geometry problem 116 Taget circles i the ratio 2 : 1 Hiroshi Okumura ad Masayuki Wataabe I this article we cosider the followig old Japaese geometry problem (see Figure 1), whose statemet i [1, p. 39] is missig the coditio

More information

2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration

2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration Source: http://www.mth.cuhk.edu.hk/~mt26/mt26b/notes/notes3.pdf 25-6 Second Term MAT26B 1 Supplementry Notes 3 Interchnge of Differentition nd Integrtion The theme of this course is bout vrious limiting

More information

Uniform convergence and its consequences

Uniform convergence and its consequences Uniform convergence nd its consequences The following issue is centrl in mthemtics: On some domin D, we hve sequence of functions {f n }. This mens tht we relly hve n uncountble set of ordinry sequences,

More information

regular polygon Wkbj :37:30

regular polygon Wkbj :37:30 regular polygo Wkbj79 2013-03-21 13:37:30 A regular polygo is a polygo such that all of its sides are cogruet ad all of its iterior agles are cogruet; that is, a polygo which is both equilateral ad equiagular.

More information

MATH 361 Homework 9. Royden Royden Royden

MATH 361 Homework 9. Royden Royden Royden MATH 61 Homework 9 Royde..9 First, we show that for ay subset E of the real umbers, E c + y = E + y) c traslatig the complemet is equivalet to the complemet of the traslated set). Without loss of geerality,

More information

Lecture 7: Borel Sets and Lebesgue Measure

Lecture 7: Borel Sets and Lebesgue Measure EE50: Probability Foudatios for Electrical Egieers July-November 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,

More information

4.11 Inner Product Spaces

4.11 Inner Product Spaces 314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces

More information

Holomorphic vector-valued functions Paul Garrett garrett/ 1. Definition, examples

Holomorphic vector-valued functions Paul Garrett  garrett/ 1. Definition, examples (February 9, 2005) Holomorphic vector-valued fuctios Paul Garrett garrett@math.um.edu http://www.math.um.edu/ garrett/ Abstract: Oe of the first goals of a presetatio of classical complex fuctio theory

More information

Chapter 16. Fourier Series Analysis

Chapter 16. Fourier Series Analysis Chapter 6 Fourier Series alysis 6 Itroductio May electrical waveforms are period but ot siusoidal For aalysis purposes, such waveform ca be represeted i series form based o the origial work of Jea Baptise

More information

1. Strong vs regular indiction 2. Strong induction examples: ! Divisibility by a prime! Recursion sequence: product of fractions

1. Strong vs regular indiction 2. Strong induction examples: ! Divisibility by a prime! Recursion sequence: product of fractions Today s Topics: CSE 0: Discrete Mathematics for Computer Sciece Prof. Miles Joes 1. Strog vs regular idictio. Strog iductio examples:! Divisibility by a prime! Recursio sequece: product of fractios 3 4

More information

m n Use technology to discover the rules for forms such as a a, various integer values of m and n and a fixed integer value a.

m n Use technology to discover the rules for forms such as a a, various integer values of m and n and a fixed integer value a. TIth.co Alger Expoet Rules ID: 988 Tie required 25 iutes Activity Overview This ctivity llows studets to work idepedetly to discover rules for workig with expoets, such s Multiplictio d Divisio of Like

More information

CHAPTER II: LINEAR PROGRAMMING

CHAPTER II: LINEAR PROGRAMMING CHAPTER II: LINEAR PROGRAMMING CHAPTER II: LINEAR PROGRAMMING. The Bsic LP Prolem... Bsic LP Exmple... Other Forms of the LP Prolem...4 Assumptios of LP. 4.4. Ojective Fuctio Appropriteess. 4.4. Decisio

More information

13 Fast Fourier Transform (FFT)

13 Fast Fourier Transform (FFT) 13 Fast Fourier Trasform FFT) The fast Fourier trasform FFT) is a algorithm for the efficiet implemetatio of the discrete Fourier trasform. We begi our discussio oce more with the cotiuous Fourier trasform.

More information

Roots, Radicals, and Complex Numbers

Roots, Radicals, and Complex Numbers Chpter 8 Roots, Rils, Comple Numbers Agel, Itermeite Algebr, 7e Lerig Objetives Workig with squre roots Higher-orer roots; ris tht oti vribles Simplifig ril epressios Agel, Itermeite Algebr, 7e Squre Roots

More information

Chapter 18 Superposition and Standing Waves

Chapter 18 Superposition and Standing Waves hpter 8 Superpositio d Stdig Wves 8. Superpositio d Iterereces y '(, y(, + y (, Overlppig wves lgericlly dd to produce resultt wve (or et wve). Overlppig wves do ot i y wy lter the trvel o ech other. Superpositio

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

HW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson

HW 1 Solutions Math 115, Winter 2009, Prof. Yitzhak Katznelson HW Solutios Math 5, Witer 2009, Prof. Yitzhak Katzelso.: Prove 2 + 2 2 +... + 2 = ( + )(2 + ) for all atural umbers. The proof is by iductio. Call the th propositio P. The basis for iductio P is the statemet

More information

Sect Simplifying Radical Expressions. We can use our properties of exponents to establish two properties of radicals:

Sect Simplifying Radical Expressions. We can use our properties of exponents to establish two properties of radicals: 70 Sect 11. - Simplifyig Rdicl Epressios Cocept #1 Multiplictio d Divisio Properties of Rdicls We c use our properties of epoets to estlish two properties of rdicls: () 1/ 1/ 1/ & ( ) 1/ 1/ 1/ Multiplictio

More information

and thus, they are similar. If k = 3 then the Jordan form of both matrices is

and thus, they are similar. If k = 3 then the Jordan form of both matrices is Homework ssignment 11 Section 7. pp. 249-25 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If

More information

Second Order Linear Partial Differential Equations. Part III

Second Order Linear Partial Differential Equations. Part III Secod Order iear Partial Differetial Equatios Part III Oe-dimesioal Heat oductio Equatio revisited; temperature distributio of a bar with isulated eds; ohomogeeous boudary coditios; temperature distributio

More information

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is 0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values

More information

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding 1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

SOLUTION & ANSWER FOR KCET-2009 VERSION A-2

SOLUTION & ANSWER FOR KCET-2009 VERSION A-2 SOLUTION & ANSWER FOR KCET-9 VERSION A- [MATHEMATICS]. cos ec( a) cos ecd si a [ si( a) cos ec] + C Sol. : si[ ( a) sicos(-a) cos si( a) cos ec( a) cos ecd d si a si( a) [ cot( a) cot ] d si a si( a) +

More information