Solutions for HW4. x k n+1. k! n(n + 1) (n + k 1) =.

Size: px
Start display at page:

Download "Solutions for HW4. x k n+1. k! n(n + 1) (n + k 1) =."

Transcription

1 Exercse 13 (a Proe Soutos for HW4 (1 + x 1 + x (1 + x 2 + x (1 + x + x 2 + by ducto o M(Sν x S x ν(x Souto: Frst ote that sce the mutsets o {x 1 } are determed by ν(x 1 the set of mutsets o {x 1 } s bjecto wth N So 1 + x 1 + x x 1 x ν(x 1 1 x ν(x N M({x 1 }ν M({x 1 }ν x {x 1 } so our detty hods for 1 Now fx ad assume for S {x 1 x } we hae (1 + x 1 + x (1 + x 2 + x (1 + x + x 2 + The wth S S {x +1 } M(Sν x S (1 + x 1 + x (1 + x 2 + x (1 + x +1 + x IHOP (1 + x +1 + x N M(Sν x S x ν(x M(S ν x S x ν(x So our detty hods for a by ducto (b Show agebracay that ( ( 1 ( + 1 M(Sν x S x +1 x ν(x x ν(x Souto: ( ( 1 1! ( 1 ( ( 1 ( ( + 1! ( + 1 ( + 1 (c (a Wrte the geeratg fucto (both seres ad cosed form for the umber of wea compostos of wth parts [Ht: Ths shoud oo somethg e the geeratg fucto for mutsets] Souto: Sce the umber of wea compostos of wth parts s ( (( the geeratg fucto for wea compostos of wth parts s ( + 1 x (1 x 1 N

2 (b Wrte the geeratg fucto (both seres ad cosed form for the umber of (ot wea compostos of wth parts Souto: Sce the umber of compostos of wth parts s ( 1 1 the geeratg fucto for compostos of wth parts s ( 1 1 ( 1 x x +1 x(1 + x (c Wrte the geeratg fucto for the umber of wea compostos of wth parts a ess tha j Souto: Let κ( j be the umber of wea compostos of wth parts a ess tha j Start wth (1 + x 1 + x x j 1 1 (1 + x 2 + x x j 1 2 (1 + x + x xj 1 x α 1 1 xα N α 1 + +α 1 α j 1 The eauatg at x 1 x x we get N κ( j x N α 1 + +α 1 α j 1 x (1 + x + x x j 1 (1 x j (1 x (d Item ge a geeratg fucto proof that the umber of wea compostos of to parts wth each part ess tha j s ( ( + r 1 ( 1 s r s rs N r+sj Souto: expad Cotug from the preous part use the geerazed boma theorem to κ( j x (1 x j (1 x N ( s N ( s N ( s N ( ( ( x j s s r N ( ( ( 1 s x sj s r N ( ( ( 1 s x sj s r N ( ( x r r ( r ( 1 r x ( + r 1 r x

3 sce ( r ( 1 r ( +r 1 r Now usg the mutpcato rue for seres we hae that the coeffcet of x o the ast e s ( ( + r 1 ( 1 s s r rs N r+sj thus prog the desred resut Exercse 14 (a Derg mutoma coeffcets agebracay Let α (α 1 α be a composto of Use the formua (!!(! to compute ( α 1 α otg that you ca frst choose the α 1 tems from the α 2 from α 1 the α 3 from (α 1 + α 2 ad so o Souto: By frst choosg the α 1 tems from the α 2 from α 1 the α 3 from (α 1 +α 2 ad so o product rue says that ( α 1 α ( ( ( ( α1 (α1 + α 2 (α1 + α 1 α 1 α 2 α 3! ( α 1! ( (α 1 + α 2! α 1!( α 1! α 2!( (α 1 + α 2! α 3!( (α 1 + α 2 + α 3! ( (α α 1! α!( (α α!! α 1! α!!! α 1! α! sce (α α (b Mutoma theorem Foowg our proof of the boma theorem show that ( (x 1 + x x x α 1 1 α 1 α xα 2 2 xα (α 1 α N α 1 + +α [Ht: Reca that the ey computato for the boma theorem was that for S {x (1 x ( } x T + x x S(1 ( x ( so that (1 + x x ( T S x ( T T S x ( T T S The former we had to proe by ducto o Now fx ad et S {x (j 1 1 j } (so that there are dstct arabes assocated to each x ad wa through a smar proof] Souto: Frst cosder the case where 1 so that ( 1 x α 1 1 α 1 α xα 2 2 xα x 1 x 1x 1 x +1 x (α 1 α N α 1 + +α 1 Now assume (x 1 + x x 1 1 (α 1 α N α 1 + +α 1 α ( 1 α 1 α x 1 x α 1 1 xα 2 2 xα

4 for a fxed Note that sce ( α 1 α ges the umber of ways of parttog [] to abeed sets of sze α 1 α respectey by tracg whch set goes to we hae that ( α 1 α ( 1 1 α 1 α 1 α 1 α +1 α (ths s the mutoma coeffcet geerazato of the detty ( ( 1 ( 1 + sce ( ( So ( ( (x 1 + x x IHOP 1 x x α 1 1 α 1 α xα 2 2 xα by ( 1 1 (α 1 α N α 1 + +α 1 (α 1 α N α 1 + +α 1 (α 1 α N α 1 + +α (α 1 α N α 1 + +α (α 1 α N α 1 + +α 1 ( 1 α 1 α ( 1 1 ( 1 ( + 1 α 1 α x (x α 1 1 xα 2 2 xα x α 1 1 xα 1 1 xα +1 x α xα 1 α 1 α 1 α 1 α +1 α α 1 α x α 1 1 xα 2 2 xα x α 1 1 xα 2 2 xα (c Lattce paths Proposto 121 EC1 says the foowg Let (a 1 a d N d ad et e deote the th ut coordate ector Z d The umber of attce paths Z d from the ( org ( to wth steps {e 1 e d } s ge by the mutoma coeffcet a1 + +a d a 1 a d ( Chec ths proposto for d 2 wth the pot (2 3 Souto: The attce paths from ( to (2 3 wth steps S {(1 ( 1} are ( of whch there are 1 (2+3! 2!3! ( ( Chec ths proposto for d 3 wth the pot (1 1 2 Souto: The attce paths from ( to (1 1 2 wth steps S {(1 ( 1 ( 1} are

5 of whch there are 12 (1+1+2! 1!1!2! ( ( Proe ths theorem (spe out the boo s proof wth more detas Souto: Let be a attce path from to (a 1 a d wth eemetary steps where a a d The cosder the sequece determed by the path ( (e 1 e 2 e S M where M s the mutset o S {e 1 e d } wth weght ν(e a sequece (e 1 e 2 e S M determes the path e 1 e 1 + e 2 e e Smary each from to e 1 + +e (a 1 a d So the attce paths from to (a 1 a d wth eemetary steps are bjecto wth permutatos S M of whch there are ( a 1 + +a d a 1 a d (d Iteger parttos A (teger partto λ (λ 1 λ of s a composto of satsfyg λ 1 λ 2 λ > We draw parttos as boxes ped up ad to the eft to a corer wth λ 1 boxes the frst row λ 2 boxes the secod row ad so o For exampe λ ( s a partto of 11 λ (5 4 3 s a partto of 12 λ (5 s a partto of 5 ad λ s a partto of The sx parttos to ft a 2 2 square are (1 (2 (1 1 (2 1 ad (2 2 Use attce paths to cout the umber of teger parttos fttg to a m rectage Souto: Note that by tag a partto sde a m rectage ad oerayg a m grd wth the org ( at the south-west corer we hae that tracg the south-east wa of the partto tracg the wa of the grd whe approprate determes a attce path from ( to ( m wth eemetary steps Vce ersa ay attce path from ( to ( m wth eemetary steps determes the partto whose th part eds at the m + 1st up-step For exampe ad Thus parttos sde a m rectage are bjecto wth attce paths from ( to ( m wth eemetary steps of whch there are ( +m m

6 Exercse 15 (a For each of the foowg ge exampes for sma aues of The express the foowg umbers terms of the Fboacc umbers ( Exampe: The umber of subsets S of the set [] {1 2 } such that S cotas o two cosecute tegers Aswer: Let a be the umber of good subsets of [] Note that a 1 { {1}} 2 ad a 2 { {1} {2}} 3 Now dde S to 2 cases: ether t cotas or t does t Sce eery good subset wthout s aso a good subset of [ 1] ad ce ersa the umber of good subsets wthout s a 1 Smary S S {} s a bjecto betwee good subsets of [] cotag ad good subsets of [ 2] the umber of good subsets of [] cotag s a 2 So a a 1 + a 2 wth a 1 2 f 3 a 2 3 f 4 Ths s the same recurrece that determes f but shfted so that a f +2 So there are f +2 good subsets of [] NOTE: For may of these ths s the strategy you wat Mae a recurrece reato that oos e the Fboacc recurrece ad shft appropratey For at east oe you wat to use a preous part ( The umber of compostos of to parts greater tha 1 Souto: Let S { compostos of to parts greater tha 1 } A { compostos of to parts greater tha 1 whose ast part s 2 } ad B { compostos of to parts greater tha 1 whose ast part s ote 2 } so that a S s the aue we wsh to eumerate ad S A B so that a A + B Note that a a 1 ad a 2 {(2} 1 The fucto from A whch taes (α 1 α 2 to (α 1 α s a fucto from A to S 2 sce α α + 2 ad α > 1 Its erse appedg a good composto of 2 by 2 s we-defed so A s bjecto wth S 2 Smary the fucto from B whch taes (α 1 α to (α 1 α 1 s a fucto from B to S 1 sce (α α 1 1 ad α > 1 for 1 1 ad α > 2 so α 1 > 1 Its erse addg 1 to the ast part s we-defed so B s bjecto wth S 1 Thus a S A + B S 2 + S 1 a 2 + a 1 Sce a 1 f ad a 2 1 f 1 we hae a f +1 ( The umber of compostos of to parts equa to 1 or 2 Souto: Let S { compostos of to to parts equa to 1 or 2 } A { compostos S whose ast part s 1 } ad B { compostos S whose ast part s 2 }

7 so that a S s the aue we wsh to eumerate ad S A B so that a A + B Note that a ad a 1 {(1} 1 The fucto from A whch taes (α 1 α 1 to (α 1 α s a fucto from A to S 1 sce (α α + 1 ad α 1 or 2 Its erse appedg a good composto of 1 by 1 s we-defed so A s bjecto wth S 1 Smary the fucto from B whch taes (α 1 α 2 to (α 1 α s a fucto from B to S 2 sce (α α + 2 ad α 1 or 2 Its erse appedg a good composto of 2 by 2 s we-defed so B s bjecto wth S 2 Thus a S A + B S 1 + S 2 a 1 + a 2 Sce a f ad a 1 1 f 1 we hae a f ( The umber of compostos of to odd parts Souto: Let S { compostos of to to odd parts } A { compostos S whose ast part s 1 } ad B { compostos S whose ast part s ot 1 } so that a S s the aue we wsh to eumerate ad S A B so that a A + B Note that a ad a 1 {(1} 1 The fucto from A whch taes (α 1 α 1 to (α 1 α s a fucto from A to S 1 sce (α α + 1 ad α s odd for a Its erse appedg a good composto of 1 by 1 s we-defed so A s bjecto wth S 1 Smary the fucto from B whch taes (α 1 α to (α 1 α 2 s a fucto from B to S 2 sce (α α + 2 ad α s odd ad α 3 ad odd so that α 2 1 ad odd Its erse addg 2 to the ast part s we-defed so B s bjecto wth S 2 Thus a S A + B S 1 + S 2 a 1 + a 2 Sce a f ad a 1 1 f 1 we hae a f ( The umber of sequeces (ε 1 ε 2 ε of s ad 1s such that ε 1 ε 2 ε 3 ε 4 Souto: Let S { good sequeces } A { sequeces S whose aue s } ad B { compostos S whose aue s 1 } so that a S s the aue we wsh to eumerate ad S A B so that a A + B Note that a 1 {( (1} 2 ad a 2 {( ( 1 (1 1} 3 We cosder two cases:

8 ( odd so that the ast equaty s If ε A the ε 1 ε whch puts o restrcto o ε 1 or ay preous ε So good sequeces ε 1 ε 2 ε 3 ε 1 are bjecto wth good sequeces ε 1 ε 2 ε 3 ε 1 e A s bjecto wth S 1 If ε B the ε 1 ε 1 so ε 1 1 Howeer ε 2 ε 1 1 puts o restrcto o ε 2 or ay preous ε So good sequeces ε 1 ε 2 ε 3 ε are bjecto wth good sequeces ε 1 ε 2 ε 3 ε 2 e B s bjecto wth S 2 ( ee so that the ast equaty s Ths foows exacty as the preous case except ow A s bjecto wth S 2 ad B s bjecto wth S 1 Ether way a S A + B S 1 + S 2 a 1 + a 2 Sce a 1 2 f 3 ad a 2 3 f 4 we hae a f +2 ( The umber of sequeces (T 1 T 2 T of subsets T of [] such that T 1 T 2 T 3 T 4 Souto: For each [] assg a sequece ε ( (ε ( 1 ε( { by ε ( f / T j j 1 f T j Note that ad T j T j+1 f ad oy f ε ( j T j T j+1 f ad oy f ε ( j ε ( j+1 for a [] ε ( j+1 for a [] So by spag oer [] we get a sequece ε (ε (1 ε ( of sequeces ε ( (ε ( 1 ε of 1 s ad s satsfyg ε ( 1 ε ( 2 ε ( 3 ε ( 4 Smary ay such a sequece of good sequeces ges a sequece of subset T of [] such that T 1 T 2 T 3 T 4 Sce the sequeces correspodg to each are depedet of each other ad the umber of good sequeces ε ( s f +2 by the preous part we hae the umber of good sequeces of subsets s ge by {ε (1 } {ε ( } f +2 f +2 f +2

9 ( The sum α 1 α 2 α oer a 2 1 compostos α (α 1 α 2 α of [Ht: ths sum couts the umber of ways of sertg at most oe ertca bar each of the 1 spaces betwee stars a e of stars ad the crcg oe star each compartmet Now try repacg bars u-crced stars ad crced stars by 1 s 2 s ad 1 s respectey Use a preous part] Souto: Let S be the set of strog stars ad bars arragemets wth stars ad 1 bars together wth a choce of dstgushed star for each of the regos For exampe f 1 ad 3 eemets of S cude ad Sce strog star ad bar arragemets wth stars ad 1 bars are bjecto wth compostos of wth parts ad for each such arragemet correspodg to the composto (a 1 a there are a 1 a ways to choose the dstgushed stars (product rue we hae S α 1 α comps α of Now for each arragemet S assg the sequece of 1 s ad 2 s by repacg bars ucrced stars ad crced stars by 1 s 2 s ad 1 s respectey For exampe the sequeces correspodg to the arragemets aboe are ad respectey For a fxed there are 1 bars crced stars ad ucrced stars so the aues sum to ( ( whch s depedet of So we hae mapped S to compostos of 2 1 whose parts are a 1 s ad 2 s Now ets cosder the erse operato Sce 2 1 s odd ay composto of 2 1 whose parts are a 1 s ad 2 s w hae a odd umber of 1 s So for ay such composto repace a the 2 s by stars ad the repace each of the 1 s from eft to rght ateratg wth crced stars ad bars (the frst 1 becomes a crced star the secod 1 becomes a bar ad so o If there are r 2 s the there are s 2 1 2r 1 s; ad (s + 1/2 of those 1 s w become crced stars So the subsequet arragemet w cosst of r + (s + 1/2 r + (2 1 2r + 1/2 r + r ad (s 1/2 (2 1 2r 1/2 r 1 bars stars (crced ad ucrced [Note that sce oer a such sequeces r ca rage from to 1 the umber of bars ca rage from to 1 as desred] So ths erse from a compostos of 2 1 whose parts are 1 s ad 2 s s a we-defed map to S Therefore we hae a bjecto Thus by part (a( α 1 α S f 2 1 comps α of (b Cosder the detty f +1 (

10 ( Chec ths detty for 2 ad 3 Souto: 1 ( ( ( 1 1 f ( ( ( ( f ( Proe ths detty recursey by showg that t satsfes the Fboacc recurrece ad that t hods for the frst 2 aues Souto: Reca the detty that ( ( ( a a 1 a 1 + b b b 1 ad et F ( + 1 ( The 1 ( 2 1 ( 2 F ( + F ( ( 1 1 ( 1 + (settg ( 1 1 (( ( ( 1 ( + 1 ( sce ( But the ast e s just F ( + 1 So F ( satsfes the Fboacc recurrece ad F (2 f 2 ad F (3 f 3 Thus F ( f ( Proe ths detty combatoray Namey frst show combatoray that the umber of -subsets of [ 1] cotag o two cosecute tegers s ( ad the use (a( Souto: Let S be -subsets of [ 1] cotag o two cosecute tegers For A {a 1 < a 2 < < a } S cosder the map ϕ : {a 1 a 2 a } {a 1 a 2 1 a 3 2 a + 1} {b 1 b 2 b 3 b } e b a + 1 Sce A cotas o two cosecute tegers b +1 b a +1 ( (a + 1 a +1 a 1 > so ths map s a we-defed map of sets Moreoer b 1 a 1 1 ad b a ad b 1 < b < b so ϕ(a ( [ ] The erse sedg a set B {b 1 < b 2 < < b } ( [ ] to ϕ 1 : {b 1 b 2 b } {b 1 b b b + 1}

11 s we-defed wth mage S sce we hae dated the etres of B (gg o two cosecute eemets ad b So S s bjecto wth ( [ ] Thus by (a( ( 1 ( 1 S f 1+2 f +1 (c Note that EC1 Exampe 1112 to computes the geeratg fucto for the sequece (a N where a f +1 (so a 1 a 1 1 a 2 2 a 3 3 ad so o Repeat ths computato for (f Z> mag the approprate chages to accommodate the shft Souto: Just do t

1 Onto functions and bijections Applications to Counting

1 Onto functions and bijections Applications to Counting 1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of

More information

MA 524 Homework 6 Solutions

MA 524 Homework 6 Solutions MA 524 Homework 6 Solutos. Sce S(, s the umber of ways to partto [] to k oempty blocks, ad c(, s the umber of ways to partto to k oempty blocks ad also the arrage each block to a cycle, we must have S(,

More information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution: Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed

More information

Mu Sequences/Series Solutions National Convention 2014

Mu Sequences/Series Solutions National Convention 2014 Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed

More information

Exercises for Square-Congruence Modulo n ver 11

Exercises for Square-Congruence Modulo n ver 11 Exercses for Square-Cogruece Modulo ver Let ad ab,.. Mark True or False. a. 3S 30 b. 3S 90 c. 3S 3 d. 3S 4 e. 4S f. 5S g. 0S 55 h. 8S 57. 9S 58 j. S 76 k. 6S 304 l. 47S 5347. Fd the equvalece classes duced

More information

Debabrata Dey and Atanu Lahiri

Debabrata Dey and Atanu Lahiri RESEARCH ARTICLE QUALITY COMPETITION AND MARKET SEGMENTATION IN THE SECURITY SOFTWARE MARKET Debabrata Dey ad Atau Lahr Mchael G. Foster School of Busess, Uersty of Washgto, Seattle, Seattle, WA 9895 U.S.A.

More information

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever. 9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,

More information

Lecture 1. (Part II) The number of ways of partitioning n distinct objects into k distinct groups containing n 1,

Lecture 1. (Part II) The number of ways of partitioning n distinct objects into k distinct groups containing n 1, Lecture (Part II) Materals Covered Ths Lecture: Chapter 2 (2.6 --- 2.0) The umber of ways of parttog dstct obects to dstct groups cotag, 2,, obects, respectvely, where each obect appears exactly oe group

More information

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class) Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form

More information

Lecture 9: Tolerant Testing

Lecture 9: Tolerant Testing Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have

More information

PART ONE. Solutions to Exercises

PART ONE. Solutions to Exercises PART ONE Soutos to Exercses Chapter Revew of Probabty Soutos to Exercses 1. (a) Probabty dstrbuto fucto for Outcome (umber of heads) 0 1 probabty 0.5 0.50 0.5 Cumuatve probabty dstrbuto fucto for Outcome

More information

TR/87 April 1979 INTERPOLATION TO BOUNDARY ON SIMPLICES J.A. GREGORY

TR/87 April 1979 INTERPOLATION TO BOUNDARY ON SIMPLICES J.A. GREGORY TR/87 Apr 979 ITERPOLATIO TO BOUDARY O SIMPLICES by JA GREGORY w60369 Itroducto The fte dmesoa probem of costructg Lagrage ad Hermte terpoats whch atch fucto ad derate aues at a fte umber of pots o a smpex

More information

(b) By independence, the probability that the string 1011 is received correctly is

(b) By independence, the probability that the string 1011 is received correctly is Soluto to Problem 1.31. (a) Let A be the evet that a 0 s trasmtted. Usg the total probablty theorem, the desred probablty s P(A)(1 ɛ ( 0)+ 1 P(A) ) (1 ɛ 1)=p(1 ɛ 0)+(1 p)(1 ɛ 1). (b) By depedece, the probablty

More information

Econometric Methods. Review of Estimation

Econometric Methods. Review of Estimation Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators

More information

Some results and conjectures about recurrence relations for certain sequences of binomial sums.

Some results and conjectures about recurrence relations for certain sequences of binomial sums. Soe results ad coectures about recurrece relatos for certa sequeces of boal sus Joha Cgler Faultät für Matheat Uverstät We A-9 We Nordbergstraße 5 Joha Cgler@uveacat Abstract I a prevous paper [] I have

More information

Non-uniform Turán-type problems

Non-uniform Turán-type problems Joural of Combatoral Theory, Seres A 111 2005 106 110 wwwelsevercomlocatecta No-uform Turá-type problems DhruvMubay 1, Y Zhao 2 Departmet of Mathematcs, Statstcs, ad Computer Scece, Uversty of Illos at

More information

L5 Polynomial / Spline Curves

L5 Polynomial / Spline Curves L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a

More information

ρ < 1 be five real numbers. The

ρ < 1 be five real numbers. The Lecture o BST 63: Statstcal Theory I Ku Zhag, /0/006 Revew for the prevous lecture Deftos: covarace, correlato Examples: How to calculate covarace ad correlato Theorems: propertes of correlato ad covarace

More information

Algorithms Theory, Solution for Assignment 2

Algorithms Theory, Solution for Assignment 2 Juor-Prof. Dr. Robert Elsässer, Marco Muñz, Phllp Hedegger WS 2009/200 Algorthms Theory, Soluto for Assgmet 2 http://lak.formatk.u-freburg.de/lak_teachg/ws09_0/algo090.php Exercse 2. - Fast Fourer Trasform

More information

Ideal multigrades with trigonometric coefficients

Ideal multigrades with trigonometric coefficients Ideal multgrades wth trgoometrc coeffcets Zarathustra Brady December 13, 010 1 The problem A (, k) multgrade s defed as a par of dstct sets of tegers such that (a 1,..., a ; b 1,..., b ) a j = =1 for all

More information

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set. Addtoal Decrease ad Coquer Algorthms For combatoral problems we mght eed to geerate all permutatos, combatos, or subsets of a set. Geeratg Permutatos If we have a set f elemets: { a 1, a 2, a 3, a } the

More information

INDEX BOUNDS FOR VALUE SETS OF POLYNOMIALS OVER FINITE FIELDS

INDEX BOUNDS FOR VALUE SETS OF POLYNOMIALS OVER FINITE FIELDS INDEX BOUNDS FOR VALUE SETS OF POLYNOMIALS OVER FINITE FIELDS GARY L. MULLEN, DAQING WAN, AND QIANG WANG We dedcate ths paper to the occaso of Harad Nederreter s 70-th brthday. Hs work o permutato poyomas

More information

Log1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each

Log1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each 01 Log1 Cotest Roud Theta Complex Numbers 1 Wrte a b Wrte a b form: 1 5 form: 1 5 4 pots each Wrte a b form: 65 4 4 Evaluate: 65 5 Determe f the followg statemet s always, sometmes, or ever true (you may

More information

n 1 n 2 n 2 n n 1 ln n 2 1 n Express the number as a ratio of integers

n 1 n 2 n 2 n n 1 ln n 2 1 n Express the number as a ratio of integers SECTION 8. SERIES 8. SERIES A Clck here for aswers. S Clck here for solutos. ; Fd at least 0 partal sums of the seres. Graph both the sequece of terms ad the sequece of partal sums o the same scree. Does

More information

MATH 247/Winter Notes on the adjoint and on normal operators.

MATH 247/Winter Notes on the adjoint and on normal operators. MATH 47/Wter 00 Notes o the adjot ad o ormal operators I these otes, V s a fte dmesoal er product space over, wth gve er * product uv, T, S, T, are lear operators o V U, W are subspaces of V Whe we say

More information

Pseudo-random Functions. PRG vs PRF

Pseudo-random Functions. PRG vs PRF Pseudo-radom Fuctos Debdeep Muhopadhyay IIT Kharagpur PRG vs PRF We have see the costructo of PRG (pseudo-radom geerators) beg costructed from ay oe-way fuctos. Now we shall cosder a related cocept: Pseudo-radom

More information

Chapter 9 Jordan Block Matrices

Chapter 9 Jordan Block Matrices Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.

More information

#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES

#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES #A27 INTEGERS 3 (203) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES Emrah Kılıç Mathematcs Departmet, TOBB Uversty of Ecoomcs ad Techology, Akara, Turkey eklc@etu.edu.tr Neşe Ömür Mathematcs Departmet,

More information

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen. .5 x 54.5 a. x 7. 786 7 b. The raked observatos are: 7.4, 7.5, 7.7, 7.8, 7.9, 8.0, 8.. Sce the sample sze 7 s odd, the meda s the (+)/ 4 th raked observato, or meda 7.8 c. The cosumer would more lkely

More information

Optimal Constants in the Rosenthal Inequality for Random Variables with Zero Odd Moments.

Optimal Constants in the Rosenthal Inequality for Random Variables with Zero Odd Moments. Optma Costats the Rosetha Iequaty for Radom Varabes wth Zero Odd Momets. The Harvard commuty has made ths artce opey avaabe. Pease share how ths access beefts you. Your story matters Ctato Ibragmov, Rustam

More information

MATH 371 Homework assignment 1 August 29, 2013

MATH 371 Homework assignment 1 August 29, 2013 MATH 371 Homework assgmet 1 August 29, 2013 1. Prove that f a subset S Z has a smallest elemet the t s uque ( other words, f x s a smallest elemet of S ad y s also a smallest elemet of S the x y). We kow

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Postpoed exam: ECON430 Statstcs Date of exam: Jauary 0, 0 Tme for exam: 09:00 a.m. :00 oo The problem set covers 5 pages Resources allowed: All wrtte ad prted

More information

D KL (P Q) := p i ln p i q i

D KL (P Q) := p i ln p i q i Cheroff-Bouds 1 The Geeral Boud Let P 1,, m ) ad Q q 1,, q m ) be two dstrbutos o m elemets, e,, q 0, for 1,, m, ad m 1 m 1 q 1 The Kullback-Lebler dvergece or relatve etroy of P ad Q s defed as m D KL

More information

2. Independence and Bernoulli Trials

2. Independence and Bernoulli Trials . Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,

More information

MA/CSSE 473 Day 27. Dynamic programming

MA/CSSE 473 Day 27. Dynamic programming MA/CSSE 473 Day 7 Dyamc Programmg Bomal Coeffcets Warshall's algorthm (Optmal BSTs) Studet questos? Dyamc programmg Used for problems wth recursve solutos ad overlappg subproblems Typcally, we save (memoze)

More information

h-analogue of Fibonacci Numbers

h-analogue of Fibonacci Numbers h-aalogue of Fboacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Beaoum Prce Mohammad Uversty, Al-Khobar 395, Saud Araba Abstract I ths paper, we troduce the h-aalogue of Fboacc umbers for o-commutatve

More information

Neville Robbins Mathematics Department, San Francisco State University, San Francisco, CA (Submitted August 2002-Final Revision December 2002)

Neville Robbins Mathematics Department, San Francisco State University, San Francisco, CA (Submitted August 2002-Final Revision December 2002) Nevlle Robbs Mathematcs Departmet, Sa Fracsco State Uversty, Sa Fracsco, CA 943 (Submtted August -Fal Revso December ) INTRODUCTION The Lucas tragle s a fte tragular array of atural umbers that s a varat

More information

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n .. Soluto of Problem. M s obvously cotuous o ], [ ad ], [. Observe that M x,..., x ) M x,..., x ) )..) We ext show that M s odecreasg o ], [. Of course.) mles that M s odecreasg o ], [ as well. To show

More information

Landé interval rule (assignment!) l examples

Landé interval rule (assignment!) l examples 36 - Read CTD, pp. 56-78 AT TIME: O H = ar s ζ(,, ) s adé terva rue (assgmet!) ζ(,, ) ζ exampes ζ (oe ζfor each - term) (oe ζfor etre cofgurato) evauate matrx eemets ater determata bass ad may-e M or M

More information

Rademacher Complexity. Examples

Rademacher Complexity. Examples Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed

More information

Chapter 11 Systematic Sampling

Chapter 11 Systematic Sampling Chapter stematc amplg The sstematc samplg techue s operatoall more coveet tha the smple radom samplg. It also esures at the same tme that each ut has eual probablt of cluso the sample. I ths method of

More information

Rational Equiangular Polygons

Rational Equiangular Polygons Apped Mathematcs 03 4 460-465 http://dxdoorg/0436/am034097 Pubshed Oe October 03 (http://wwwscrporg/oura/am) Ratoa Equaguar Poygos Marus Muteau Laura Muteau Departmet of Mathematcs Computer Scece ad Statstcs

More information

Bounds for block sparse tensors

Bounds for block sparse tensors A Bouds for bock sparse tesors Oe of the ma bouds to cotro s the spectra orm of the sparse perturbato tesor S The success of the power teratos ad the mprovemet accuracy of recovery over teratve steps of

More information

Multiple Regression. More than 2 variables! Grade on Final. Multiple Regression 11/21/2012. Exam 2 Grades. Exam 2 Re-grades

Multiple Regression. More than 2 variables! Grade on Final. Multiple Regression 11/21/2012. Exam 2 Grades. Exam 2 Re-grades STAT 101 Dr. Kar Lock Morga 11/20/12 Exam 2 Grades Multple Regresso SECTIONS 9.2, 10.1, 10.2 Multple explaatory varables (10.1) Parttog varablty R 2, ANOVA (9.2) Codtos resdual plot (10.2) Trasformatos

More information

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018 Chrs Pech Fal Practce CS09 Dec 5, 08 Practce Fal Examato Solutos. Aswer: 4/5 8/7. There are multle ways to obta ths aswer; here are two: The frst commo method s to sum over all ossbltes for the rak of

More information

Evaluating Polynomials

Evaluating Polynomials Uverst of Nebraska - Lcol DgtalCommos@Uverst of Nebraska - Lcol MAT Exam Expostor Papers Math the Mddle Isttute Partershp 7-7 Evaluatg Polomals Thomas J. Harrgto Uverst of Nebraska-Lcol Follow ths ad addtoal

More information

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1) Chapter 7 Fuctos o Bouded Varato. Subject: Real Aalyss Level: M.Sc. Source: Syed Gul Shah (Charma, Departmet o Mathematcs, US Sargodha Collected & Composed by: Atq ur Rehma (atq@mathcty.org, http://www.mathcty.org

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Revew for the prevous lecture: Theorems ad Examples: How to obta the pmf (pdf) of U = g (, Y) ad V = g (, Y) Chapter 4 Multple Radom Varables Chapter 44 Herarchcal Models ad Mxture Dstrbutos Examples:

More information

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method

More information

Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix

Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix Assgmet 7/MATH 47/Wter, 00 Due: Frday, March 9 Powers o a square matrx Gve a square matrx A, ts powers A or large, or eve arbtrary, teger expoets ca be calculated by dagoalzg A -- that s possble (!) Namely,

More information

Lecture 3 Probability review (cont d)

Lecture 3 Probability review (cont d) STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto

More information

MMJ 1113 FINITE ELEMENT METHOD Introduction to PART I

MMJ 1113 FINITE ELEMENT METHOD Introduction to PART I MMJ FINITE EEMENT METHOD Cotut requremets Assume that the fuctos appearg uder the tegral the elemet equatos cota up to (r) th order To esure covergece N must satsf Compatblt requremet the fuctos must have

More information

LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX

LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 2006, #A12 LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX Hacèe Belbachr 1 USTHB, Departmet of Mathematcs, POBox 32 El Ala, 16111,

More information

Summary of the lecture in Biostatistics

Summary of the lecture in Biostatistics Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the

More information

Investigating Cellular Automata

Investigating Cellular Automata Researcher: Taylor Dupuy Advsor: Aaro Wootto Semester: Fall 4 Ivestgatg Cellular Automata A Overvew of Cellular Automata: Cellular Automata are smple computer programs that geerate rows of black ad whte

More information

PTAS for Bin-Packing

PTAS for Bin-Packing CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,

More information

Transforms that are commonly used are separable

Transforms that are commonly used are separable Trasforms s Trasforms that are commoly used are separable Eamples: Two-dmesoal DFT DCT DST adamard We ca the use -D trasforms computg the D separable trasforms: Take -D trasform of the rows > rows ( )

More information

18.413: Error Correcting Codes Lab March 2, Lecture 8

18.413: Error Correcting Codes Lab March 2, Lecture 8 18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse

More information

Pseudo-random Functions

Pseudo-random Functions Pseudo-radom Fuctos Debdeep Mukhopadhyay IIT Kharagpur We have see the costructo of PRG (pseudo-radom geerators) beg costructed from ay oe-way fuctos. Now we shall cosder a related cocept: Pseudo-radom

More information

Introduction to local (nonparametric) density estimation. methods

Introduction to local (nonparametric) density estimation. methods Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest

More information

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat

More information

MOLECULAR VIBRATIONS

MOLECULAR VIBRATIONS MOLECULAR VIBRATIONS Here we wsh to vestgate molecular vbratos ad draw a smlarty betwee the theory of molecular vbratos ad Hückel theory. 1. Smple Harmoc Oscllator Recall that the eergy of a oe-dmesoal

More information

Third handout: On the Gini Index

Third handout: On the Gini Index Thrd hadout: O the dex Corrado, a tala statstca, proposed (, 9, 96) to measure absolute equalt va the mea dfferece whch s defed as ( / ) where refers to the total umber of dvduals socet. Assume that. The

More information

Lattices. Mathematical background

Lattices. Mathematical background Lattces Mathematcal backgroud Lattces : -dmesoal Eucldea space. That s, { T x } x x = (,, ) :,. T T If x= ( x,, x), y = ( y,, y), the xy, = xy (er product of xad y) x = /2 xx, (Eucldea legth or orm of

More information

Entropy ISSN by MDPI

Entropy ISSN by MDPI Etropy 2003, 5, 233-238 Etropy ISSN 1099-4300 2003 by MDPI www.mdp.org/etropy O the Measure Etropy of Addtve Cellular Automata Hasa Aı Arts ad Sceces Faculty, Departmet of Mathematcs, Harra Uversty; 63100,

More information

X ε ) = 0, or equivalently, lim

X ε ) = 0, or equivalently, lim Revew for the prevous lecture Cocepts: order statstcs Theorems: Dstrbutos of order statstcs Examples: How to get the dstrbuto of order statstcs Chapter 5 Propertes of a Radom Sample Secto 55 Covergece

More information

Random Variables and Probability Distributions

Random Variables and Probability Distributions Radom Varables ad Probablty Dstrbutos * If X : S R s a dscrete radom varable wth rage {x, x, x 3,. } the r = P (X = xr ) = * Let X : S R be a dscrete radom varable wth rage {x, x, x 3,.}.If x r P(X = x

More information

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations HP 30S Statstcs Averages ad Stadard Devatos Average ad Stadard Devato Practce Fdg Averages ad Stadard Devatos HP 30S Statstcs Averages ad Stadard Devatos Average ad stadard devato The HP 30S provdes several

More information

Uniform DFT Filter Banks 1/27

Uniform DFT Filter Banks 1/27 .. Ufor FT Flter Baks /27 Ufor FT Flter Baks We ll look at 5 versos of FT-based flter baks all but the last two have serous ltatos ad are t practcal. But they gve a ce trasto to the last two versos whch

More information

Objectives of Multiple Regression

Objectives of Multiple Regression Obectves of Multple Regresso Establsh the lear equato that best predcts values of a depedet varable Y usg more tha oe eplaator varable from a large set of potetal predctors {,,... k }. Fd that subset of

More information

Chapter 14 Logistic Regression Models

Chapter 14 Logistic Regression Models Chapter 4 Logstc Regresso Models I the lear regresso model X β + ε, there are two types of varables explaatory varables X, X,, X k ad study varable y These varables ca be measured o a cotuous scale as

More information

The Mathematical Appendix

The Mathematical Appendix The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.

More information

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ  1 STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ

More information

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET Abstract. The Permaet versus Determat problem s the followg: Gve a matrx X of determates over a feld of characterstc dfferet from

More information

13. Dedekind Domains. 13. Dedekind Domains 117

13. Dedekind Domains. 13. Dedekind Domains 117 3. Dedekd Domas 7 3. Dedekd Domas I the last chapter we have maly studed -dmesoal regular local rgs,. e. geometrcally the local propertes of smooth pots o curves. We ow wat to patch these local results

More information

CHAPTER 4 RADICAL EXPRESSIONS

CHAPTER 4 RADICAL EXPRESSIONS 6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube

More information

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance Chapter, Part A Aalyss of Varace ad Epermetal Desg Itroducto to Aalyss of Varace Aalyss of Varace: Testg for the Equalty of Populato Meas Multple Comparso Procedures Itroducto to Aalyss of Varace Aalyss

More information

Abstract. 1. Introduction

Abstract. 1. Introduction Joura of Mathematca Sceces: Advaces ad Appcatos Voume 4 umber 2 2 Pages 33-34 COVERGECE OF HE PROJECO YPE SHKAWA ERAO PROCESS WH ERRORS FOR A FE FAMY OF OSEF -ASYMPOCAY QUAS-OEXPASVE MAPPGS HUA QU ad S-SHEG

More information

A stopping criterion for Richardson s extrapolation scheme. under finite digit arithmetic.

A stopping criterion for Richardson s extrapolation scheme. under finite digit arithmetic. A stoppg crtero for cardso s extrapoato sceme uder fte dgt artmetc MAKOO MUOFUSHI ad HIEKO NAGASAKA epartmet of Lbera Arts ad Sceces Poytecc Uversty 4-1-1 Hasmotoda,Sagamara,Kaagawa 229-1196 JAPAN Abstract:

More information

EECE 301 Signals & Systems

EECE 301 Signals & Systems EECE 01 Sgals & Systems Prof. Mark Fowler Note Set #9 Computg D-T Covoluto Readg Assgmet: Secto. of Kame ad Heck 1/ Course Flow Dagram The arrows here show coceptual flow betwee deas. Note the parallel

More information

Chapter 2 - Free Vibration of Multi-Degree-of-Freedom Systems - II

Chapter 2 - Free Vibration of Multi-Degree-of-Freedom Systems - II CEE49b Chapter - Free Vbrato of Mult-Degree-of-Freedom Systems - II We ca obta a approxmate soluto to the fudametal atural frequecy through a approxmate formula developed usg eergy prcples by Lord Raylegh

More information

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers.

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers. PROBLEMS A real umber s represeted appromately by 63, ad we are told that the relatve error s % What s? Note: There are two aswers Ht : Recall that % relatve error s What s the relatve error volved roudg

More information

Unit 9. The Tangent Bundle

Unit 9. The Tangent Bundle Ut 9. The Taget Budle ========================================================================================== ---------- The taget sace of a submafold of R, detfcato of taget vectors wth dervatos at

More information

Computations with large numbers

Computations with large numbers Comutatos wth large umbers Wehu Hog, Det. of Math, Clayto State Uversty, 2 Clayto State lvd, Morrow, G 326, Mgshe Wu, Det. of Mathematcs, Statstcs, ad Comuter Scece, Uversty of Wscos-Stout, Meomoe, WI

More information

Class 13,14 June 17, 19, 2015

Class 13,14 June 17, 19, 2015 Class 3,4 Jue 7, 9, 05 Pla for Class3,4:. Samplg dstrbuto of sample mea. The Cetral Lmt Theorem (CLT). Cofdece terval for ukow mea.. Samplg Dstrbuto for Sample mea. Methods used are based o CLT ( Cetral

More information

Eulerian numbers revisited : Slices of hypercube

Eulerian numbers revisited : Slices of hypercube Eulera umbers revsted : Slces of hypercube Kgo Kobayash, Hajme Sato, Mamoru Hosh, ad Hroyosh Morta Abstract I ths talk, we provde a smple proof o a terestg equalty coectg the umber of permutatos of,...,

More information

MULTIDIMENSIONAL HETEROGENEOUS VARIABLE PREDICTION BASED ON EXPERTS STATEMENTS. Gennadiy Lbov, Maxim Gerasimov

MULTIDIMENSIONAL HETEROGENEOUS VARIABLE PREDICTION BASED ON EXPERTS STATEMENTS. Gennadiy Lbov, Maxim Gerasimov Iteratoal Boo Seres "Iformato Scece ad Computg" 97 MULTIIMNSIONAL HTROGNOUS VARIABL PRICTION BAS ON PRTS STATMNTS Geady Lbov Maxm Gerasmov Abstract: I the wors [ ] we proposed a approach of formg a cosesus

More information

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture) CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.

More information

,m = 1,...,n; 2 ; p m (1 p) n m,m = 0,...,n; E[X] = np; n! e λ,n 0; E[X] = λ.

,m = 1,...,n; 2 ; p m (1 p) n m,m = 0,...,n; E[X] = np; n! e λ,n 0; E[X] = λ. CS70: Lecture 21. Revew: Dstrbutos Revew: Idepedece Varace; Iequaltes; WLLN 1. Revew: Dstrbutos 2. Revew: Idepedece 3. Varace 4. Iequaltes Markov Chebyshev 5. Weak Law of Large Numbers U[1,...,] : Pr[X

More information

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois Radom Varables ECE 313 Probablty wth Egeerg Alcatos Lecture 8 Professor Rav K. Iyer Uversty of Illos Iyer - Lecture 8 ECE 313 Fall 013 Today s Tocs Revew o Radom Varables Cumulatve Dstrbuto Fucto (CDF

More information

COS 341 Discrete Mathematics. Exponential Generating Functions

COS 341 Discrete Mathematics. Exponential Generating Functions COS 341 Dscrete Mathematcs Epoetal Geeratg Fuctos 1 Read the tetbook Trouble keepg pace? Optoal referece tet (Rose) has may more solved eercses ad practce problems Start early o homework assgmets Come

More information

Fibonacci Identities as Binomial Sums

Fibonacci Identities as Binomial Sums It. J. Cotemp. Math. Sceces, Vol. 7, 1, o. 38, 1871-1876 Fboacc Idettes as Bomal Sums Mohammad K. Azara Departmet of Mathematcs, Uversty of Evasvlle 18 Lcol Aveue, Evasvlle, IN 477, USA E-mal: azara@evasvlle.edu

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package

More information

On Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph

On Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph Aals of Pure ad Appled Mathematcs Vol. 3, No., 7, -3 ISSN: 79-87X (P, 79-888(ole Publshed o 3 March 7 www.researchmathsc.org DOI: http://dx.do.org/.7/apam.3a Aals of O Eccetrcty Sum Egealue ad Eccetrcty

More information

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled

More information

arxiv:math/ v1 [math.gm] 8 Dec 2005

arxiv:math/ v1 [math.gm] 8 Dec 2005 arxv:math/05272v [math.gm] 8 Dec 2005 A GENERALIZATION OF AN INEQUALITY FROM IMO 2005 NIKOLAI NIKOLOV The preset paper was spred by the thrd problem from the IMO 2005. A specal award was gve to Yure Boreko

More information

Special Instructions / Useful Data

Special Instructions / Useful Data JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth

More information

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter LOGISTIC REGRESSION Notato Model Logstc regresso regresses a dchotomous depedet varable o a set of depedet varables. Several methods are mplemeted for selectg the depedet varables. The followg otato s

More information

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample

More information

Some identities involving the partial sum of q-binomial coefficients

Some identities involving the partial sum of q-binomial coefficients Some dettes volvg the partal sum of -bomal coeffcets Bg He Departmet of Mathematcs, Shagha Key Laboratory of PMMP East Cha Normal Uversty 500 Dogchua Road, Shagha 20024, People s Republc of Cha yuhe00@foxmal.com

More information