CS 70 Second Midterm 7 April NAME (1 pt): SID (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt):

Size: px
Start display at page:

Download "CS 70 Second Midterm 7 April NAME (1 pt): SID (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt):"

Transcription

1 CS 70 Secod Midter 7 April 2011 NAME (1 pt): SID (1 pt): TA (1 pt): Nae of Neighbor to your left (1 pt): Nae of Neighbor to your right (1 pt): Istructios: This is a closed book, closed calculator, closed coputer, closed etwork, ope brai exa, but you are peritted a 1 page, double-sided set of otes, large eough to read without a agifyig glass. You get oe poit each for fillig i the 5 lies at the top of this page. Each other questio is worth 20 poits. Write all your aswers o this exa. If you eed scratch paper, ask for it, write your ae o each sheet, ad attach it whe you tur it i (we have a stapler) Total Aswers 1

2 Questio 1 (20 poits). For full credit explai your aswers. Part 1 (10 poits). Pick a rado iteger i the rage fro 0 to 9,999,999, each with equal probability. What is the probability that the decial digits of add up to 9? Fill i your aswer i the box below. P Aswer: We eed to cout the uber of ways you ca order 9 stars ad 6 bars, with the uber of stars betwee bars i ad i + 1 beig the value of decial digit i + 1: C(15, 6) 15!/(6!9!). (If the sequece starts (eds) with stars, these deterie the value of the first (last) decial digit.) The we divide by the uber of possible 7-digit ubers, 10 7, to get the aswer C(15, 6)/10 7. Part 2 (5 poits). What is the probability that the decial digits of add up to 10? Fill i your aswer i the box below. P Aswer: This is ot exactly stars-ad-bars with 10 stars ad 6 bars, because if all 10 stars ed up betwee two cosecutive bars, we ca t represet this as a sigle decial digit. So we eed to subtract out these C(7,1) 7 possibilities, yieldig (C(16, 6) 7)/10 7. Part 3 (5 poits). What is the probability that the decial digits of add up to 11? Fill i your aswer i the box below. P Aswer: Agai, this is ot exactly stars-ad-bars with 11 stars ad 6 bars, because we eed to subtract out the cases where oe digit (group of cosecutive stars) is 10 (ad oe other is 1) or oe digit is 11: The uber of ways oe digit could be 10 ad aother 1 is , ad the uber of ways oe digit could be 11 is 7, yieldig (C(17, 6) 42 7))/

3 Questio 1 (20 poits). For full credit explai your aswers. Part 1 (10 poits). Pick a rado iteger i the rage fro 0 to 99,999,999, each with equal probability. What is the probability that the decial digits of add up to 9? Fill i your aswer i the box below. P Aswer: We eed to cout the uber of ways you ca order 9 stars ad 7 bars, with the uber of stars betwee bars i ad i + 1 beig the value of decial digit i + 1: C(16, 7) 16!/(7!9!). (If the sequece starts (eds) with stars, these deterie the value of the first (last) decial digit.) The we divide by the uber of possible 8-digit ubers, 10 8, to get the aswer C(16, 7)/10 8. Part 2 (5 poits). What is the probability that the decial digits of add up to 10? Fill i your aswer i the box below. P Aswer: This is ot exactly stars-ad-bars with 10 stars ad 7 bars, because if all 10 stars ed up betwee two cosecutive bars, we ca t represet this as a sigle decial digit. So we eed to subtract out these C(8,1) 8 possibilities, yieldig (C(17, 7) 8)/10 8. Part 3 (5 poits). What is the probability that the decial digits of add up to 11? Fill i your aswer i the box below. P Aswer: Agai, this is ot exactly stars-ad-bars with 11 stars ad 7 bars, because we eed to subtract out the cases where oe digit (group of cosecutive stars) is 10 (ad oe other is 1) or oe digit is 11: The uber of ways oe digit could be 10 ad aother 1 is , ad the uber of ways oe digit could be 11 is 8, yieldig (C(18, 7) 56 8))/

4 Questio 2 (20 poits). For full credit explai your aswers. 1. (10 poits) Let the saple space Ω {0, 1, 2, 3}, ad let the probability of each saple poit be uifor. What is the probability of the evets A {1, 2}, B {2, 3}, C {1, 3}? Are evets A ad B idepedet? What is P r[a B C]? Aswer: P (A) P (B) P (C) 2 4 P (A B) 1 4 P (A)P (B), so they are idepedet P r[a B C] (10 poits) Suppose you are give a bag cotaiig ubiased cois. You are told that 1 of these are oral cois, with heads o oe side ad tails o the other; however, the reaiig coi has heads o both its sides. Suppose you reach ito the bag, pick out a coi uiforly at rado, flip it ad get a head. What is the (coditioal) probability that this coi you chose is the fake (i.e., double-headed) coi? Aswer: Let F be the evet that the coi we picked fro the bag is fake, ad N is the evet that it is ot fake, ad let H be the evet that the coi we picked fro the bag coes up head. P (F H) P (F H) P (H) P (F )P (H F ) P (H F )+P (H N) P (F )P (H F ) P (F )P (H F )+P (N)P (H N) Suppose you flip the coi k ties after pickig it (istead of just oce) ad see k heads. What is ow the coditioal probability that you picked the fake coi? Aswer: Let F be the evet that the coi we picked fro the bag is fake, ad N is the evet that it is ot fake, ad let H k be the evet that the coi we picked fro the bag coes up head k ties. P (F H k ) P (F Hk ) P (H k ) P (F )P (H k F ) P (H k F )+P (H k N) P (F )P (H k F ) P (F )P (H k F )+P (N)P (H k N) k 4

5 Questio 2 (20 poits). For full credit explai your aswers. 1. (10 poits) Let the saple space S {a, b, c, d}, ad let the probability of each saple poit be uifor. What is the probability of the evets A {b, c}, B {c, d}, C {b, d}? Are evets A ad B idepedet? What is P r[a B C]? Aswer: P (A) P (B) P (C) 2 4 P (A B) 1 4 P (A)P (B), so they are idepedet P r[a B C] (10 poits) Suppose you are give a bag cotaiig ubiased cois. You are told that 1 of these are oral cois, with heads o oe side ad tails o the other; however, the reaiig coi has tails o both its sides. Suppose you reach ito the bag, pick out a coi uiforly at rado, flip it ad get a tail. What is the (coditioal) probability that this coi you chose is the fake (i.e., double-tailed) coi? Aswer: Let F be the evet that the coi we picked fro the bag is fake, ad N is the evet that it is ot fake, ad let T be the evet that the coi we picked fro the bag coes up tails. P (F T ) P (F T ) P (T ) P (F )P (T F ) P (T F )+P (T N) P (F )P (T F ) P (F )P (T F )+P (N)P (T N) Suppose you flip the coi s ties after pickig it (istead of just oce) ad see s tails. What is ow the coditioal probability that you picked the fake coi? Aswer: Let F be the evet that the coi we picked fro the bag is fake, ad N is the evet that it is ot fake, ad let T s be the evet that the coi we picked fro the bag coes up tails s ties. P (F T s ) P (F T s ) P (T s ) P (F )P (T s F ) P (T s F )+P (T s N) P (F )P (T s F ) P (F )P (T s F )+P (N)P (T s N) s 5

6 Questio 3 (20 poits) Bayes Casio. At Bayes Casio i Las Vegas, there are two types of slot achies: Red ad Blue. Every achie of oe color results i a wi 10% of the tie, ad every achie of the other color results i a wi 25% of the tie. (A wi is whe the achie returs oey). Nobody kows which color wis ore frequetly, but you are 80% sure it s the Blue achies. You fid a Blue achie i the casio ad play a quarter. (a) 6 poits. Let $ be the evet the Blue achie wis. Let A be the evet that the Blue achie is a good (25%) oe. Write dow the followig probabilities: Aswer: P ($ A) 25% P ($ A) 75% P ($ A) 10% P ($ A) 90% P (A) 80% P (A) 20% (b) 7 poits. Suppose the Blue achie does ot wi. Give this evet ad your 80% iitial estiate, what is the probability that the Blue achies have the better wi rate (25%)? Feel free to write your aswer as a fractio. Show your work i order to ear ay partial credit. Aswer: Usig Bayes rule, the the total probability rule, the Bayes rule agai, we write P (A $) P ($) P ($ A) + P ($ A) % (c) 7 poits. Repeat part (b), supposig istead that the Blue achie wis. Aswer: Siilar to part (b), we have P (A $) % 6

7 Questio 3 (20 poits) Bayes Casio. At Bayes Casio i Las Vegas, there are two types of slot achies: Red ad Blue. Every achie of oe color results i a wi 15% of the tie, ad every achie of the other color results i a wi 20% of the tie. (A wi is whe the achie returs oey). Nobody kows which color wis ore frequetly, but you are 75% sure it s the Blue achies. You fid a Blue achie i the casio ad play a quarter. (a) 6 poits. Let $ be the evet the Blue achie wis. Let A be the evet that the Blue achie is a good (20%) oe. Write dow the followig probabilities: Aswer: P ($ A) 20% P ($ A) 80% P ($ A) 15% P ($ A) 85% P (A) 75% P (A) 25% (b) 7 poits. Suppose the Blue achie does ot wi. Give this evet ad your 75% iitial estiate, what is the probability that the Blue achies have the better wi rate (20%)? Feel free to write your aswer as a fractio. Show your work i order to ear ay partial credit. Aswer: Usig Bayes rule, the the total probability rule, the Bayes rule agai, we write P (A $) P ($) P ($ A) + P ($ A) % (c) 7 poits. Repeat part (b), supposig istead that the Blue achie wis. Aswer: Siilar to part (b), we have P (A $) % 7

8 Questio 4 ( 20 poits ) Bioial Distributio. 4.1 (10 poits). Suppose X is a rado variable that ca take positive iteger values 0, 1,..., ad β is soe real uber such that 0 β 1. Distributio of X is give by the followig recurrece relatio: { (1 β) for k 0 P (X k) β 1 β k+1 k P (X k 1) for k 1, 2,..., Use iductio to prove that X is actually a bioially distributed rado variable. What are the paraeters of the bioial distributio? What is E(X)? Aswer: We clai that X Bi(, β). I order to prove the clai, we have to show that the give recurrece relatio ca be siplified to the stadard for of the bioial distributio. I other words, we have to show that for all k 0, 1,..., We will use iductio to prove it. P (X k) ( k ) β k (1 β) k Base case (k 0): P (X 0) ( ) β 0 (1 β) 0 (1 β) Iductio Hypothesis: P (X k) ( ) k β k (1 β) k for all 0 k t, ad for soe t where 0 t <. As the iductio step, we ow have to show that ( ) P (X t + 1) β t+1 (1 β) (t+1) t + 1 Pluggig k t + 1 i the give recurrece relatio, we get P (X t + 1) β 1 β t t + 1 ( β 1 β t t + 1 P (X t) ) β t (1 β) t [by iductio hypothesis] t β 1 β t t + 1! t!( t)! βt (1 β) t! (t + 1)!( t 1)! βt+1 (1 β) t 1 ( ) β t+1 (1 β) (t+1) t + 1 Hece, X Bi(, β), i.e. paraeters of the bioial distributio are ad β. Usig stadard result, we ca write E(X) β. 8

9 4.2 (10 poits). You have two boxes A ad B, each cotaiig balls. You radoly pick oe box ad the take oe ball out of it. You cotiue this process util you pick a box ad fid it epty. Suppose X is the uber of balls that reai i the other box whe you stop. If probability of pickig A ad B are p ad 1 p respectively, write dow the distributio of X i ters of ad p. Aswer: The evet {X k} eas that you ed up pickig a epty box ad the other box cotais k balls at that iteratio. There are two possible cases, viz. you pick box A ad fid it epty while box B cotais k balls, or you pick box B ad fid it epty while box A cotais k balls. X is, therefore, a iteger-valued rado variable that rages over {0, 1,..., }. Let A k deote the evet that you pick box A, fid it epty, but still there are k balls i box B. Siilarly, let B k deote the evet that you pick box B, fid it epty, but still there are k balls i box A. Therefore, we ca write P (X k) P (A k ) + P (B k ) Now, evet A k oly happes after you picked up exactly + k 2 k balls, all balls fro box A ad k balls fro box B i soe order, ad the pick box A agai (which is epty by ow) at the (2 k + 1)-th iteratio. Probability of takig out all balls fro box A ad k balls fro box B i 2 k iteratios is ( ) 2 k p (1 p) k ad probability of choosig box A i the (2 k + 1)-th iteratio is p. Therefore, ( ) 2 k P (A k ) p (1 p) k p ( ) 2 k p +1 (1 p) k Siilarly, P (B k ) ( ) 2 k p k (1 p) (1 p) ( ) 2 k p k (1 p) +1 Hece, the required distributio of X is (for all k 0, 1,..., ), P (X k) P (A k ) + P (B k ) ( ) ( 2 k 2 k p +1 (1 p) k + ( 2 k ) p k (1 p) +1 ) (p +1 (1 p) k + p k (1 p) +1 ) 9

10 Questio 4 ( 20 poits ) Bioial Distributio. 4.1 (10 poits). Suppose X is a rado variable that ca take positive iteger values 0, 1,..., ad µ is soe real uber such that 0 µ 1. Distributio of X is give by the followig recurrece relatio: { (1 µ) for k 0 P (X k) µ 1 µ k+1 k P (X k 1) for k 1, 2,..., Use iductio to prove that X is actually a bioially distributed rado variable. What are the paraeters of the bioial distributio? What is E(X)? Aswer: We clai that X Bi(, µ). I order to prove the clai, we have to show that the give recurrece relatio ca be siplified to the stadard for of the bioial distributio. I other words, we have to show that for all k 0, 1,..., ( ) P (X k) µ k (1 µ) k k We will use iductio to prove it. Base case (k 0): P (X 0) ( ) µ 0 (1 µ) 0 (1 µ) Iductio Hypothesis: P (X k) ( k) µ k (1 µ) k for all 0 k t, ad for soe t where 0 t <. As the iductio step, we ow have to show that ( ) P (X t + 1) µ t+1 (1 µ) (t+1) t + 1 Pluggig k t + 1 i the give recurrece relatio, we get P (X t + 1) µ 1 µ t t + 1 µ 1 µ t t + 1 ( t P (X t) ) µ t (1 µ) t [by iductio hypothesis] µ 1 µ t t + 1! t!( t)! µt (1 µ) t! (t + 1)!( t 1)! µt+1 (1 µ) t 1 ( ) µ t+1 (1 µ) (t+1) t + 1 Hece, X Bi(, µ), i.e. paraeters of the bioial distributio are ad µ. Usig stadard result, we ca write E(X) µ. 10

11 4.2 (10 poits). You have two boxes R ad S, each cotaiig balls. You radoly pick oe box ad the take oe ball out of it. You cotiue this process util you pick a box ad fid it epty. Suppose Y is the uber of balls that reai i the other box whe you stop. If probability of pickig R ad S are q ad 1 q respectively, write dow the distributio of Y i ters of ad q. Aswer: The evet {Y k} eas that you ed up pickig a epty box ad the other box cotais k balls at that iteratio. There are two possible cases, viz. you pick box R ad fid it epty while box S cotais k balls, or you pick box S ad fid it epty while box R cotais k balls. Y is, therefore, a iteger-valued rado variable that rages over {0, 1,..., }. Let R k deote the evet that you pick box R, fid it epty, but still there are k balls i box S. Siilarly, let S k deote the evet that you pick box S, fid it epty, but still there are k balls i box R. Therefore, we ca write P (Y k) P (R k ) + P (S k ) Now, evet R k oly happes after you picked up exactly + k 2 k balls, all balls fro box R ad k balls fro box S i soe order, ad the pick box R agai (which is epty by ow) at the (2 k +1)-th iteratio. Probability of takig out all balls fro box R ad k balls fro box S i 2 k iteratios is ( ) 2 k q (1 q) k ad probability of choosig box R i the (2 k + 1)-th iteratio is q. Therefore, ( ) 2 k P (R k ) q (1 q) k q ( ) 2 k q +1 (1 q) k Siilarly, P (S k ) ( ) 2 k q k (1 q) (1 q) ( ) 2 k q k (1 q) +1 Hece, the required distributio of Y is (for all k 0, 1,..., ), P (Y k) P (R k ) + P (S k ) ( ) ( 2 k 2 k q +1 (1 q) k + ( 2 k ) q k (1 q) +1 ) (q +1 (1 q) k + q k (1 q) +1 ) 11

12 Questio 5 (20 poits) Rado Variables. Istead of a pair of the usual 6-sided dice, you ca play a gae with oe 4 sided die (sides ubered 1 through 4, each equally likely to coe up), ad oe 8 sided die (sides ubered 1 through 8, agai all equally likely). Let A be the su of the values that coe up o these two dice. 5.1 (5 poits) What is the expected value of A? E(A) Aswer: E(A) E(D4) + E(D8) E(D4) 4 i i1 4 i i E(D8) 8 i 1 8 i i E(A) E(A) (5 poits) What is the probability A 8? P (A 8) Aswer: A 8 whe we roll either (1,7), (2,6), (3,5), or (4,4) P (A 8) 4 P (D4 x) P (D8 y)

13 5.3 (10 poits) You play a friedly bettig gae with your fried where you roll two dice each roud ad if the su of the two dice is 7 your fried pays you $5, otherwise you pay your fried $1. If you play this gae with two 6-sided dice your expected profit is $0 each roud. Defie a rado variable ad use it to calculate the expected aout of oey you wi or lose i 1 roud if you play usig a 4-sided die ad a 8-sided die. I the box below specify whether you wi or lose oey (by circlig the appropriate word) ad fill i the expected aout of oey you wi or lose i oe roud. I oe roud you expect to wi/lose (circle oe) $ Aswer: Let W be the aout of oey we wi. If we roll a 7 the W 5, otherwise W 1. There are 4 evets where A 7, we roll either (1,6), (2,5), (3,4), or (4,3). The probability A 7 is The probability A is ay other uber is 7 8. E(W ) 5 P (A 7) 1 P (A! 7) We expect to lose a quarter each roud. Note: For a pair of 6-sided dice P (A 7) 1 6 E(W ) 5 P (A 7) 1 P (A! 7)

14 Questio 5 (20 poits) Rado Variables. Istead of a pair of the usual 6-sided dice, you ca play a gae with oe 4 sided die (sides ubered 1 through 4, each equally likely to coe up), ad oe 8 sided die (sides ubered 1 through 8, agai all equally likely). Let S be the su of the values that coe up o these two dice. 5.1 (5 poits) What is the expected value of S? E(S) Aswer: E(S) E(D4) + E(D8) E(D4) 4 i i1 4 i i E(D8) 8 i 1 8 i i E(S) E(S) (5 poits) What is the probability S 8? P (S 8) Aswer: S 8 whe we roll either (1,7), (2,6), (3,5), or (4,4) P (S 8) 4 P (D4 x) P (D8 y)

15 5.3 (10 poits) You play a friedly bettig gae with your fried where you roll two dice each roud ad if the su of the two dice is 7 your fried pays you $5, otherwise you pay your fried $1. If you play this gae with two 6-sided dice your expected profit is $0 each roud. Defie a rado variable ad use it to calculate the expected aout of oey you wi or lose i 1 roud if you play usig a 4-sided die ad a 8-sided die. I the box below specify whether you wi or lose oey (by circlig the appropriate word) ad fill i the expected aout of oey you wi or lose i oe roud. I oe roud you expect to wi/lose (circle oe) $ Aswer: Let W be the aout of oey we wi. If we roll a 7 the W 5, otherwise W 1. There are 4 evets where S 7, we roll either (1,6), (2,5), (3,4), or (4,3). The probability S 7 is The probability S is ay other uber is 7 8. E(W ) 5 P (S 7) 1 P (S! 7) We expect to lose a quarter each roud. Note: For a pair of 6-sided dice P (S 7) 1 6 E(W ) 5 P (S 7) 1 P (S! 7)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

PRACTICE PROBLEMS FOR THE FINAL

PRACTICE PROBLEMS FOR THE FINAL PRACTICE PROBLEMS FOR THE FINAL Math 36Q Fall 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2 to

More information

COMP 2804 Solutions Assignment 1

COMP 2804 Solutions Assignment 1 COMP 2804 Solutios Assiget 1 Questio 1: O the first page of your assiget, write your ae ad studet uber Solutio: Nae: Jaes Bod Studet uber: 007 Questio 2: I Tic-Tac-Toe, we are give a 3 3 grid, cosistig

More information

Probability theory and mathematical statistics:

Probability theory and mathematical statistics: N.I. Lobachevsky State Uiversity of Nizhi Novgorod Probability theory ad mathematical statistics: Law of Total Probability. Associate Professor A.V. Zorie Law of Total Probability. 1 / 14 Theorem Let H

More information

Final Review for MATH 3510

Final Review for MATH 3510 Fial Review for MATH 50 Calculatio 5 Give a fairly simple probability mass fuctio or probability desity fuctio of a radom variable, you should be able to compute the expected value ad variace of the variable

More information

PRACTICE PROBLEMS FOR THE FINAL

PRACTICE PROBLEMS FOR THE FINAL PRACTICE PROBLEMS FOR THE FINAL Math 36Q Sprig 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2

More information

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009 Discrete Matheatics: Lectures 8 ad 9 Priciple of Iclusio ad Exclusio Istructor: Arijit Bishu Date: August ad 3, 009 As you ca observe by ow, we ca cout i various ways. Oe such ethod is the age-old priciple

More information

1 (12 points) Red-Black trees and Red-Purple trees

1 (12 points) Red-Black trees and Red-Purple trees CS6 Hoework 3 Due: 29 April 206, 2 oo Subit o Gradescope Haded out: 22 April 206 Istructios: Please aswer the followig questios to the best of your ability. If you are asked to desig a algorith, please

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

( ) = p and P( i = b) = q.

( ) = p and P( i = b) = q. MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of

More information

Lecture 2: April 3, 2013

Lecture 2: April 3, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

19.1 The dictionary problem

19.1 The dictionary problem CS125 Lecture 19 Fall 2016 19.1 The dictioary proble Cosider the followig data structural proble, usually called the dictioary proble. We have a set of ites. Each ite is a (key, value pair. Keys are i

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Intermediate Math Circles November 4, 2009 Counting II

Intermediate Math Circles November 4, 2009 Counting II Uiversity of Waterloo Faculty of Mathematics Cetre for Educatio i Mathematics ad Computig Itermediate Math Circles November 4, 009 Coutig II Last time, after lookig at the product rule ad sum rule, we

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

CS / MCS 401 Homework 3 grader solutions

CS / MCS 401 Homework 3 grader solutions CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of

More information

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio

More information

CS 330 Discussion - Probability

CS 330 Discussion - Probability CS 330 Discussio - Probability March 24 2017 1 Fudametals of Probability 11 Radom Variables ad Evets A radom variable X is oe whose value is o-determiistic For example, suppose we flip a coi ad set X =

More information

Chapter 2. Asymptotic Notation

Chapter 2. Asymptotic Notation Asyptotic Notatio 3 Chapter Asyptotic Notatio Goal : To siplify the aalysis of ruig tie by gettig rid of details which ay be affected by specific ipleetatio ad hardware. [1] The Big Oh (O-Notatio) : It

More information

Define a Markov chain on {1,..., 6} with transition probability matrix P =

Define a Markov chain on {1,..., 6} with transition probability matrix P = Pla Group Work 0. The title says it all Next Tie: MCMC ad Geeral-state Markov Chais Midter Exa: Tuesday 8 March i class Hoework 4 due Thursday Uless otherwise oted, let X be a irreducible, aperiodic Markov

More information

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15 CS 70 Discrete Mathematics ad Probability Theory Sprig 2012 Alistair Siclair Note 15 Some Importat Distributios The first importat distributio we leared about i the last Lecture Note is the biomial distributio

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

PH 425 Quantum Measurement and Spin Winter SPINS Lab 1

PH 425 Quantum Measurement and Spin Winter SPINS Lab 1 PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

Economics 250 Assignment 1 Suggested Answers. 1. We have the following data set on the lengths (in minutes) of a sample of long-distance phone calls

Economics 250 Assignment 1 Suggested Answers. 1. We have the following data set on the lengths (in minutes) of a sample of long-distance phone calls Ecoomics 250 Assigmet 1 Suggested Aswers 1. We have the followig data set o the legths (i miutes) of a sample of log-distace phoe calls 1 20 10 20 13 23 3 7 18 7 4 5 15 7 29 10 18 10 10 23 4 12 8 6 (1)

More information

CSCI-6971 Lecture Notes: Stochastic processes

CSCI-6971 Lecture Notes: Stochastic processes CSCI-6971 Lecture Notes: Stochastic processes Kristopher R. Beevers Departet of Coputer Sciece Resselaer Polytechic Istitute beevek@cs.rpi.edu February 2, 2006 1 Overview Defiitio 1.1. A stochastic process

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15 CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model

More information

The Binomial Multi- Section Transformer

The Binomial Multi- Section Transformer 4/4/26 The Bioial Multisectio Matchig Trasforer /2 The Bioial Multi- Sectio Trasforer Recall that a ulti-sectio atchig etwork ca be described usig the theory of sall reflectios as: where: ( ω ) = + e +

More information

Homework 5 Solutions

Homework 5 Solutions Homework 5 Solutios p329 # 12 No. To estimate the chace you eed the expected value ad stadard error. To do get the expected value you eed the average of the box ad to get the stadard error you eed the

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Contents Two Sample t Tests Two Sample t Tests

Contents Two Sample t Tests Two Sample t Tests Cotets 3.5.3 Two Saple t Tests................................... 3.5.3 Two Saple t Tests Setup: Two Saples We ow focus o a sceario where we have two idepedet saples fro possibly differet populatios. Our

More information

Test One (Answer Key)

Test One (Answer Key) CS395/Ma395 (Sprig 2005) Test Oe Name: Page 1 Test Oe (Aswer Key) CS395/Ma395: Aalysis of Algorithms This is a closed book, closed otes, 70 miute examiatio. It is worth 100 poits. There are twelve (12)

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

STAT Homework 1 - Solutions

STAT Homework 1 - Solutions STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better

More information

The Hypergeometric Coupon Collection Problem and its Dual

The Hypergeometric Coupon Collection Problem and its Dual Joural of Idustrial ad Systes Egieerig Vol., o., pp -7 Sprig 7 The Hypergeoetric Coupo Collectio Proble ad its Dual Sheldo M. Ross Epstei Departet of Idustrial ad Systes Egieerig, Uiversity of Souther

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the

More information

PUTNAM TRAINING PROBABILITY

PUTNAM TRAINING PROBABILITY PUTNAM TRAINING PROBABILITY (Last udated: December, 207) Remark. This is a list of exercises o robability. Miguel A. Lerma Exercises. Prove that the umber of subsets of {, 2,..., } with odd cardiality

More information

HOMEWORK 2 SOLUTIONS

HOMEWORK 2 SOLUTIONS HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k

More information

A quick activity - Central Limit Theorem and Proportions. Lecture 21: Testing Proportions. Results from the GSS. Statistics and the General Population

A quick activity - Central Limit Theorem and Proportions. Lecture 21: Testing Proportions. Results from the GSS. Statistics and the General Population A quick activity - Cetral Limit Theorem ad Proportios Lecture 21: Testig Proportios Statistics 10 Coli Rudel Flip a coi 30 times this is goig to get loud! Record the umber of heads you obtaied ad calculate

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version]

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version] Math 4707 Sprig 08 Darij Griberg: idter page Math 4707 Sprig 08 Darij Griberg: idter with solutios [preliiary versio] Cotets 0.. Coutig first-eve tuples......................... 3 0.. Coutig legal paths

More information

Data Analysis and Statistical Methods Statistics 651

Data Analysis and Statistical Methods Statistics 651 Data Aalysis ad Statistical Methods Statistics 651 http://www.stat.tau.edu/~suhasii/teachig.htl Suhasii Subba Rao Exaple The itroge cotet of three differet clover plats is give below. 3DOK1 3DOK5 3DOK7

More information

Induction: Solutions

Induction: Solutions Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For

More information

18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2.

18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2. 18.S34 (FALL, 007) GREATEST INTEGER PROBLEMS Note: We use the otatio x for the greatest iteger x, eve if the origial source used the older otatio [x]. 1. (48P) If is a positive iteger, prove that + + 1

More information

Mathematical Statistics - MS

Mathematical Statistics - MS Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios

More information

f(1), and so, if f is continuous, f(x) = f(1)x.

f(1), and so, if f is continuous, f(x) = f(1)x. 2.2.35: Let f be a additive fuctio. i Clearly fx = fx ad therefore f x = fx for all Z+ ad x R. Hece, for ay, Z +, f = f, ad so, if f is cotiuous, fx = fx. ii Suppose that f is bouded o soe o-epty ope set.

More information

Al Lehnen Madison Area Technical College 10/5/2014

Al Lehnen Madison Area Technical College 10/5/2014 The Correlatio of Two Rado Variables Page Preliiary: The Cauchy-Schwarz-Buyakovsky Iequality For ay two sequeces of real ubers { a } ad = { b } =, the followig iequality is always true. Furtherore, equality

More information

Bertrand s postulate Chapter 2

Bertrand s postulate Chapter 2 Bertrad s postulate Chapter We have see that the sequece of prie ubers, 3, 5, 7,... is ifiite. To see that the size of its gaps is ot bouded, let N := 3 5 p deote the product of all prie ubers that are

More information

A PROBABILITY PROBLEM

A PROBABILITY PROBLEM A PROBABILITY PROBLEM A big superarket chai has the followig policy: For every Euros you sped per buy, you ear oe poit (suppose, e.g., that = 3; i this case, if you sped 8.45 Euros, you get two poits,

More information

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a Jacobi sybols efiitio Let be a odd positive iteger If 1, the Jacobi sybol : Z C is the costat fuctio 1 1 If > 1, it has a decopositio ( as ) a product of (ot ecessarily distict) pries p 1 p r The Jacobi

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

A string of not-so-obvious statements about correlation in the data. (This refers to the mechanical calculation of correlation in the data.

A string of not-so-obvious statements about correlation in the data. (This refers to the mechanical calculation of correlation in the data. STAT-UB.003 NOTES for Wedesday 0.MAY.0 We will use the file JulieApartet.tw. We ll give the regressio of Price o SqFt, show residual versus fitted plot, save residuals ad fitted. Give plot of (Resid, Price,

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

Topic 8: Expected Values

Topic 8: Expected Values Topic 8: Jue 6, 20 The simplest summary of quatitative data is the sample mea. Give a radom variable, the correspodig cocept is called the distributioal mea, the epectatio or the epected value. We begi

More information

Name Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions

Name Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions Nae Period ALGEBRA II Chapter B ad A Notes Solvig Iequalities ad Absolute Value / Nubers ad Fuctios SECTION.6 Itroductio to Solvig Equatios Objectives: Write ad solve a liear equatio i oe variable. Solve

More information

Real Variables II Homework Set #5

Real Variables II Homework Set #5 Real Variables II Homework Set #5 Name: Due Friday /0 by 4pm (at GOS-4) Istructios: () Attach this page to the frot of your homework assigmet you tur i (or write each problem before your solutio). () Please

More information

Sample Midterm This midterm consists of 10 questions. The rst seven questions are multiple choice; the remaining three

Sample Midterm This midterm consists of 10 questions. The rst seven questions are multiple choice; the remaining three CS{74 Combiatorics & Discrete Probability, Fall 97 Sample Midterm :30{:00pm, 7 October Read these istructios carefully. This is a closed book exam. Calculators are permitted.. This midterm cosists of 0

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19 CS 70 Discrete Mathematics ad Probability Theory Sprig 2016 Rao ad Walrad Note 19 Some Importat Distributios Recall our basic probabilistic experimet of tossig a biased coi times. This is a very simple

More information

Discrete Mathematics and Probability Theory Fall 2016 Walrand Probability: An Overview

Discrete Mathematics and Probability Theory Fall 2016 Walrand Probability: An Overview CS 70 Discrete Mathematics ad Probability Theory Fall 2016 Walrad Probability: A Overview Probability is a fasciatig theory. It provides a precise, clea, ad useful model of ucertaity. The successes of

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Lecture 47 Sectio 9.7 Robb T. Koether Hampde-Sydey College Fri, Apr 8, 204 Robb T. Koether (Hampde-Sydey College The Biomial Theorem Fri, Apr 8, 204 / 25 Combiatios 2 Pascal s Triagle

More information

The Binomial Multi-Section Transformer

The Binomial Multi-Section Transformer 4/15/2010 The Bioial Multisectio Matchig Trasforer preset.doc 1/24 The Bioial Multi-Sectio Trasforer Recall that a ulti-sectio atchig etwork ca be described usig the theory of sall reflectios as: where:

More information

Queueing Theory II. Summary. M/M/1 Output process Networks of Queue Method of Stages. General Distributions

Queueing Theory II. Summary. M/M/1 Output process Networks of Queue Method of Stages. General Distributions Queueig Theory II Suary M/M/1 Output process Networks of Queue Method of Stages Erlag Distributio Hyperexpoetial Distributio Geeral Distributios Ebedded Markov Chais 1 M/M/1 Output Process Burke s Theore:

More information

Statistics for Applications Fall Problem Set 7

Statistics for Applications Fall Problem Set 7 18.650. Statistics for Applicatios Fall 016. Proble Set 7 Due Friday, Oct. 8 at 1 oo Proble 1 QQ-plots Recall that the Laplace distributio with paraeter λ > 0 is the cotiuous probaλ bility easure with

More information

Answer Key, Problem Set 1, Written

Answer Key, Problem Set 1, Written Cheistry 1 Mies, Sprig, 018 Aswer Key, Proble Set 1, Writte 1. 14.3;. 14.34 (add part (e): Estiate / calculate the iitial rate of the reactio); 3. NT1; 4. NT; 5. 14.37; 6. 14.39; 7. 14.41; 8. NT3; 9. 14.46;

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

Lecture 7: Properties of Random Samples

Lecture 7: Properties of Random Samples Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ

More information

MEI Casio Tasks for Further Pure

MEI Casio Tasks for Further Pure Task Complex Numbers: Roots of Quadratic Equatios. Add a ew Equatio scree: paf 2. Chage the Complex output to a+bi: LpNNNNwd 3. Select Polyomial ad set the Degree to 2: wq 4. Set a=, b=5 ad c=6: l5l6l

More information

Math 10A final exam, December 16, 2016

Math 10A final exam, December 16, 2016 Please put away all books, calculators, cell phoes ad other devices. You may cosult a sigle two-sided sheet of otes. Please write carefully ad clearly, USING WORDS (ot just symbols). Remember that the

More information

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0 GENERATING FUNCTIONS Give a ifiite sequece a 0,a,a,, its ordiary geeratig fuctio is A : a Geeratig fuctios are ofte useful for fidig a closed forula for the eleets of a sequece, fidig a recurrece forula,

More information

We have also learned that, thanks to the Central Limit Theorem and the Law of Large Numbers,

We have also learned that, thanks to the Central Limit Theorem and the Law of Large Numbers, Cofidece Itervals III What we kow so far: We have see how to set cofidece itervals for the ea, or expected value, of a oral probability distributio, both whe the variace is kow (usig the stadard oral,

More information

5.6 Binomial Multi-section Matching Transformer

5.6 Binomial Multi-section Matching Transformer 4/14/21 5_6 Bioial Multisectio Matchig Trasforers 1/1 5.6 Bioial Multi-sectio Matchig Trasforer Readig Assiget: pp. 246-25 Oe way to axiize badwidth is to costruct a ultisectio Γ f that is axially flat.

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Mathematics Extension 2

Mathematics Extension 2 009 HIGHER SCHOOL CERTIFICATE EXAMINATION Mathematics Etesio Geeral Istructios Readig time 5 miutes Workig time hours Write usig black or blue pe Board-approved calculators may be used A table of stadard

More information

Binomial transform of products

Binomial transform of products Jauary 02 207 Bioial trasfor of products Khristo N Boyadzhiev Departet of Matheatics ad Statistics Ohio Norther Uiversity Ada OH 4580 USA -boyadzhiev@ouedu Abstract Give the bioial trasfors { b } ad {

More information

1. Hilbert s Grand Hotel. The Hilbert s Grand Hotel has infinite many rooms numbered 1, 2, 3, 4

1. Hilbert s Grand Hotel. The Hilbert s Grand Hotel has infinite many rooms numbered 1, 2, 3, 4 . Hilbert s Grad Hotel The Hilbert s Grad Hotel has ifiite may rooms umbered,,,.. Situatio. The Hotel is full ad a ew guest arrives. Ca the mager accommodate the ew guest? - Yes, he ca. There is a simple

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

ECE 901 Lecture 4: Estimation of Lipschitz smooth functions

ECE 901 Lecture 4: Estimation of Lipschitz smooth functions ECE 9 Lecture 4: Estiatio of Lipschitz sooth fuctios R. Nowak 5/7/29 Cosider the followig settig. Let Y f (X) + W, where X is a rado variable (r.v.) o X [, ], W is a r.v. o Y R, idepedet of X ad satisfyig

More information

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL METHODS FOR SOLVING EQUATIONS Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:

More information

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term. 0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece

More information

3. One pencil costs 25 cents, and we have 5 pencils, so the cost is 25 5 = 125 cents. 60 =

3. One pencil costs 25 cents, and we have 5 pencils, so the cost is 25 5 = 125 cents. 60 = JHMMC 0 Grade Solutios October, 0. By coutig, there are 7 words i this questio.. + 4 + + 8 + 6 + 6.. Oe pecil costs cets, ad we have pecils, so the cost is cets. 4. A cube has edges.. + + 4 + 0 60 + 0

More information

Measures of Spread: Standard Deviation

Measures of Spread: Standard Deviation Measures of Spread: Stadard Deviatio So far i our study of umerical measures used to describe data sets, we have focused o the mea ad the media. These measures of ceter tell us the most typical value of

More information

Z ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew

Z ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew Problem ( poits) Evaluate the itegrals Z p x 9 x We ca draw a right triagle labeled this way x p x 9 From this we ca read off x = sec, so = sec ta, ad p x 9 = R ta. Puttig those pieces ito the itegralrwe

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam. Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the

More information

STAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS

STAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS STAT 56 Aswers Homework 6 April 2, 28 Solutios by Mark Daiel Ward PROBLEMS Chapter 6 Problems 2a. The mass p(, correspods to either o the irst two balls beig white, so p(, 8 7 4/39. The mass p(, correspods

More information

Tutorial F n F n 1

Tutorial F n F n 1 (CS 207) Discrete Structures July 30, 203 Tutorial. Prove the followig properties of Fiboacci umbers usig iductio, where Fiboacci umbers are defied as follows: F 0 =0,F =adf = F + F 2. (a) Prove that P

More information

Application to Random Graphs

Application to Random Graphs A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let

More information

Estimation for Complete Data

Estimation for Complete Data Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of

More information

GENERATING FUNCTIONS

GENERATING FUNCTIONS GENERATING FUNCTIONS XI CHEN. Exapes Questio.. Toss a coi ties ad fid the probabiity of gettig exacty k heads. Represet H by x ad T by x 0 ad a sequece, say, HTHHT by (x (x 0 (x (x (x 0. We see that a

More information

Probability Refresher and Cycle Analysis. Spring 2018 CS 438 Staff, University of Illinois 1

Probability Refresher and Cycle Analysis. Spring 2018 CS 438 Staff, University of Illinois 1 Probability Refresher ad Cycle Aalysis Sprig 2018 CS 438 Staff, Uiversity of Illiois 1 A Quick Probability Refresher A radom variable, X, ca take o a umber of differet possible values Example: the umber

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k

More information

Analytic Continuation

Analytic Continuation Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for

More information

Problem Set 2 Solutions

Problem Set 2 Solutions CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S

More information