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

Save this PDF as:

Size: px
Start display at page:

## 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 umber-theoretic 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 m-sums 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

### 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,

### 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

### 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,

### 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

### 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...

### 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

### 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

### 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

### 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

### 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

### 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

### 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.

### Engineering 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

### 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

### 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

### 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

### 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

### 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

### .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,

### 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

### Lesson 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

### Elementary 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

### Repeating 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

### 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

### 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

### 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

### 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

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

### 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

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

### 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.

### 5.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

### CHAPTER 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

### 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

### SEQUENCES 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

### 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

### 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

### 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

### Overview of some probability distributions.

Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

### University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.

### Lesson 15 ANOVA (analysis of variance)

Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

### Solving Logarithms and Exponential Equations

Solvig Logarithms ad Epoetial Equatios Logarithmic Equatios There are two major ideas required whe solvig Logarithmic Equatios. The first is the Defiitio of a Logarithm. You may recall from a earlier topic:

### 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

### 0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

### 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,

### Math C067 Sampling Distributions

Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters

### 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 =

### Irreducible polynomials with consecutive zero coefficients

Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

### Lecture 4: Cheeger s Inequality

Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

### 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,

### 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

### 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

### BENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets

BENEIT-CST ANALYSIS iacial ad Ecoomic Appraisal usig Spreadsheets Ch. 2: Ivestmet Appraisal - Priciples Harry Campbell & Richard Brow School of Ecoomics The Uiversity of Queeslad Review of basic cocepts

### 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

### 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,

### 5.3. Generalized Permutations and Combinations

53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible

### Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

### Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

### 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...........................

### A Note on Sums of Greatest (Least) Prime Factors

It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423-432 HIKARI Ltd, www.m-hikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos

### 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

### How Euler Did It. In a more modern treatment, Hardy and Wright [H+W] state this same theorem as. n n+ is perfect.

Amicable umbers November 005 How Euler Did It by Ed Sadifer Six is a special umber. It is divisible by, ad 3, ad, i what at first looks like a strage coicidece, 6 = + + 3. The umber 8 shares this remarkable

### Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

### Normal Distribution.

Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

### Simple Annuities Present Value.

Simple Auities Preset Value. OBJECTIVES (i) To uderstad the uderlyig priciple of a preset value auity. (ii) To use a CASIO CFX-9850GB PLUS to efficietly compute values associated with preset value auities.

### 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

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

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

### THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

### 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

### Determining the sample size

Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

### 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

### Hypothesis testing. Null and alternative hypotheses

Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

### 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.

### Time Value of Money. First some technical stuff. HP10B II users

Time Value of Moey Basis for the course Power of compoud iterest \$3,600 each year ito a 401(k) pla yields \$2,390,000 i 40 years First some techical stuff You will use your fiacial calculator i every sigle

Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

### 1. C. The formula for the confidence interval for a population mean is: x t, which was

s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

### 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

### Present Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value

Cocept 9: Preset Value Is the value of a dollar received today the same as received a year from today? A dollar today is worth more tha a dollar tomorrow because of iflatio, opportuity cost, ad risk Brigig

### 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

### Modified Line Search Method for Global Optimization

Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

### Descriptive Statistics

Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote

### The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection

The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity

### Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions

Chapter 5 Uit Aual Amout ad Gradiet Fuctios IET 350 Egieerig Ecoomics Learig Objectives Chapter 5 Upo completio of this chapter you should uderstad: Calculatig future values from aual amouts. Calculatig

### Escola Federal de Engenharia de Itajubá

Escola Federal de Egeharia de Itajubá Departameto de Egeharia Mecâica Pós-Graduação em Egeharia Mecâica MPF04 ANÁLISE DE SINAIS E AQUISÇÃO DE DADOS SINAIS E SISTEMAS Trabalho 02 (MATLAB) Prof. Dr. José

### Maximum Likelihood Estimators.

Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

### Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

74 (4 ) Chapter 4 Sequeces ad Series 4. SEQUENCES I this sectio Defiitio Fidig a Formula for the th Term The word sequece is a familiar word. We may speak of a sequece of evets or say that somethig is

### Fast Fourier Transform

18.310 lecture otes November 18, 2013 Fast Fourier Trasform Lecturer: Michel Goemas I these otes we defie the Discrete Fourier Trasform, ad give a method for computig it fast: the Fast Fourier Trasform.

### 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

### 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

### CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

### INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

### The Stable Marriage Problem

The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

### BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients

652 (12-26) Chapter 12 Sequeces ad Series 12.5 BINOMIAL EXPANSIONS I this sectio Some Examples Otaiig the Coefficiets The Biomial Theorem I Chapter 5 you leared how to square a iomial. I this sectio you

### 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.

### 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