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


 Shonda Fletcher
 1 years ago
 Views:
Transcription
1 The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA
2 Ackowledgemets This work was supported by the Mout Holyoke College fellowship for summer research ad the Mout Holyoke College Departmet of Mathematics ad Statistics. I would like to thak Professor Margaret Robiso for all the help ad guidace she gave me this summer. I would also like to thak Professor Jessica Sidema ad all the other studets participatig i the Mout Holyoke College Summer REU 2005 for their support ad time. 2
3 1 Itroductio The theory of umbers is a area of mathematics which deals with the properties of whole ad ratioal umbers. Aalytic umber theory is oe of its braches, which ivolves study of arithmetical fuctios, their properties ad the iterrelatioships that exist amog these fuctios. I this paper I will itroduce some of the three very importat examples of arithmetical fuctios, as well as a cocept of the possible operatios we ca use with them. There are four propositios which are metioed i this paper ad I have used the defiitios of these arithmetical fuctios ad some Lemmas which reflect their properties, i order to prove them. 2 Defiitios Here are some defiitios to illustrate how the fuctios work ad describe some of their most useful properties. 2.1 Arithmetical fuctio A real or complex valued fuctio with domai the positive itegers is called a arithmetical or a umbertheoretic fuctio. 2.2 Multiplicative fuctios A arithmetical fuctio f is called multiplicative if f is ot idetically zero ad if f(m) = f(m)f() wheever (m, ) = 1. A multiplicative fuctio f is called completely multiplicative if f(m) = f(m)f() for all m,. 3
4 2.3 The Möbius fuctio The Möbius fuctio is a arithmetical fuctio, which takes the followig values: µ(1) = 1 ad for = p a 1 1 p a p a m m, where > 1, we defie µ() to be: µ() = ( 1) m if a 1 = a 2 =... = a m = 1, µ() = 0 otherwise. This defiitio implies that the Möbius fuctio will be zero if ad oly if has a square factor larger tha oe. Let us look at a short table of the values of µ() for some positive itegers: µ() The Möbius fuctio is a example of a multiplicative, but ot completely multiplicative fuctio, sice φ(4) = 0 but φ(2)φ(2) = 1. Oe if its most 4
5 importat applicatios is i the formulas for the Euler totiet, which is the ext fuctio I will defie. 2.4 The Euler totiet The Euler totiet fuctio is defied to be the umber of positive itegers which are less or equal to a iteger ad are relatively prime to that iteger: for 1, the Euler totiet φ() is: φ() = 1, where the idicates that the sum is oly over the itegers relatively prime to. Below is a table of the values of φ() for some small positive itegers: φ() There is a formula for the divisor sum which is oe of the most useful properties of the Euler totiet: 5
6 Lemma 1: for 1 we have φ(d) =. d Sice the Euler totiet is the umber of positive itegers relatively prime to we ca calculate φ() as a product over the prime divisors of, where 1: Lemma 2: φ() = p (1 1 p ). The followig formula gives a relatio betwee the Euler totiet ad the Möbius fuctio: Lemma 3: for 1 we have: φ() = d µ(d) d. The Euler totiet is aother multiplicative fuctio which is ot completely multiplicative because φ(4) = 2 but φ(2)φ(2) = The divisor fuctios For a real or a complex umber α ad a iteger 1 we defie σ α () = d d α to be the sum of the αth powers of the divisors of, called the divisor fuctio σ α (). These fuctios are also multiplicative. 6
7 If we look at the trivial case whe α = 0 we say that σ 0 () is the umber of divisors of. I the case that α = 1 we defie σ 1 () as the sum of the divisors of. Sice the fuctio is multiplicative we kow that for = p a 1 1 p a p am m the σ α () = σ α (p a 1 1 σ α (p a 2 2 )...σ α (p am m ).There is a formula for the divisor fuctio of a iteger power of a prime: Lemma 3: σ α (p a ) = 1 α + p α + p 2α p aα = pα(a+1) 1 p α 1 if α 0 σ 0 (p a ) = a + 1 if α = 0 The ext defiitio I will itroduce is the Dirichlet product of arithmetical fuctios, which is represeted by a sum, occurrig very ofte i umber theory. 2.6 Dirichlet product of arithmetical fuctios The Dirichlet product of two arithmetical fuctios f ad g is defied to be a arithmetical fuctio h() such that: (f g)() = h() = d f(d)g( d ). If we look at the formula for the relatio betwee the Euler totiet ad the Möbius fuctio, we will see that for a fuctio N, such that N() = the φ = µ N. 7
8 3 Propositios ad their proofs 3.1 Propositio 1 For a positive iteger we have that: φ() = d µ 2 (d) φ(d) where the sum is over all the divisors of. Proof: We kow by Lemma 2 that φ() = p (1 1 p ) so if we let = p a 1 1 p a p a m m, we ca express φ() i the followig φ() = (1 1 p 1 ) (1 1 p 2 )... (1 1 p m ) Takig a commo deomiator for each of the terms i the paretheses we see that: Thus we have that φ() = (p 1 1) (p 2 1)... (p m 1) p 1 p 2... p m. φ() = (p 1 1) (p 2 1)... (p m = 1) p 1 p 2... p m p 1 p 2... p m (p 1 1) (p 2 1)... (p m 1) This equatio is our result for the left had side of the idetity we have to prove. We will deote φ() with the iitials LHS for the rest of the proof. 8
9 Now we look at the right had side of the idetity above. From the defiitio of the Möbius fuctio we kow that for = p a 1 1 p a p a m m µ() = ( 1) m ad µ() = 0, whe has a square term. Therefore µ 2 (d) = 1 if d has o square term ad µ 2 (d) = 0 if d has a square term. Thus our sum will be over oly the square free divisors of sice if a divisor is ot square free we will have a zero term. For the rest of this paper d 1 will represet a divisor of which is square free: d 1 µ 2 (d 1 ) φ(d 1 ) = 1 φ(d 1 ) d 1 Sice d 1 is square free d 1 will be ay product of the prime factors of, where each prime could be used oly oce i the prime factorizatio of each divisor d 1. The last statemet meas that d 1 takes o each of the values 1, p 1,..., p m, p 1 p 2, p 1 p 3,..., p m 1 p m, p 1 p 2 p 3,..., p 1 p 2... p m. The RHS will thus become d 1 1 φ(d 1 ) = 1 φ(1) + 1 φ(p 1 ) φ(p 1 p 2 ) φ(p 1 p 2... p m ) d 1 1 φ(d 1 ) = 1+ 1 p (p 1 1) (p 2 1) (p 1 1)... (p m 1) The commo deomiator of this sum will be (p 1 1) (p 2 1)...(p m 1), so after we get the sum over a commo deomiator the right had side becomes: RHS = (p 1 1)... (p m 1) + (p 2 1)... (p m 1) (p m 1) (p 1 1) (p 2 1)... (p m 1) 9
10 We ca ow rearrage the terms i the umerator, startig with the last oe ad for the umerator of the right had side, RHS N, we get the followig: RHS N = 1+(p 1 1)+...+(p m 1)+(p 1 1) (p 2 1)+...+(p 1 1) (p 2 1)... (p m 1) Whe we look carefully at each of the terms i this equatio we ca see that each term is actually the φ fuctio of some prime or of some product of primes. We ca therefore rewrite the umerator as: RHS N = φ(1) + φ(p 1 ) φ(p m ) + φ(p 1 p 2 ) φ(p 1 p 2... p m ), Thus for the RHS N we fid that: RHS N = By Lemma 1 we kow that: l p 1 p 2... p m φ(l) φ(d) =, d thus whe = p 1 p 2...p m we have the RHS N = p 1 p 2...p m. The right had side of the idetity we wat to prove becomes RHS = sice this equals the LHS, our idetity is prove: p 1... p m (p 1 1)... (p m 1) ad φ() = d µ 2 (d) φ(d). 10
11 3.2 Propositio 2 For all with at most 8 distict prime factors we have that φ() > 6. Proof: We will first prove the propositio for a with 8 distict prime factors. Let = p a 1 1 p a p a 8 8 so usig Lemma 2 for the Euler totiet we see that: φ() = p a 1 1 p a p a 8 8 (1 1 p 1 )(1 1 p 2 )...(1 1 p 8 ) Sice p 1, p 2, p 3, p 4, p 5, p 6, p 7, p 8 are distict prime factors we kow that p 1 2, p 2 3, p 3 5, p 4 7, p 5 11, p 6 13, p 7 17, p 8 19, because these are the first 8 distict primes. Therefore 1 p 1 1 2,..., 1 p , 1 p ad the (1 1 p 1 ) (1 1),...(1 1 2 p 8 ) (1 1 ). We ca ow substitute i 19 the equatio for φ() ad sice we will substitute each term i paretheses with a term which is less or equal to the iitial oe we will get: therefore φ() (1 1 2 )...( ), φ() , ad the φ() , so φ() 0, 171. But 6 that φ() > 6 for = pa p a , 167, which meas Each of the factors (1 1 p 1 ), (1 1 p 2 ),..., (1 1 p 8 ) is less that oe sice the smallest possible prime is two, so each of the terms i paretheses will be less tha oe, which meas that whe we multiply the product by it, we will decrease its value. So if our iteger has less tha 8 distict prime factors 11
12 the value for its Euler totiet will be greater tha the value of the Euler totiet of a iteger with 8 distict prime factors. Thus, we have proved that for all itegers with 8 or less distict prime factors φ() > Propositio 3 Let f(x) be defied for all ratioal x i 0 x 1 ad let F () = f( k ) The F () = (k,)=1 f( k ) A)F = µ F, the Dirichlet product of µ ad F. Proof: Let us look at the Dirichlet product of the two fuctios. µ F = d µ(d)f ( d ) = d µ(d) d f( kd ). Agai, sice we have the Möbius fuctio all divisors d, which are ot square free will give us zero for the sum. We will deote the square free divisors by d 1 ad let = p a 1 1 p a p a m m. The the divisors d 1 will be all the primes p 1,..., p m ad all the possible products of these primes. The Möbius fuctio will take the values 1 ad 1, whe we have odd ad eve umber of primes i our divisors, respectively. The our Dirichlet product will become: 12
13 µ F = d 1 µ(d 1 ) d 1 f( kd 1 ) = A A = F () F ( )... F ( )+F ( )+...+F ( )...+( 1) m F (1), p 1 p m p 1 p 2 p m 1 p m ad whe we substitute with the formula we have for F () we get: A = f( k ) p 1 f( kp 1 )... pm f( kp m ) + p 1 p 2 f( kp 1p 2 ) p m 1 pm We kow that F () = f( kp m 1p m )... + ( 1) m (k,)=1 p 1...pm f( k ) = f( k ) (k,) 1 f( kp 1...p m ). f( k ) Let us look at the secod term i the last differece. We have that (k, ) 1 which meas that k will have at least oe of the prime factors of. Thus, k {p i b i i [1, m], b i Z } ad sice we kow that k, the p i b i ad therefore for each value of i, b i p i. We ca the rewrite the secod term i our differece as the sum of the sums with each of the b i s as a variable. But sice we are lettig b i be aythig less tha p i each of the sums will cout the factors with more tha oe distict prime factor of i the umerator of f( k ) twice. This observatio will be true for all the subsequet sums, too  the sums which start with two distict prime factors of i the variable b i will cout all the other sums with three prime distict factors of 13
14 twice ad so o. This way whe we are writig out the sum ad start with the first group of sums  the oes for which b i has at least oe of the distict prime factors of  we will have to subtract the secod group of sums  with 2 or more of the distict prime factors of, which o its ow will subtract all the sums with 3 or more of the distict prime factors of, thus we will have to add those sums ad the we would have added twice the ext sums ad so o. Therefore for the secod term we will get a alteratig series of sums, so that we ca accout for all the itegers less tha, which have commo factors with ad get rid of all the terms which repeat. Thus, (k,) 1 f( k ) = p 1 p m 1 pm f( kp 1 ) pm f( kp m 1p m ) ( 1) m f( kp m ) p 1...pm p 1 p 2 f( kp 1p 2 )... f( kp 1...p m ) We ca ow substitute i the formula we derived for F () ad it will become: F () = (k,)=1 f( k ) = p m 1 pm f( k ) [ p 1 f( kp 1 )+...+ f( kp m 1p m ) ( 1) m pm p 1...pm f( kp m ) f( kp 1...p m )] p 1 p 2 f( kp 1p 2 )... Opeig the parethesis ad applyig the egative sig i frot of them we will get: 14
15 F () = + f( k ) p 1 p m 1 pm f( kp 1 )... pm f( kp m 1p m )... + ( 1) m f( kp m ) + p 1...pm which is exactly our result for d 1 µ(d 1) d 1 proved the propositio. f(kd 1 B)µ() is the sum of the primitive th roots of uity: µ() = (k,)=1 e 2πik/ p 1 p 2 f( kp 1...p m ), f( kp 1p 2 ) +... ) = µ F. We have Proof: Let f(x) = e 2πix  this is a valid fuctio for f(x) because the expoetial fuctio is defied for all ratioal x satisfyig the coditio o x. The for = p a 1 1 p a p am m : F () = e 2πi k F () = (k,)=1 e 2πi k Let us look at the right had side of the idetity we wat to prove. We will deote the square free divisors of d 1 ad the divisors with squares i them d 2, where d 1 ad d 2. We ca use part A of Propositio 3 ad substitute i the formula for the Dirichlet product. Thus, sice F () = (µ F )(): 15
16 F () = d µ(d)f ( d ) = µ()f (1) + d 2 µ(d 2 )F ( d 2 ) + d 1 µ(d 1 )F ( d 1 ) Whe the argumet of the Möbius fuctio has a square its value is 0. Therefore, the sum over the square divisors is zero. Let us look at the other terms i F.For = 1 F (1) = e 2πik = e 2πi = cos(2π) + isi(2π) = = 1, thus F () = µ() + d 1 µ(d 1 )F ( d 1 ). We will ow solve the secod term i our equatio. F ( d 1 ) = d 1 e 2πi d 1 k = e 2πi d 1 + e 2πi 2d e 2πi d 1 ( 2) d1 + e 2πi d 1 ( 1) d1 + e 2πi We wat to prove that µ() = F (), where f(x) = e 2πix, which meas that we eed to prove that F ( d 1 ) = 0. I order to do this we will multiply F ( d 1 ) by a fuctio which is ot of value 1 but will still retur the same fuctio. I our case e 2πi d 1 1, sice d 1 by the defiitio of d 1. Thus, e 2πi d 1 F ( ) = e 2πi d 1 d 1 ad summig over we get d 1 d 1 e 2πi d 1 k = e 2πi (k+1)d 1 = A, A = e 2πi 2d 1 + e 2πi 3d e 2πi d 1 ( 2+1) d1 + e 2πi d 1 ( 1+1) d1 + e 2πi d 1 ( +1) d1 16
17 If we look carefully at the terms of both products we will see that if we rearrage the terms ad let the last term of the secod product become the first the two products will be completely the same. The, e 2πi d 1 F ( d 1 ) = F ( d 1 ), which meas that e 2πi d 1 F ( d 1 ) F ( d 1 ) = 0 ad we kow that e 2πi d 1 1 by the defiitio of d 1 ad sice the oly solutios to F ( d 1 )(e 2πi d 1 1) = 0 are e 2πi d 1 = 1 or F ( d 1 ) = 0, therefore F ( d 1 ) = 0. So the the right had side of the idetity we wat to prove becomes F () = µ() + d 2 0.F ( d 2 ) + d 1 µ(d 1).0 = µ() ad by the idetity we have from part A of Propositio 3 we have thus prove 3.4 Propositio 4 For 1 we have µ() = (k,)=1 e 2πik/. σ 1 () = d φ(d)σ 0 ( d ). Proof: Let = p a 1 1 p a p am m. By the defiitio of the divisor fuctio σ α ad the Euler totiet we kow that they are both multiplicative which meas that, for example, σ 1 () = σ 1 (p a 1 1 p a p a m m ) = σ 1 (p a 1 1 ) σ 1 (p a 2 2 )... σ 1 (p a m m ). From the properties of the divisor fuctio it follows that σ α (p a ) = pα(a+1) 1 p α 1 whe α 0 ad σ α (p a ) = a+1 whe α = 0. Therefore i our case whe α = 1 we solve the equatio: σ 1 () = σ 1 (p a 1 1 p a p am m ) = σ 1 (p a 1 1 ) σ 1 (p a 2 2 )... σ 1 (p am m ) = 17
18 p a p pam+1... m 1 p 2 1 p m 1 pa2+1 We will call this side the left had side, LHS. Let us look at the right had side, RHS, of the equatio. We see that our variable i this case is d, which represets the divisors of. These divisors will have the form d = p i 1 1 p i p i m m where 0 i 1, i 2,..., i r a 1, a 2,..., a r, respectively. This form of each of the divisors will allow us to represet them all sice this way we will be able to cout for the divisors with differet primes ad the differet powers these primes could have. The whe we substitute for d the RHS will become RHS = d φ(d)σ 0 ( a 1 d ) = a 2 i 1 =0 i 2 =0... a m i m =0 φ(p i 1 1 p i p i m m )σ o ( p i 1 1 p i ) p i m for which be the defiitio of ad sice the Euler totiet is a multiplicative fuctio we get the followig result: a 1 RHS =... i 1 =0 a m i m =0 φ(p i 1 1 )... φ(p i 2 2 )σ 0 ( pa 1 1 p a p a m m p i 1 1 p i ) p i m ad whe we divide i the argumet of the divisor fuctio we geerate a 1 RHS =... i 1 =0 a m i m =0 φ(p i 1 1 )... φ(p i 2 2 )σ 0 (p a 1 i 1 1 p a 2 i p a m i m m ) ad agai because the divisor fuctio is also multiplicative we ca write the equatio ad rearrage its terms so that a 1 RHS =... i 1 =0 a m i m=0 φ(p i 1 1 )σ 0 (p a 1 i 1 1 ) φ(p i 2 1 )σ 0 (p a 2 i 2 2 )... φ(p im m )σ 0 (p am im m ) 18
19 We have msums ad for each oe of them oly two terms of the equatios are variable  the oes whose variables are the respective i j, where j = 1,..., r. We ca the rearrage the terms so that each couple of terms will be summed over i the appropriate sum. We are allowed to do that sice for each sum oly terms chage ad the rest m 1 couples of terms are costats, which we ca get i frot of the sum. Applyig this rule m times we rearrage the RHS: a 1 RHS = i 1 =0 a 2 1 ) φ(p i 1 1 )σ 0 (p a 1 i 1 i 2 =0 φ(p i 2 2 )σ 0 (p a 2 i 2 2 )... a m i m =0 φ(p i m m )σ 0 (p a m i m m ) The fuctios for each sum are the same, the oly differece beig that they deped o a differet prime umber. The variables for these fuctios assume the same values, so it will be eough to solve for oe of these sums ad the this result will apply to all the other sums takig ito accout their respective primes. Let us take the first sum ad solve for it: We will deote the first sum with A, therefore ad the a 1 i 1 =0 φ(p i 1 1 )σ 0 (p a 1 i 1 1 ) = A A = φ(1)σ 0 (p a 1 1 )+φ(p 1 )σ 0 (p a )+...+φ(p a )σ 0 (p 2 1)+φ(p a )σ 0 (p 1 )+φ(p a 1 1 )σ 0 (1) whe we apply the formulas we kow for the fuctios i questio we get A = a 1 +1+(p 1 1)(a 1 1+1)+p 1 (p 1 1)(a 1 2+1)+p 2 1(p 1 1)(a 1 3+1)+ 19
20 +p 3 1(p 1 1)(a ) p a (p 1 1)(a 1 (a 1 1) + 1) + p a (p 1 1) we ca the factor out their commo factor so A = a (p 1 1)(a 1 + p 1 (a 1 1) + p 2 1(a 1 2) p a p a ) ad whe we ope the brackets iside A = a 1 +1+(p 1 1)(a 1 +p 1 a 1 p 1 +p 2 1a 1 2p 2 1+p 3 1a 1 3p p a p a ) we ow multiply the two terms i the brackets ad so A = a 1 +1+(a 1 p 1 a 1 +a 1 p 2 1 a 1 p 1 p 2 1 +p 1 +a 1 p 3 1 a 1 p 2 1 2p p 2 1 +a 1 p 4 1 a 1 p 3 1 3p p p a p a p a p a p a 1 1 p a 1 1 ) we ca see that some terms repeat but with opposite sigs, so these terms will give 0. Some other terms ca be combied together so whe we apply all operatios possible we will ed up with A = a ( a 1 + p 1 + p p p p a p a p a p a 1 1 ) so whe we add the first term the sum comes out to be A = 1 + p 1 + p p p p a p a p a p a 1 1 ad we ca see that this is a geometric progressio so whe we use the formula for a geometric progressio the first sum equals a 1 A = φ(p i 1 1 )σ 0 (p a 1 i 1 1 ) = 1 pa = pa p 1 p 1 1 i 1 =0 Sice this result will apply to all m sums we solve the right had side to be: a 1 a 2 a m RHS = φ(p i 1 1 )σ 0 (p a 1 i 1 1 ) φ(p i 2 2 )σ 0 (p a 2 i 2 2 )... φ(p im m )σ 0 (p am im m ) i 1 =0 i 2 =0 20 i m=0
21 so whe we substitute the result we got the product becomes RHS = pa p 1 1 which meas that 2 1 par p 2 1 p r 1 1 pa2+1 r 1 p r 1 par+1 so we proved the equality LHS = RHS σ 1 () = d φ(d)σ 0 ( d ). 21
22 Refereces [1] Tom M. Apostol, Itroductio to Aalytic Number Theory, Spriger Verlag, New York, Ic, USA,
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 informationWinter Camp 2012 Sequences Alexander Remorov. Sequences. Alexander Remorov
Witer Camp 202 Sequeces Alexader Remorov Sequeces Alexader Remorov alexaderrem@gmail.com Warmup Problem : Give a positive iteger, cosider a sequece of real umbers a 0, a,..., a defied as a 0 = 2 ad =
More informationSECTION 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 informationModule 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 informationSoving 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 information8.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 informationTHE 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 informationInfinite 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 informationProperties 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 informationORDERS OF GROWTH KEITH CONRAD
ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus
More informationIn 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 informationLesson 12. Sequences and Series
Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or
More information1 n. n > dt. t < n 1 + n=1
Math 05 otes C. Pomerace The harmoic sum The harmoic sum is the sum of recirocals of the ositive itegers. We kow from calculus that it diverges, this is usually doe by the itegral test. There s a more
More informationFourier 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 information1. 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 informationHW 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 informationARITHMETIC AND GEOMETRIC PROGRESSIONS
Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives
More informationSequences 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 informationSection 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 informationFIBONACCI 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 informationEssential Question How can you use properties of exponents to simplify products and quotients of radicals?
. Properties of Ratioal Expoets ad Radicals Essetial Questio How ca you use properties of expoets to simplify products ad quotiets of radicals? Reviewig Properties of Expoets Work with a parter. Let a
More informationDivide and Conquer, Solving Recurrences, Integer Multiplication Scribe: Juliana Cook (2015), V. Williams Date: April 6, 2016
CS 6, Lecture 3 Divide ad Coquer, Solvig Recurreces, Iteger Multiplicatio Scribe: Juliaa Cook (05, V Williams Date: April 6, 06 Itroductio Today we will cotiue to talk about divide ad coquer, ad go ito
More information8.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 information1 The Binomial Theorem: Another Approach
The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets
More informationA classification of Ramanujan unitary Cayley graphs
A classificatio of Ramauja uitary Cayley graphs Adrew Droll Submitted: Sep 24, 2009; Accepted: May 18, 2010; Published: May 25, 2010 Mathematics Subject Classificatio: 05C75 Abstract The uitary Cayley
More informationTAYLOR 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 informationNPTEL STRUCTURAL RELIABILITY
NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics
More informationwhen 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 information9.1 Simplify Radical Expressions
9.1 Simplifyig Radical Expressios (Page 1 of 20) 9.1 Simplify Radical Expressios Radical Notatio for the th Root of a If is a iteger greater tha oe, the the th root of a is the umer whose th power is
More informationMeasurable 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 informationThe 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 informationx(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 informationLinear Algebra II. Notes 6 25th November 2010
MTH6140 Liear Algebra II Notes 6 25th November 2010 6 Quadratic forms A lot of applicatios of mathematics ivolve dealig with quadratic forms: you meet them i statistics (aalysis of variace) ad mechaics
More informationIncremental 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 informationFactors 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 informationYour grandmother and her financial counselor
Sectio 10. Arithmetic Sequeces 963 Objectives Sectio 10. Fid the commo differece for a arithmetic sequece. Write s of a arithmetic sequece. Use the formula for the geeral of a arithmetic sequece. Use the
More informationCS103A 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 information13 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 informationRadicals and Fractional Exponents
Radicals ad Roots Radicals ad Fractioal Expoets I math, may problems will ivolve what is called the radical symbol, X is proouced the th root of X, where is or greater, ad X is a positive umber. What it
More informationTrigonometric 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 informationif 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 informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationDivergence of p 1/p. Adrian Dudek. adrian.dudek[at]anu.edu.au
Divergece of / Adria Dudek adria.dudek[at]au.edu.au Whe I was i high school, my maths teacher cheekily told me that it s ossible to add u ifiitely may umbers ad get a fiite umber. She the illustrated this
More informationEngineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationChapter 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
Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett
(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 informationMath 115 HW #4 Solutions
Math 5 HW #4 Solutios From 2.5 8. Does the series coverge or diverge? ( ) 3 + 2 = Aswer: This is a alteratig series, so we eed to check that the terms satisfy the hypotheses of the Alteratig Series Test.
More information.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 informationSection 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 informationUnit 8 Rational Functions
Uit 8 Ratioal Fuctios Algebraic Fractios: Simplifyig Algebraic Fractios: To simplify a algebraic fractio meas to reduce it to lowest terms. This is doe by dividig out the commo factors i the umerator ad
More informationCS103X: 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 sixfigure salaries i whole dollar amouts are there that cotai at least
More informationA CHARACTERIZATION OF MINIMAL ZEROSEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(1) (2005), #A27 A CHARACTERIZATION OF MINIMAL ZEROSEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS Scott T. Chapma 1 Triity Uiversity, Departmet
More informationBinet Formulas for Recursive Integer Sequences
Biet Formulas for Recursive Iteger Sequeces Homer W. Austi Jatha W. Austi Abstract May iteger sequeces are recursive sequeces ad ca be defied either recursively or explicitly by use of Biettype formulas.
More informationMath : Sequences and Series
EPProgram  Strisuksa School  Roiet Math : Sequeces ad Series Dr.Wattaa Toutip  Departmet of Mathematics Kho Kae Uiversity 00 :Wattaa Toutip wattou@kku.ac.th http://home.kku.ac.th/wattou. Sequeces
More informationRepeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.
5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers
More informationOnestep equations. Vocabulary
Review solvig oestep equatios with itegers, fractios, ad decimals. Oestep equatios Vocabulary equatio solve solutio iverse operatio isolate the variable Additio Property of Equality Subtractio Property
More informationChapter Gaussian Elimination
Chapter 04.06 Gaussia Elimiatio After readig this chapter, you should be able to:. solve a set of simultaeous liear equatios usig Naïve Gauss elimiatio,. lear the pitfalls of the Naïve Gauss elimiatio
More informationElementary Theory of Russian Roulette
Elemetary Theory of Russia Roulette iterestig patters of fractios Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some
More informationSection 9.2 Series and Convergence
Sectio 9. Series ad Covergece Goals of Chapter 9 Approximate Pi Prove ifiite series are aother importat applicatio of limits, derivatives, approximatio, slope, ad cocavity of fuctios. Fid challegig atiderivatives
More informationA Study for the (μ,s) n Relation for Tent Map
Applied Mathematical Scieces, Vol. 8, 04, o. 60, 3009305 HIKARI Ltd, www.mhikari.com http://dx.doi.org/0.988/ams.04.4437 A Study for the (μ,s) Relatio for Tet Map Saba Noori Majeed Departmet of Mathematics
More informationTommy R. Jensen, Department of Mathematics, KNU. 1 Number Sequences 1. 2 Special Number Sequences 2. 3 Generating Functions 4
Part 13 Geeratig Fuctios Prited versio of the lecture Discrete Mathematics o 1 October 009 Tommy R Jese, Departmet of Mathematics, KNU 131 Cotets 1 Number Sequeces 1 Special Number Sequeces 3 Geeratig
More information4 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 pseries (the Compariso Test), but of
More informationA Simplified Binet Formula for kgeneralized Fibonacci Numbers
A Simplified Biet Formula for kgeeralized Fiboacci Numbers Gregory P. B. Dresde Departmet of Mathematics Washigto ad Lee Uiversity Lexigto, VA 440 dresdeg@wlu.edu Abstract I this paper, we preset a particularly
More informationA 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 information8.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 informationHere 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 informationPage 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 informationMath 475, Problem Set #6: Solutions
Math 475, Problem Set #6: Solutios A (a) For each poit (a, b) with a, b oegative itegers satisfyig ab 8, cout the paths from (0,0) to (a, b) where the legal steps from (i, j) are to (i 2, j), (i, j 2),
More informationTo get the next Fibonacci number, you add the previous two. numbers are defined by the recursive formula. F 1 F n+1
Liear Algebra Notes Chapter 6 FIBONACCI NUMBERS The Fiboacci umbers are F, F, F 2, F 3 2, F 4 3, F, F 6 8, To get the ext Fiboacci umber, you add the previous two umbers are defied by the recursive formula
More informationLesson 17 Pearson s Correlation Coefficient
Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) types of data scatter plots measure of directio measure of stregth Computatio covariatio of X ad Y uique variatio i X ad Y measurig
More informationEstimating the Mean and Variance of a Normal Distribution
Estimatig the Mea ad Variace of a Normal Distributio Learig Objectives After completig this module, the studet will be able to eplai the value of repeatig eperimets eplai the role of the law of large umbers
More informationTHE LEAST SQUARES REGRESSION LINE and R 2
THE LEAST SQUARES REGRESSION LINE ad R M358K I. Recall from p. 36 that the least squares regressio lie of y o x is the lie that makes the sum of the squares of the vertical distaces of the data poits from
More informationArithmetic Sequences
. Arithmetic Sequeces Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered list of umbers i which the differece betwee each pair of cosecutive terms,
More informationThe 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 informationDerivation of the Poisson distribution
Gle Cowa RHUL Physics 1 December, 29 Derivatio of the Poisso distributio I this ote we derive the fuctioal form of the Poisso distributio ad ivestigate some of its properties. Cosider a time t i which
More informationThe 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 informationSequences 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 informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, 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 informationSEQUENCES AND SERIES
Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say
More informationChapter 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 information5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?
5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso
More information8 The Poisson Distribution
8 The Poisso Distributio Let X biomial, p ). Recall that this meas that X has pmf ) p,p k) p k k p ) k for k 0,,...,. ) Agai, thik of X as the umber of successes i a series of idepedet experimets, each
More informationContinued Fractions continued. 3. Best rational approximations
Cotiued Fractios cotiued 3. Best ratioal approximatios We hear so much about π beig approximated by 22/7 because o other ratioal umber with deomiator < 7 is closer to π. Evetually 22/7 is defeated by 333/06
More informationAsymptotic 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 informationB1. Fourier Analysis of Discrete Time Signals
B. Fourier Aalysis of Discrete Time Sigals Objectives Itroduce discrete time periodic sigals Defie the Discrete Fourier Series (DFS) expasio of periodic sigals Defie the Discrete Fourier Trasform (DFT)
More informationhp calculators HP 30S Base Conversions Numbers in Different Bases Practice Working with Numbers in Different Bases
Numbers i Differet Bases Practice Workig with Numbers i Differet Bases Numbers i differet bases Our umber system (called HiduArabic) is a decimal system (it s also sometimes referred to as deary system)
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More information1 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 information4.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 informationINFINITE SERIES KEITH CONRAD
INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal
More informationWHEN 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 informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationReview for College Algebra Final Exam
Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 14. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i
More information3. 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 informationThe geometric series and the ratio test
The geometric series ad the ratio test Today we are goig to develop aother test for covergece based o the iterplay betwee the it compariso test we developed last time ad the geometric series. A ote about
More informationLecture 7: Borel Sets and Lebesgue Measure
EE50: Probability Foudatios for Electrical Egieers JulyNovember 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,
More information1 Introduction to reducing variance in Monte Carlo simulations
Copyright c 007 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a uow mea µ = E(X) of a distributio by
More information7 b) 0. Guided Notes for lesson P.2 Properties of Exponents. If a, b, x, y and a, b, 0, and m, n Z then the following properties hold: 1 n b
Guided Notes for lesso P. Properties of Expoets If a, b, x, y ad a, b, 0, ad m, Z the the followig properties hold:. Negative Expoet Rule: b ad b b b Aswers must ever cotai egative expoets. Examples: 5
More informationMath Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:
Math 355  Discrete Math 4.14.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let
More informationSection 73 Estimating a Population. Requirements
Sectio 73 Estimatig a Populatio Mea: σ Kow Key Cocept This sectio presets methods for usig sample data to fid a poit estimate ad cofidece iterval estimate of a populatio mea. A key requiremet i this sectio
More information