The Field of Complex Numbers

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "The Field of Complex Numbers"

Transcription

1 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 there is o real umber whose square is 1.) The system of complex umbers cosists of all umbers of the form a + bi where a ad b are real umbers. We de e additio ad multiplicatio for complex umbers i such a way that the rules of additio ad multiplicatio are cosistet with the rules for real umbers. Thus, if z 1 = a 1 + b 1 i ad z = a + b i, we de e ad z 1 + z = (a 1 + a ) + (b 1 + b ) i z 1 z = (a 1 + b 1 i) (a + b i) = a 1 a + a 1 b i + a b 1 i + b 1 b i = (a 1 a b 1 b ) + (a 1 b + a b 1 ) i. To be formal, we de e the system of complex umbers to cosist of the set C = f(a; b) j a ad b are real umbersg with additio ad multiplicatio de ed for z 1 = (a 1 ; b 1 ) ad z = (a ; b ) i C by z + z = (a 1 + a ; b 1 + b ) ad z 1 z = (a 1 a b 1 b ; a 1 b + a b 1 ). Note that this de itio of the complex umbers (i terms of ordered pairs of real umbers) is similar to the formal de itio that we gave for rigs of polyomials the di ereces beig that elemets of rigs of polyomials 1

2 cosist of i ite sequeces of elemets (oly a ite umber of which are o zero) ad that the rule of multiplicatio is de ed di eretly. The umber i C is formally de ed as i = (0; 1). I order to show that C (with the operatios of additio ad multiplicatio de ed above) is a eld, me must show that C is a commutative rig with uity ad that all o zero members of C are uits. 0.1 C is closed uder additio ad multiplicatio Let z 1 ad z C. The z 1 = (a 1 ; b 1 ) ad z = (a ; b ) where a 1 ; a ; b 1 ; ad b are real umbers. Also (by the de itios of additio ad multiplicatio), we have z + z = (a 1 + a ; b 1 + b ) ad z 1 z = (a 1 a b 1 b ; a 1 b + a b 1 ). Sice a 1 + a, b 1 + b, a 1 a b 1 b, ad a 1 b + a b 1 are all real umbers, we see that z 1 + z ad z 1 z are both members of C. Thus C is closed uder additio ad multiplicatio. 0. Associative Laws of Additio ad Multiplicatio Let z 1 = (a 1 ; b 1 ), z = (a ; b ), ad z = (a ; b ) be members of C. The z 1 + (z + z ) = (a 1 ; b 1 ) + (a + a ; b + b ) = (a 1 + (a + a ) ; b 1 + (b + b )) = ((a 1 + a ) + a ; (b 1 + b ) + b ) = (z 1 + z ) + z which shows that the associative property of additio is satis ed. (Note that the associative property of additio for real umbers is used i showig this.) Also z 1 (z z ) = (a 1 ; b 1 ) (a a b b ; a b + a b ) = (a 1 (a a b b ) b 1 (a b + a b ) ; a 1 (a b + a b ) + b 1 (a a b b )) = (a 1 a a a 1 b b a b 1 b a b 1 b ; a 1 a b + a 1 a b + a a b 1 b 1 b b )

3 ad (z 1 z ) z = (a 1 a b 1 b ; a 1 b + a b 1 ) (a ; b ) = ((a 1 a b 1 b ) a (a 1 b + a b 1 ) b ; (a 1 a b 1 b ) b + (a 1 b + a b 1 ) a ) = (a 1 a a a 1 b b a b 1 b a b 1 b ; a 1 a b + a 1 a b + a a b 1 b 1 b b ) which shows that the associative property of multiplicatio is satis ed. 0. Commutative Properties of Additio ad Multiplicatio Let z 1 = (a 1 ; b 1 ) ad z = (a ; b ) be members of C. The z 1 + z = (a 1 + a ; b 1 + b ) = (a + a 1 ; b + b 1 ) = z + z 1 which shows that the commutative property of additio is satis ed, ad z 1 z = (a 1 ; b 1 ) (a ; b ) = (a 1 a b 1 b ; a 1 b + a b 1 ) = (a a 1 b b 1 ; b a 1 + b 1 a ) = (a ; b ) (a 1 ; b 1 ) = z z 1 which shows that the commutative property of multiplicatio is satis ed. 0. Existece of Additive ad Multiplicative Idetity Elemets The complex umber 0 = (0; 0) serves as a additive idetity elemet for C because if z = (a; b) is ay complex umber the z + 0 = (a; b) + (0; 0) = (a + 0; b + 0) = (a; b) = z ad it is also obvious that 0 + z = z.

4 The complex umber 1 = (1; 0) serves as a multiplicative idetity elemet for C because if z = (a; b) is ay complex umber the 1z = (1; 0) (a; b) = (1a 0b; 1b + 0a) = (a; b) = z (ad, sice the commutative property of multiplicatio is satis ed, it is also true that z1 = z). 0.5 Existece of Additive Iverses Let z = (a; b) be a complex umber. The z = ( a; b) is also a complex umber ad z + ( z) = (a; b) + ( a; b) = (a + ( a) ; b + ( b)) = (0; 0) = 0 which shows that z (as de ed) is the additive iverse of z. 0.6 Distributive Property Let z 1 = (a 1 ; b 1 ), z = (a ; b ), ad z = (a ; b ) be members of C. The z 1 (z + z ) = (a 1 ; b 1 ) (a + a ; b + b ) = (a 1 (a + a ) b 1 (b + b ) ; a 1 (b + b ) + b 1 (a + a )) = (a 1 a + a 1 a b 1 b b 1 b ; a 1 b + a 1 b + a b 1 + a b 1 ) = ((a 1 a b 1 b ) + (a 1 a b 1 b ) ; (a 1 b + a b 1 ) + (a 1 b + a b 1 )) = z 1 z + z 1 z which shows that the distributive property is satis ed. 0.7 Existece of Multiplicative Iverses Let z = (a; b) be a complex umber with z 6= 0. (This meas that ot both a ad b are zero ad thus that a + b 6= 0.) We claim that the complex umber a z 1 = a + b ; b a + b

5 is the multiplicative iverse of z. To check that this correct, observe that a zz 1 = (a; b) a + b ; b a + b a = a + b + b a + b ; ab a + b + ab a + b = (1; 0) = 1. 1 Some Termiology, De itios, Etc. A complex umber of the form (a; 0) ca be ideti ed with the real umber a ad we make the covetio to write (a; 0) = a. (For example, (0; 0) = 0 ad (1; 0) = 1.) A complex umber of the form (0; b) is called a purely imagiary umber. Thus, for example, the umber (0; 1) = i is a purely imagiary umber. A complex umber, (a; b), for which b 6= 0 is called a imagiary umber. Thus the system of complex umbers is made up of the real umbers ad the imagiary umbers (some of which are purely imagiary). If z = (a; b) is ay complex umber, the (a; b) = (a; 0) + (0; b) = (a; 0) + (b; 0) (0; 1) = a + bi ad we usually d it more coveiet to write z = a + bi (istead of z = (a; b)) i doig calculatios. The usual rules of algebra of the real umbers carry over exactly to the complex umbers. We just eed to remember that i = (0; 1) (0; 1) = ( 1; 0) = 1. However, the view of a complex umber as a ordered pair of real umbers is useful for gaiig a visual picture of the complex umbers. Each complex umber, (a; b), ca be ideti ed with the poit (a; b) i the Cartesia Plae. Whe dealig with complex umbers, we call this the complex plae. Just as we de e the absolute value of a real umber to be the distace from that umber to the origi o the umber lie, we de e the modulus (or absolute value) of a complex umber, z = (a; b), to be the distace from z to 0 = (0; 0) i the complex plae. The otatio for the modulus of z is the same otatio used for the absolute value of a real umber. Thus if z = (a; b), the jzj = p a + b. 5

6 The locatio of a complex umber i the complex plae is completely determied by the modulus of the umber ad by a argumet of the umber. Assumig that z = a + bi 6= 0, a argumet of z is ay umber (agle) such that cos () = a jzj ad si () = b jzj. The basic geometric picture relatig z, jzj, ad is give below. b z=a+bi z θ a Ay complex umber, z = a + bi 6= 0, has i itely may argumets but they all di er by multiples of. Thus, for example, = is a argumet of the umber z = 1 + i, but so is = + = 9= ad so is = 8 = 1=. The pricipal argumet of a complex umber z 6= 0 is the uique argumet,, such that <. The pricipal argumet of z is deoted by Arg (z) ad the set of all argumets of z is deoted by arg (z). Thus arg (z) = farg (z) + k j k Zg. Usig the otio of cogruece modulo, we ca write this as arg (z) = [Arg (z)]. To illustrate these ideas, let us cosider the complex umber z = 1 + i. 6

7 For this umber, we have jzj = p = p Arg (z) = arg (z) = ; 9 ; 17 ; : : : [ This example is illustrated i the picture below. 7 ; 15 ; ; : : :. z=1+i π/ We remark that the complex umber 0 is the oly complex umber for which the argumet is ot de ed. For ay o zero complex umber, z = a + bi, with argumet (where ca be ay member of arg (z)), we observe that z = a + bi = jzj cos () + jzj si () i = jzj (cos () + si () i). I order to express this more brie y, we de e This allows us to write cis () = cos () + si () i. z = a + bi = jzj cis (). For example, we ca write 1 + i = p cis. 7

8 Both ways of expressig a complex umber (a + bi ad jzj cis ()) are useful. I particular, we will see that the expressio a + bi is useful i helpig us to gai a geometric uderstadig of additio of complex umbers; whereas the expressio jzj cis () is useful i helpig us to gai a geometric uderstadig of multiplicatio of complex umbers. Exercise 1 Let z = + i ad w = i. 1. Compute z + w.. Compute zw.. Fid w 1.. Compute z=w (which meas zw 1 ). 5. Fid jzj, Arg (z), ad arg (z) ad write z i the form z = jzj cis () (where is ay member of arg (z)). Exercise Suppose that jzj = ad Arg (z) = z = a + bi. =6. Write z i the form Exercise If A is ay set of real umbers ad b is ay real umber, the we de e the set A + b as A + b = fa + b j a Ag. Thus, for example, if A = f ; 1; ; 5g, the A + 5 = f1; 6; 8; 0g. Suppose that z is a o zero complex umber ad that k is a o zero real umber. Explai why arg (kz) = arg (z) if k > 0 ad arg (kz) = arg (z) + if k < 0. Geometric Iterpretatios of Additio ad Multiplicatio of Complex Numbers.1 Additio If z = a + bi ad w = c + di are complex umbers, the z + w = (a + c) + (b + d) i. 8

9 If we picture z ad w as vectors i the complex plae, the z +w is the vector sum of z ad w. This is illustrated i the gure below usig the example z = w = + i i z + w = 1 + i Multiplicatio If z = jzj cis () ad w = jwj cis () are two o zero complex umbers, the zw = jzj jwj (cos () + si () i) (cos () + si () i) = jzj jwj (cos () cos () si () si () + (cos () si () + si () cos ()) i) = jzj jwj (cos ( + ) + si ( + ) i) = jzj jwj cis ( + ). This shows that the modulus of zw is the product of the moduli of z ad w ad that a argumet of zw is the sum of a argumet of z ad a argumet of w. To illustrate this idea, let us take z = 1+i ad w = i. Note that jzj = p, Arg (z) = =, jwj = 1, ad Arg (w) = =. Also zw = (1 + i) i = 1 + i 9

10 ad we observe that ad that Arg (zw) = jzwj = p = jzj jwj = Arg (z) + Arg (w). Exercise Suppose that z is a o zero complex umber ad suppose that is a argumet of z. Explai why must be a argumet of z 1. (Hit: What is a argumet of the umber 1?) Exercise 5 Prove that if z = jzj cis () ad w = jwj cis () are o zero complex umbers, the z w = jzj cis ( ). jwj Exercise 6 Explai why it is ot always true (for ay two o zero complex umbers, z ad w) that Arg (zw) = Arg (z) + Arg (w) : Give a example of two complex umbers, z ad w, for which the above equatio is true ad the give a example where the above equatio is ot true. Exercise 7 If A ad B are two sets, the we de e the set A + B as A + B = fa + b j a A ad b Bg. For example, if A = f ; 5; 6g ad B = f1; ; 5; 7g, the A + B = f ; ; 1; ; 6; 7; 10; 1; 8; 11; 1g. Explai why it is true for ay two o zero complex umbers, z ad w, that arg (zw) = arg (z) + arg (w). 10

11 De Moivre s Formula ad Roots of Complex Numbers We will ow prove (by iductio) that if z = jzj cis () is a o zero complex umber ad is ay positive iteger, the z = jzj cis (). This formula is clearly true whe = 1 ad if we assume that it s truth has bee proved for some positive iteger, the we obtai z +1 = zz = jzj cis () jzj cis () = jzj +1 (cos () + si () i) (cos () + si () i) = jzj +1 ((cos () cos () si () si ()) + (cos () si () + si () cos ()) i) = jzj +1 (cos (( + 1) ) + si (( + 1) ) i) = jzj +1 cis (( + 1) ) thus showig that the truth of the formula for implies the truth of the formula for + 1. This formula is called De Moivre s formula. To illustrate DeMoivre s Formula, let us use it to compute (1 + i) 8. Sice j1 + ij = p ad Arg (1 + i) = =, we ca write 1 + i = p cis. The by De Moivre s formula, p 8 (1 + i) 8 = cis 8 = 16 (cos () + si () i) = 16 (1 + 0i) = 16. We will ow address the questio of dig the th roots of a give o zero complex umber, w = jwj cis (), where is ay give positive iteger. Our rst observatio is that oe such root is the umber z 0 = p jwjcis 11

12 because (by De Moivre s formula) p z0 p = jwjcis = jwj cis = jwj cis () = w. We will show that w has exactly distict th roots. To see this, let z be ay th root of w (z = w) ad ote that it must be true that Also ote that sice jzj = p jwj. arg (w) = f + k j k Zg, the it follows from De Moivre s formula that + k arg (z) = j k Z. For k = 0; 1; ; : : : 1, the umbers + k cis are all distict from each other but + j + k cis = cis wheever j k mod because if j k mod, the j = k + t for some iteger t ad we have + j + (k + t) cis = cis + k = cis + t + k = cis. We coclude that if w = jwj cis (), the the distict th roots of w are z = p + k jwjcis, k = 0; 1; ; : : : 1. 1

13 Note that, i the above discussio, ca be ay member of arg (w). I particular, we ca certaily take = Arg (w). The pricipal th root of w, which we deote by p w, is de ed to be the root p p w = Arg (w) jwjcis. Example 8 Let us d the three cube roots of 1. Sice j1j = 1 ad Arg (1) = 0, the pricipal cube root of 1 is p p 0 1 = 1cis = cos (0) + si (0) i = 1 ad the other two cube roots of 1 are p 0 + (1) 1cis = cos + si i = 1 p + i ad p 0 + () 1cis = cos + si i = 1 p i. 1 Let us check by computatio that + p i is a cube root of 1. We will use the formula (x + y) = x + x y + xy + y. = p! 1 + i 1 + = p 8 i = 1. p! 1 i + p 8 i p! 1 i + p! i Example 9 Let us d the two square roots of i. Sice jij = 1 ad Arg (i) = =, the pricipal square root of i is p p = p p i = 1cis = cos + si i = + i 1

14 ad the other square root of i is p = + (1) 1cis = cos 5 + si 5 i = p p i. Remark 10 For ay o zero complex umber, w, the th roots of w are spaced evely aroud the circle of radius p jwj cetered at the origi of the complex plae. Exercise 11 Fid the four fourth roots of 1 ad the four fourth roots of 16. Exercise 1 Fid the three cube roots of 1. Exercise 1 Fid the three cube roots of 8i. Reducibility of Polyomials i C [x] We have bee studyig the problem of reducibility of polyomials f F [x] where F is a give eld (or perhaps eve just a commutative rig with uity). We have see examples of polyomials that are ot reducible i Z [x] ; Q [x], ad R [x] (where R is the eld of real umbers). Oe of the very importat properties of the eld of complex umbers, C, is that all polyomials are reducible i C [x]! Furthermore (ad this is actually a equivalet statemet), all polyomials ca be factored ito liear factors i C [x]. This fact, which was discovered through the combied e orts of may famous mathematicias (Gauss, LaGrage, Weierstrass, to ame a few) over a more tha 100 year period is what is referred to as the Fudametal Theorem of Algebra. Theorem 1 (The Fudametal Theorem of Algebra) Let f (x) = a x + a 1 x 1 + : : : + a 1 x + a 0 be a polyomial i C [x]. The f ca be factored ito liear factors: f (x) = a (x r 1 ) (x r ) (x r ) where r 1 ; r : : : ; r are the (ot ecessarily distict) roots of f. 1

15 Although we will ot attempt to prove this theorem, we will illustrate it with a simple example: If we cosider the polyomial f (x) = x 5 x + x 6x 8x + = x + x (x ), we see that this polyomial is reducible i Z [x] (which is show by the factorizatio give above). However, sice both x + ad x are irreducible i Z [x], we see that f caot be factored ito liear factors i Z [x]. If we cosider f as a polyomial i R [x] (where R is the eld of real umbers), the f (x) = x + p x x + p (x ) which shows that f ca be further factored i R [x] (i compariso with Z [x]). Fially, if we cosider f as a polyomial i C [x], the p f (x) = (x i) (x + i) x x + p (x ) which is a complete factorizatio of f ito liear factors. Exercise 15 Factor the followig polyomials as completely as possible i Z [x], R [x], ad C [x]. 1. f (x) = x x + x. f (x) = x 7x 18. f (x) = x + 5x + 1 Exercise 16 If z = a + bi is a complex umber, the the complex cojugate of z, deoted by z, is de ed as z = a bi. For example, if z = 9 + 8i, the z = 9 8i. Prove that the followig facts are true for ay complex umbers z ad w: 1. z + w = z + w. zw = z w.. If z is a real umber the z = z.. If f is ay polyomial with real coe ciets ad z is a complex umber that is a root of f, the z is also a root of f. 15

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

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

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

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

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

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

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

Section 8.3 : De Moivre s Theorem and Applications

Section 8.3 : De Moivre s Theorem and Applications The Sectio 8 : De Moivre s Theorem ad Applicatios Let z 1 ad z be complex umbers, where z 1 = r 1, z = r, arg(z 1 ) = θ 1, arg(z ) = θ z 1 = r 1 (cos θ 1 + i si θ 1 ) z = r (cos θ + i si θ ) ad z 1 z =

More information

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This

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

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

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

DEFINITION OF INVERSE MATRIX

DEFINITION OF INVERSE MATRIX Lecture. Iverse matrix. To be read to the music of Back To You by Brya dams DEFINITION OF INVERSE TRIX Defiitio. Let is a square matrix. Some matrix B if it exists) is said to be iverse to if B B I where

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

1 Set Theory and Functions

1 Set Theory and Functions Set Theory ad Fuctios. Basic De itios ad Notatio A set A is a collectio of objects of ay kid. We write a A to idicate that a is a elemet of A: We express this as a is cotaied i A. We write A B if every

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

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

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu> (March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1

More information

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,

More information

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

Divide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015

Divide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015 CS125 Lecture 4 Fall 2015 Divide ad Coquer We have see oe geeral paradigm for fidig algorithms: the greedy approach. We ow cosider aother geeral paradigm, kow as divide ad coquer. We have already see a

More information

3. Greatest Common Divisor - Least Common Multiple

3. Greatest Common Divisor - Least Common Multiple 3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

More information

1.3 Binomial Coefficients

1.3 Binomial Coefficients 18 CHAPTER 1. COUNTING 1. Biomial Coefficiets I this sectio, we will explore various properties of biomial coefficiets. Pascal s Triagle Table 1 cotais the values of the biomial coefficiets ( ) for 0to

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

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

The Field Q of Rational Numbers

The Field Q of Rational Numbers Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees

More information

Section 6.1 Radicals and Rational Exponents

Section 6.1 Radicals and Rational Exponents Sectio 6.1 Radicals ad Ratioal Expoets Defiitio of Square Root The umber b is a square root of a if b The priciple square root of a positive umber is its positive square root ad we deote this root by usig

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

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively

More information

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required.

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required. S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,

More information

Basic Elements of Arithmetic Sequences and Series

Basic Elements of Arithmetic Sequences and Series MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic

More information

The Euler Totient, the Möbius and the Divisor Functions

The Euler Totient, the Möbius and the Divisor Functions The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship

More information

Section 1.6: Proof by Mathematical Induction

Section 1.6: Proof by Mathematical Induction Sectio.6 Proof by Iductio Sectio.6: Proof by Mathematical Iductio Purpose of Sectio: To itroduce the Priciple of Mathematical Iductio, both weak ad the strog versios, ad show how certai types of theorems

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

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

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4

GCE Further Mathematics (6360) Further Pure Unit 2 (MFP2) Textbook. Version: 1.4 GCE Further Mathematics (660) Further Pure Uit (MFP) Tetbook Versio: 4 MFP Tetbook A-level Further Mathematics 660 Further Pure : Cotets Chapter : Comple umbers 4 Itroductio 5 The geeral comple umber 5

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then

4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or p-series (the Compariso Test), but of

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

Linear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant

Linear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant MTH6140 Liear Algebra II Notes 4 1st November 2010 4 Determiats The determiat is a fuctio defied o square matrices; its value is a scalar. It has some very importat properties: perhaps most importat is

More information

Mathematical goals. Starting points. Materials required. Time needed

Mathematical goals. Starting points. Materials required. Time needed Level A1 of challege: C A1 Mathematical goals Startig poits Materials required Time eeded Iterpretig algebraic expressios To help learers to: traslate betwee words, symbols, tables, ad area represetatios

More information

Learning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.

Learning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr. Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the

More information

Solving Divide-and-Conquer Recurrences

Solving Divide-and-Conquer Recurrences Solvig Divide-ad-Coquer Recurreces Victor Adamchik A divide-ad-coquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios

More information

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means) CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:

More information

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean 1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

More information

Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites

Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites Gregory Carey, 1998 Liear Trasformatios & Composites - 1 Liear Trasformatios ad Liear Composites I Liear Trasformatios of Variables Meas ad Stadard Deviatios of Liear Trasformatios A liear trasformatio

More information

8.1 Arithmetic Sequences

8.1 Arithmetic Sequences MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first

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

Exploratory Data Analysis

Exploratory Data Analysis 1 Exploratory Data Aalysis Exploratory data aalysis is ofte the rst step i a statistical aalysis, for it helps uderstadig the mai features of the particular sample that a aalyst is usig. Itelliget descriptios

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

A Recursive Formula for Moments of a Binomial Distribution

A Recursive Formula for Moments of a Binomial Distribution A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

2-3 The Remainder and Factor Theorems

2-3 The Remainder and Factor Theorems - The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x

More information

Distributions of Order Statistics

Distributions of Order Statistics Chapter 2 Distributios of Order Statistics We give some importat formulae for distributios of order statistics. For example, where F k: (x)=p{x k, x} = I F(x) (k, k + 1), I x (a,b)= 1 x t a 1 (1 t) b 1

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

The second difference is the sequence of differences of the first difference sequence, 2

The second difference is the sequence of differences of the first difference sequence, 2 Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

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

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

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

REVISION SHEET FP2 (AQA) CALCULUS. x x π π. Standard Calculus of Inverse Trig and Hyperbolic Trig Functions = + arcsin x = + ar sinh x

REVISION SHEET FP2 (AQA) CALCULUS. x x π π. Standard Calculus of Inverse Trig and Hyperbolic Trig Functions = + arcsin x = + ar sinh x the Further Mathematics etwork www.fmetwork.org.uk V 07 REVISION SHEET FP (AQA) CALCULUS The mai ideas are: Calculus usig iverse trig fuctios & hperbolic trig fuctios ad their iverses. Calculatig arc legths.

More information

1 Correlation and Regression Analysis

1 Correlation and Regression Analysis 1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

More information

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Solutions to Exercises Chapter 4: Recurrence relations and generating functions Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose

More information

Sum and Product Rules. Combinatorics. Some Subtler Examples

Sum and Product Rules. Combinatorics. Some Subtler Examples Combiatorics Sum ad Product Rules Problem: How to cout without coutig. How do you figure out how may thigs there are with a certai property without actually eumeratig all of them. Sometimes this requires

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Unit 20 Hypotheses Testing

Unit 20 Hypotheses Testing Uit 2 Hypotheses Testig Objectives: To uderstad how to formulate a ull hypothesis ad a alterative hypothesis about a populatio proportio, ad how to choose a sigificace level To uderstad how to collect

More information

7. Sample Covariance and Correlation

7. Sample Covariance and Correlation 1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y

More information

Equation of a line. Line in coordinate geometry. Slope-intercept form ( 斜 截 式 ) Intercept form ( 截 距 式 ) Point-slope form ( 點 斜 式 )

Equation of a line. Line in coordinate geometry. Slope-intercept form ( 斜 截 式 ) Intercept form ( 截 距 式 ) Point-slope form ( 點 斜 式 ) Chapter : Liear Equatios Chapter Liear Equatios Lie i coordiate geometr I Cartesia coordiate sstems ( 卡 笛 兒 坐 標 系 統 ), a lie ca be represeted b a liear equatio, i.e., a polomial with degree. But before

More information

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

More information

Tagore Engineering College Department of Electrical and Electronics Engineering EC 2314 Digital Signal Processing University Question Paper Part-A

Tagore Engineering College Department of Electrical and Electronics Engineering EC 2314 Digital Signal Processing University Question Paper Part-A Tagore Egieerig College Departmet of Electrical ad Electroics Egieerig EC 34 Digital Sigal Processig Uiversity Questio Paper Part-A Uit-I. Defie samplig theorem?. What is kow as Aliasig? 3. What is LTI

More information

Literal Equations and Formulas

Literal Equations and Formulas . Literal Equatios ad Formulas. OBJECTIVE 1. Solve a literal equatio for a specified variable May problems i algebra require the use of formulas for their solutio. Formulas are simply equatios that express

More information

Recursion and Recurrences

Recursion and Recurrences Chapter 5 Recursio ad Recurreces 5.1 Growth Rates of Solutios to Recurreces Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer. Cosider, for example,

More information

Algebra Vocabulary List (Definitions for Middle School Teachers)

Algebra Vocabulary List (Definitions for Middle School Teachers) Algebra Vocabulary List (Defiitios for Middle School Teachers) A Absolute Value Fuctio The absolute value of a real umber x, x is xifx 0 x = xifx < 0 http://www.math.tamu.edu/~stecher/171/f02/absolutevaluefuctio.pdf

More information

Solving Inequalities

Solving Inequalities Solvig Iequalities Say Thaks to the Authors Click http://www.ck12.org/saythaks (No sig i required) To access a customizable versio of this book, as well as other iteractive cotet, visit www.ck12.org CK-12

More information

Figure 40.1. Figure 40.2

Figure 40.1. Figure 40.2 40 Regular Polygos Covex ad Cocave Shapes A plae figure is said to be covex if every lie segmet draw betwee ay two poits iside the figure lies etirely iside the figure. A figure that is ot covex is called

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 007 MARKS: 50 TIME: 3 hours This questio paper cosists of pages, 4 diagram sheets ad a -page formula sheet. Please tur over Mathematics/P DoE/Exemplar

More information

Permutations, the Parity Theorem, and Determinants

Permutations, the Parity Theorem, and Determinants 1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

More information

AQA STATISTICS 1 REVISION NOTES

AQA STATISTICS 1 REVISION NOTES AQA STATISTICS 1 REVISION NOTES AVERAGES AND MEASURES OF SPREAD www.mathsbox.org.uk Mode : the most commo or most popular data value the oly average that ca be used for qualitative data ot suitable if

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

Analysis Notes (only a draft, and the first one!)

Analysis Notes (only a draft, and the first one!) Aalysis Notes (oly a draft, ad the first oe!) Ali Nesi Mathematics Departmet Istabul Bilgi Uiversity Kuştepe Şişli Istabul Turkey aesi@bilgi.edu.tr Jue 22, 2004 2 Cotets 1 Prelimiaries 9 1.1 Biary Operatio...........................

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Factors of sums of powers of binomial coefficients

Factors of sums of powers of binomial coefficients ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the

More information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

More information

Taylor Series and Polynomials

Taylor Series and Polynomials Taylor Series ad Polyomials Motivatios The purpose of Taylor series is to approimate a fuctio with a polyomial; ot oly we wat to be able to approimate, but we also wat to kow how good the approimatio is.

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

Chapter One BASIC MATHEMATICAL TOOLS

Chapter One BASIC MATHEMATICAL TOOLS Chapter Oe BAIC MATHEMATICAL TOOL As the reader will see, the study of the time value of moey ivolves substatial use of variables ad umbers that are raised to a power. The power to which a variable is

More information

NOTES ON INEQUALITIES FELIX LAZEBNIK

NOTES ON INEQUALITIES FELIX LAZEBNIK NOTES ON INEQUALITIES FELIX LAZEBNIK Order ad iequalities are fudametal otios of moder mathematics. Calculus ad Aalysis deped heavily o them, ad properties of iequalities provide the mai tool for developig

More information

COMPLEX NUMBERS. a bi c di a c b d i. a bi c di a c b d i For instance, 1 i 4 7i 1 4 1 7 i 5 6i

COMPLEX NUMBERS. a bi c di a c b d i. a bi c di a c b d i For instance, 1 i 4 7i 1 4 1 7 i 5 6i COMPLEX NUMBERS _4+i _-i FIGURE Complex numbers as points in the Arg plane i _i +i -i A complex number can be represented by an expression of the form a bi, where a b are real numbers i is a symbol with

More information