HW Solution 2 Due: July 10:39AM

Size: px
Start display at page:

Download "HW Solution 2 Due: July 10:39AM"

Transcription

1 ECS 35: Probability and Random Processes 200/ HW Solution 2 Due: July 0:39AM Lecturer: Prapun Suksompong, Ph.D. Instructions (a) A part of ONE question will be graded. Of course, you do not know which problem will be selected; so you should work on all of them. (b) Late submission will not be accepted. (c) Write down all the steps that you have done to obtain your answers. You may not get full credit even when your answer is correct without showing how you get your answer. Problem. Binomial theorem: Sometimes, the number ( n r) is called a binomial coefficient because it appears as the coefficient of x r y n r in the expansion of the binomial (x+y) n. More specifically, we have, for any positive integer n, (x + y) n = x r y n r (2.) r To see how we get (2.), let s consider a smaller case of n = 3. The expansion of (x + y) 3 can be found using combinatorial reasoning instead of multiplying the three terms out. When (x+y) 3 = (x+y)(x+y)(x+y) is expanded, all products of a term in the first sum, a term in the second sum, and a term in the third sum are added. Terms of the form x 3, x 2 y, xy 2, andy 3 arise. To obtain a term of the form x 3, an x must be chosen in each of the sums, and this can be done in only one way. Thus, the x 3 term in the product has a coefficient of. To obtain a term of the form x 2 y, an x must be chosen in two of the three sums (and consequently a y in the other sum). Hence. the number of such terms is the number of 2-combinations of three objects, namely, ( 3 2). Similarly, the number of terms of the form xy 2 is the number of ways to pick one of the three sums to obtain an x (and consequently take a y from each of the other two terms). This can be done in ( ) 3 ways. Finally, the only way to obtain a y 3 term is to choose the y for each of the three sums in the product, and this can be done in exactly one way. Consequently. it follows that (x + y) 3 = x 3 + 3x 2 y + 3xy 2 + y 3. Now, let s state a combinatorial proof of the binomial theorem (2.). The terms in the product when it is expanded are of the form x r y n r for r = 0,, 2,..., n. To count the 2-

2 number of terms of the form x r y n r, note that to obtain such a term it is necessary to choose r xs from the n sums (so that the other n r terms in the product are ys). Therefore. the coefficient of x r y n r is ( n r). From (2.), if we let x = y =, then we get another important identity: = 2 n. (2.2) r (a) What is the coefficient of x 2 y 3 in the expansion of (x + y) 25? (b) What is the coefficient of x 2 y 3 in the expansion of (2x 3y) 25? (c) Use the binomial theorem (2.) to evaluate n k=0 ( ) k( n k). (d) Use the binomial theorem (2.) to simplify the following sums (i) (ii) r even ( n r r odd ( n ) r x r ( x) n r ) x r ( x) n r (e) If we differentiate (2.) with respect to x and then multiply by x, we have r x r y n r = nx(x + y) n. r Use similar technique to simplify the sum n r2( n r) x r y n r. Solution: (a) ( 25 2) = 5, 200, 300. (b) ( ) ( 3) 3 = 25! 2!3! = (c) From (2.), set x = and y =, then we have n k=0 ( ) k( n k) = ( + ) n =

3 (d) To deal with the sum involving only the even terms (or only the odd terms), we first use (2.) to expand (x + y) n and (x + ( y)) n. When we add the expanded results, only the even terms in the sum are left. Similarly, when we find the difference between the two expanded results, only the the odd terms are left. More specifically, r even r odd x r y n r = r 2 ((x + y)n + (y x) n ), and x r y n r = r 2 ((x + y)n (y x) n ). If x + y =, then r even r odd x r y n r = r 2 ( + ( 2x)n ), and x r y n r = r 2 ( ( 2x)n ). (2.3a) (2.3b) (e) n r2( n r) x r y n r = nx ( x(n )(x + y) n 2 + (x + y) n ). Problem 2. Prove the following properties of probability measure using only the probability axioms and the properties whose proofs have already been shown in class. (a) P (A c ) = P (A) (b) P (A) [0, ] (c) If P (A) = = 0, then P (A B) = 0 (d) If P (A) = =, then P (A B) = Solution: (a) Because A and A c partition Ω, we have P (Ω) = P (A) + P (A c ). One of the axioms say that P (Ω) =. Applying this fact to the equality above proves the required property. 2-3

4 (b) One of the axioms already specifies that P (A) 0. So, we only need to show that P (A). Now, for any event A, we know that A Ω and hence, from the monotonicity property shown in class, P (A) P (Ω) =. This completes the proof. (c) [Capinski and Zastawniak, 2003, Q4.26] First, we know that P (A B) 0 from one of the axioms. Now, we have seen in class that P (A B) P (A) +. Plugging in P (A) = = 0 gives P (A B) 0 Because P (A B) 0 and P (A B) 0, it must be = 0. (d) [Capinski and Zastawniak, 2003, Q4.27] Because P (A) = =, we know that P (A c ) = P (B c ) = 0. From the previous part of the problem, we can then conclude that P (A c B c ) = 0. The event A B is the complement of A c B c. Hence, P (A B) = P (A c B c ) = 0 =. Problem 3. Suppose that P (A) = and = 2. Find the range of the possible value 2 3 for P (A B). Hint: Smaller than the interval [0, ]. Solution:[Capinski and Zastawniak, 2003, Q4.2] We will first try to bound P (A B). Note that A B A and A B B. Hence, we know that P (A B) P (A) and P (A B). To summarize, we now know that On the other hand, we know that P (A B) min{p (A), }. P (A B) = P (A) + P (A B). Applying the fact that P (A B), we then have P (A B) P (A) +. If the number of the RHS is > 0, then it is a new information. However, if the number on the RHS is negative, it is useless and we will use the fact that P (A B) 0. To summarize, we now know that max{p (A) +, 0} P (A B). In conclusion, max{(p (A) + ), 0} P (A B) min{p (A), }. [ Plugging in the value P (A) = and = 2 gives the range 2 3 6, ]. The upperbound can be obtained by constructing an example which has A B. The lower-bound can 2 be obtained by considering an example where A B = Ω. 2-4

5 Problem 4. Suppose that P (A) = and =. Find the range of the possible value 2 3 for P (A B). Hint: Smaller than the interval [0, ]. Solution:[Capinski and Zastawniak, 2003, Q4.22] By monotonicity we must have On the other hand, we know that P (A B) max{p (A), }. P (A B) P (A) +. If the RHS is >, then the inequality is useless and we simply use the fact that it must be. To summarize, we have In conclusion, P (A B) min{(p (A) + ), }. max{p (A), } P (A B) min{(p (A) + ), }. Plugging in the value P (A) = and =, we have 2 3 P (A B) [ 2, 5 ]. 6 The upper-bound can be obtained by making A B. The lower-bound is achieved when B A. Problem 5. Let A and B be events for which P (A),, and P (A B) are known. Express the following in terms of these probabilities: (a) P (A B) (b) P (A B c ) (c) P (B (A B c )) (d) P (A c B c ) Solution: (a) P (A B) = P (A) + P (A B). This property is shown in class. 2-5

6 (b) We have seen in class that P (A B c ) = P (A) P (A B). Plugging in the expression for P (A B) from the previous part, we have P (A B c ) = P (A) (P (A) + P (A B)) = P (A B). Alternatively, we can start from scratch with the set identity A B = B (A B c ) whose union is a disjoint union. Hence, P (A B) = + P (A B c ). Moving to the LHS finishes the proof. (c) P (B (A B c )) = P (A B) because A B = B (A B c ). (d) P (A c B c ) = P (A B) because A c B c = (A B) c. Problem 6. Prove the following properties of conditional probability. (a) P (A Ω) = P (A) (b) If B A and 0, then P (A B) =. (c) If A B = and 0, then P (A B) = 0 (d) P (A c B) = P (A B) Solution: (a) By definition P (A Ω) = P (A Ω) P (Ω). Because A Ω = A and P (Ω) =, P (A Ω) = P (A) = P (A). (b) By definition, we have P (A B) = P (A B). This quantity is only defined when 0. Because B A, we have A B = B. Hence, P (A B) = =. (c) By definition, we have P (A B) = P (A B). This quantity is only defined when 0. Because A B =, we have P (A B) = P ( ) = 0 =

7 (d) By definition we have P (A c B) = P (Ac B). Note that P (A c B) = P (B \ A) = P (A B). Therefore, P (A c B) = P (Ac B) = P (A B) = P (A B) = P (A B). Problem 7. Due to an Internet configuration error, packets sent from New York to Los Angeles are routed through El Paso, Texas with probability 3/4. Given that a packet is routed through El Paso, suppose it has conditional probability /3 of being dropped. Given that a packet is not routed through El Paso, suppose it has conditional probability /4 of being dropped. (a) Find the probability that a packet is dropped. (b) Find the conditional probability that a packet is routed through El Paso given that it is not dropped. Solution: [Gubner, 2006, Ex..20] To solve this problem, we use the notation E = {routed through El Paso} and D = {packet is dropped}. With this notation, it is easy to interpret the problem as telling us that P (D E) = /3, P (D E c ) = /4, and P (E) = 3/4. (a) By the law of total probability, P (D) = P (D E)P (E) + P (D E c )P (E c ) = (/3)(3/4) + (/4)( 3/4) = /4 + /6 = 5/6. (b) P (E D c ) = P (E Dc ) P (D c ) = P (Dc E)P (E) P (D c ) = ( /3)(3/4) 5/6 = 8. Problem 8. You have two coins, a fair one with probability of heads and an unfair one 2 with probability of heads, but otherwise identical. A coin is selected at random and tossed, 3 falling heads up. How likely is it that it is the fair one? Solution: [Capinski and Zastawniak, 2003, Q7.28] Let F, U, and H be the events that the selected coin is fair, the selected coin is unfair, and the coin lands heads up, respectively. Because the coin is selected at random, the probability P (F ) of selecting the fair coin is P (F ) =. For fair coin, the conditional probability P (H F ) of heads is For the unfair 2 2 coin, P (U) = P (F ) = and P (U F ) =

8 By the Bayes formula, the probability that the fair coin has been selected given that it lands heads up is P (F H) = P (H F )P (F ) P (H F )P (F ) + P (H U)P (U) = = = = 3 5. Problem 9. You have three coins in your pocket, two fair ones but the third biased with probability of heads p and tails p. One coin selected at random drops to the floor, landing heads up. How likely is it that it is one of the fair coins? Solution: [Capinski and Zastawniak, 2003, Q7.29] Let F, U, and H be the events that the selected coin is fair, the selected coin is unfair, and the coin lands heads up, respectively. We are given that P (F ) = 2 3, P (U) = 3, P (H F ) =, P (H U) = p. 2 By the Bayes formula, the probability that the fair coin has been selected given that it lands heads up is P (F H) = P (H F )P (F ) P (H F )P (F ) + P (H U)P (U) = p = + p. 2-8

HW Solution 3 Due: Sep 11

HW Solution 3 Due: Sep 11 ECS 35: Probability and Random Processes 204/ HW Solution 3 Due: Sep Lecturer: Prapun Suksompong, PhD Instructions (a) ONE part of a question will be graded (5 pt) Of course, you do not know which part

More information

HW Solution 3 Due: July 15

HW Solution 3 Due: July 15 ECS 315: Probability and Random Processes 2010/1 HW Solution 3 Due: July 15 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) A part of ONE question will be graded. Of course, you do not know which problem

More information

HW Solution 1 Due: Aug 26, 9:19 AM (in tutorial session)

HW Solution 1 Due: Aug 26, 9:19 AM (in tutorial session) .qxd 1/7/10 9:45 AM Page 28 ECS 315: Probability and Random Processes 2015/1 HW Solution 1 Due: Aug 26, 9:19 AM (in tutorial session) APTER 2 PROBABILITY Lecturer: Prapun Suksompong, Ph.D. S FOR SECTION

More information

HW Solution 1 Due: February 1

HW Solution 1 Due: February 1 .qxd 1/7/10 9:45 AM Page 28 APTER 2 PROBABILITY IES 302: Engineering Statistics 2011/2 HW Solution 1 Due: February 1 Lecturer: Prapun Suksompong, Ph.D. S FOR SECTION 2-1 2-18. In a magnetic storage device,

More information

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events LECTURE 1 1 Introduction The first part of our adventure is a highly selective review of probability theory, focusing especially on things that are most useful in statistics. 1.1 Sample spaces and events

More information

MAT 271E Probability and Statistics

MAT 271E Probability and Statistics MAT 7E Probability and Statistics Spring 6 Instructor : Class Meets : Office Hours : Textbook : İlker Bayram EEB 3 ibayram@itu.edu.tr 3.3 6.3, Wednesday EEB 6.., Monday D. B. Bertsekas, J. N. Tsitsiklis,

More information

MAT 271E Probability and Statistics

MAT 271E Probability and Statistics MAT 71E Probability and Statistics Spring 013 Instructor : Class Meets : Office Hours : Textbook : Supp. Text : İlker Bayram EEB 1103 ibayram@itu.edu.tr 13.30 1.30, Wednesday EEB 5303 10.00 1.00, Wednesday

More information

HW Solution 12 Due: Dec 2, 9:19 AM

HW Solution 12 Due: Dec 2, 9:19 AM ECS 315: Probability and Random Processes 2015/1 HW Solution 12 Due: Dec 2, 9:19 AM Lecturer: Prapun Suksompong, Ph.D. Problem 1. Let X E(3). (a) For each of the following function g(x). Indicate whether

More information

1 Variance of a Random Variable

1 Variance of a Random Variable Indian Institute of Technology Bombay Department of Electrical Engineering Handout 14 EE 325 Probability and Random Processes Lecture Notes 9 August 28, 2014 1 Variance of a Random Variable The expectation

More information

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio 4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio Wrong is right. Thelonious Monk 4.1 Three Definitions of

More information

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability Lecture Notes 1 Basic Probability Set Theory Elements of Probability Conditional probability Sequential Calculation of Probability Total Probability and Bayes Rule Independence Counting EE 178/278A: Basic

More information

18440: Probability and Random variables Quiz 1 Friday, October 17th, 2014

18440: Probability and Random variables Quiz 1 Friday, October 17th, 2014 18440: Probability and Random variables Quiz 1 Friday, October 17th, 014 You will have 55 minutes to complete this test. Each of the problems is worth 5 % of your exam grade. No calculators, notes, or

More information

Randomized Algorithms

Randomized Algorithms Randomized Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A new 4 credit unit course Part of Theoretical Computer Science courses at the Department of Mathematics There will be 4 hours

More information

P (E) = P (A 1 )P (A 2 )... P (A n ).

P (E) = P (A 1 )P (A 2 )... P (A n ). Lecture 9: Conditional probability II: breaking complex events into smaller events, methods to solve probability problems, Bayes rule, law of total probability, Bayes theorem Discrete Structures II (Summer

More information

Machine Learning: Homework Assignment 2 Solutions

Machine Learning: Homework Assignment 2 Solutions 10-601 Machine Learning: Homework Assignment 2 Solutions Professor Tom Mitchell Carnegie Mellon University January 21, 2009 The assignment is due at 1:30pm (beginning of class) on Monday, February 2, 2009.

More information

Discrete Mathematics and Probability Theory Summer 2017 Hongling Lu, Vrettos Moulos, and Allen Tang HW 6

Discrete Mathematics and Probability Theory Summer 2017 Hongling Lu, Vrettos Moulos, and Allen Tang HW 6 CS 70 Discrete Mathematics and Probability Theory Summer 017 Hongling Lu, Vrettos Moulos, and Allen Tang HW 6 Sundry Before you start your homework, write down your team. Who else did you work with on

More information

1. Discrete Distributions

1. Discrete Distributions Virtual Laboratories > 2. Distributions > 1 2 3 4 5 6 7 8 1. Discrete Distributions Basic Theory As usual, we start with a random experiment with probability measure P on an underlying sample space Ω.

More information

Solution to HW 12. Since B and B 2 form a partition, we have P (A) = P (A B 1 )P (B 1 ) + P (A B 2 )P (B 2 ). Using P (A) = 21.

Solution to HW 12. Since B and B 2 form a partition, we have P (A) = P (A B 1 )P (B 1 ) + P (A B 2 )P (B 2 ). Using P (A) = 21. Solution to HW 12 (1) (10 pts) Sec 12.3 Problem A screening test for a disease shows a positive result in 92% of all cases when the disease is actually present and in 7% of all cases when it is not. Assume

More information

ECE 302: Chapter 02 Probability Model

ECE 302: Chapter 02 Probability Model ECE 302: Chapter 02 Probability Model Fall 2018 Prof Stanley Chan School of Electrical and Computer Engineering Purdue University 1 / 35 1. Probability Model 2 / 35 What is Probability? It is a number.

More information

HW Solution 5 Due: Sep 13

HW Solution 5 Due: Sep 13 ECS 315: Probability and Random Processes 01/1 HW Solution 5 Due: Sep 13 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which

More information

Lecture 6: The Pigeonhole Principle and Probability Spaces

Lecture 6: The Pigeonhole Principle and Probability Spaces Lecture 6: The Pigeonhole Principle and Probability Spaces Anup Rao January 17, 2018 We discuss the pigeonhole principle and probability spaces. Pigeonhole Principle The pigeonhole principle is an extremely

More information

Lecture 1. ABC of Probability

Lecture 1. ABC of Probability Math 408 - Mathematical Statistics Lecture 1. ABC of Probability January 16, 2013 Konstantin Zuev (USC) Math 408, Lecture 1 January 16, 2013 1 / 9 Agenda Sample Spaces Realizations, Events Axioms of Probability

More information

STAT 414: Introduction to Probability Theory

STAT 414: Introduction to Probability Theory STAT 414: Introduction to Probability Theory Spring 2016; Homework Assignments Latest updated on April 29, 2016 HW1 (Due on Jan. 21) Chapter 1 Problems 1, 8, 9, 10, 11, 18, 19, 26, 28, 30 Theoretical Exercises

More information

STAT 418: Probability and Stochastic Processes

STAT 418: Probability and Stochastic Processes STAT 418: Probability and Stochastic Processes Spring 2016; Homework Assignments Latest updated on April 29, 2016 HW1 (Due on Jan. 21) Chapter 1 Problems 1, 8, 9, 10, 11, 18, 19, 26, 28, 30 Theoretical

More information

Lecture 4: Probability and Discrete Random Variables

Lecture 4: Probability and Discrete Random Variables Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 4: Probability and Discrete Random Variables Wednesday, January 21, 2009 Lecturer: Atri Rudra Scribe: Anonymous 1

More information

Sum and Product Rules

Sum and Product Rules Sum and Product Rules Exercise. Consider tossing a coin five times. What is the probability of getting the same result on the first two tosses or the last two tosses? Solution. Let E be the event that

More information

Statistical Inference

Statistical Inference Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory

More information

STA 247 Solutions to Assignment #1

STA 247 Solutions to Assignment #1 STA 247 Solutions to Assignment #1 Question 1: Suppose you throw three six-sided dice (coloured red, green, and blue) repeatedly, until the three dice all show different numbers. Assuming that these dice

More information

Dynamic Programming Lecture #4

Dynamic Programming Lecture #4 Dynamic Programming Lecture #4 Outline: Probability Review Probability space Conditional probability Total probability Bayes rule Independent events Conditional independence Mutual independence Probability

More information

Recitation 2: Probability

Recitation 2: Probability Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions

More information

Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya

Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete

More information

The probability of an event is viewed as a numerical measure of the chance that the event will occur.

The probability of an event is viewed as a numerical measure of the chance that the event will occur. Chapter 5 This chapter introduces probability to quantify randomness. Section 5.1: How Can Probability Quantify Randomness? The probability of an event is viewed as a numerical measure of the chance that

More information

Mathematical Foundations of Computer Science Lecture Outline October 18, 2018

Mathematical Foundations of Computer Science Lecture Outline October 18, 2018 Mathematical Foundations of Computer Science Lecture Outline October 18, 2018 The Total Probability Theorem. Consider events E and F. Consider a sample point ω E. Observe that ω belongs to either F or

More information

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B).

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B). Lectures 7-8 jacques@ucsdedu 41 Conditional Probability Let (Ω, F, P ) be a probability space Suppose that we have prior information which leads us to conclude that an event A F occurs Based on this information,

More information

CS 441 Discrete Mathematics for CS Lecture 20. Probabilities. CS 441 Discrete mathematics for CS. Probabilities

CS 441 Discrete Mathematics for CS Lecture 20. Probabilities. CS 441 Discrete mathematics for CS. Probabilities CS 441 Discrete Mathematics for CS Lecture 20 Probabilities Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square CS 441 Discrete mathematics for CS Probabilities Three axioms of the probability theory:

More information

Discrete Random Variables

Discrete Random Variables Chapter 5 Discrete Random Variables Suppose that an experiment and a sample space are given. A random variable is a real-valued function of the outcome of the experiment. In other words, the random variable

More information

Probability Review. Chao Lan

Probability Review. Chao Lan Probability Review Chao Lan Let s start with a single random variable Random Experiment A random experiment has three elements 1. sample space Ω: set of all possible outcomes e.g.,ω={1,2,3,4,5,6} 2. event

More information

Deep Learning for Computer Vision

Deep Learning for Computer Vision Deep Learning for Computer Vision Lecture 3: Probability, Bayes Theorem, and Bayes Classification Peter Belhumeur Computer Science Columbia University Probability Should you play this game? Game: A fair

More information

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

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 Introduction One of the key properties of coin flips is independence: if you flip a fair coin ten times and get ten

More information

Probability Theory and Applications

Probability Theory and Applications Probability Theory and Applications Videos of the topics covered in this manual are available at the following links: Lesson 4 Probability I http://faculty.citadel.edu/silver/ba205/online course/lesson

More information

Conditional Probability

Conditional Probability Conditional Probability When we obtain additional information about a probability experiment, we want to use the additional information to reassess the probabilities of events given the new information.

More information

1 Stat 605. Homework I. Due Feb. 1, 2011

1 Stat 605. Homework I. Due Feb. 1, 2011 The first part is homework which you need to turn in. The second part is exercises that will not be graded, but you need to turn it in together with the take-home final exam. 1 Stat 605. Homework I. Due

More information

EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final

EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 220 Hearst 230 Hearst 237

More information

Topic 5 Basics of Probability

Topic 5 Basics of Probability Topic 5 Basics of Probability Equally Likely Outcomes and the Axioms of Probability 1 / 13 Outline Equally Likely Outcomes Axioms of Probability Consequences of the Axioms 2 / 13 Introduction A probability

More information

Probabilistic models

Probabilistic models Kolmogorov (Andrei Nikolaevich, 1903 1987) put forward an axiomatic system for probability theory. Foundations of the Calculus of Probabilities, published in 1933, immediately became the definitive formulation

More information

MAT2377. Ali Karimnezhad. Version September 9, Ali Karimnezhad

MAT2377. Ali Karimnezhad. Version September 9, Ali Karimnezhad MAT2377 Ali Karimnezhad Version September 9, 2015 Ali Karimnezhad Comments These slides cover material from Chapter 1. In class, I may use a blackboard. I recommend reading these slides before you come

More information

Sample Spaces, Random Variables

Sample Spaces, Random Variables Sample Spaces, Random Variables Moulinath Banerjee University of Michigan August 3, 22 Probabilities In talking about probabilities, the fundamental object is Ω, the sample space. (elements) in Ω are denoted

More information

Probability and distributions. Francesco Corona

Probability and distributions. Francesco Corona Probability Probability and distributions Francesco Corona Department of Computer Science Federal University of Ceará, Fortaleza Probability Many kinds of studies can be characterised as (repeated) experiments

More information

Example continued. Math 425 Intro to Probability Lecture 37. Example continued. Example

Example continued. Math 425 Intro to Probability Lecture 37. Example continued. Example continued : Coin tossing Math 425 Intro to Probability Lecture 37 Kenneth Harris kaharri@umich.edu Department of Mathematics University of Michigan April 8, 2009 Consider a Bernoulli trials process with

More information

Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.

Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2

More information

Lecture 16. Lectures 1-15 Review

Lecture 16. Lectures 1-15 Review 18.440: Lecture 16 Lectures 1-15 Review Scott Sheffield MIT 1 Outline Counting tricks and basic principles of probability Discrete random variables 2 Outline Counting tricks and basic principles of probability

More information

Probability Theory Review

Probability Theory Review Cogsci 118A: Natural Computation I Lecture 2 (01/07/10) Lecturer: Angela Yu Probability Theory Review Scribe: Joseph Schilz Lecture Summary 1. Set theory: terms and operators In this section, we provide

More information

Chapter 1: Introduction to Probability Theory

Chapter 1: Introduction to Probability Theory ECE5: Stochastic Signals and Systems Fall 8 Lecture - September 6, 8 Prof. Salim El Rouayheb Scribe: Peiwen Tian, Lu Liu, Ghadir Ayache Chapter : Introduction to Probability Theory Axioms of Probability

More information

Introduction to Probability. Ariel Yadin. Lecture 1. We begin with an example [this is known as Bertrand s paradox]. *** Nov.

Introduction to Probability. Ariel Yadin. Lecture 1. We begin with an example [this is known as Bertrand s paradox]. *** Nov. Introduction to Probability Ariel Yadin Lecture 1 1. Example: Bertrand s Paradox We begin with an example [this is known as Bertrand s paradox]. *** Nov. 1 *** Question 1.1. Consider a circle of radius

More information

Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr( )

Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr( ) Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr Pr = Pr Pr Pr() Pr Pr. We are given three coins and are told that two of the coins are fair and the

More information

Assignment 4: Solutions

Assignment 4: Solutions Math 340: Discrete Structures II Assignment 4: Solutions. Random Walks. Consider a random walk on an connected, non-bipartite, undirected graph G. Show that, in the long run, the walk will traverse each

More information

Week 12-13: Discrete Probability

Week 12-13: Discrete Probability Week 12-13: Discrete Probability November 21, 2018 1 Probability Space There are many problems about chances or possibilities, called probability in mathematics. When we roll two dice there are possible

More information

Probabilistic models

Probabilistic models Probabilistic models Kolmogorov (Andrei Nikolaevich, 1903 1987) put forward an axiomatic system for probability theory. Foundations of the Calculus of Probabilities, published in 1933, immediately became

More information

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Introduction to Probability and Statistics Lecture 2: Conditional probability Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin www.cs.cmu.edu/ psarkar/teaching

More information

Machine Learning CMPT 726 Simon Fraser University. Binomial Parameter Estimation

Machine Learning CMPT 726 Simon Fraser University. Binomial Parameter Estimation Machine Learning CMPT 726 Simon Fraser University Binomial Parameter Estimation Outline Maximum Likelihood Estimation Smoothed Frequencies, Laplace Correction. Bayesian Approach. Conjugate Prior. Uniform

More information

ENGG 2440B Discrete Mathematics for Engineers Tutorial 8

ENGG 2440B Discrete Mathematics for Engineers Tutorial 8 ENGG 440B Discrete Mathematics for Engineers Tutorial 8 Jiajin Li Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong jjli@se.cuhk.edu.hk November, 018 Jiajin

More information

Chapter 2 Class Notes

Chapter 2 Class Notes Chapter 2 Class Notes Probability can be thought of in many ways, for example as a relative frequency of a long series of trials (e.g. flips of a coin or die) Another approach is to let an expert (such

More information

MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM

MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM YOUR NAME: KEY: Answers in blue Show all your work. Answers out of the blue and without any supporting work may receive no credit even if they are

More information

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7 ECS 332: Principles of Communications 2012/1 HW 4 Due: Sep 7 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which part will

More information

Probability Theory and Simulation Methods

Probability Theory and Simulation Methods Feb 28th, 2018 Lecture 10: Random variables Countdown to midterm (March 21st): 28 days Week 1 Chapter 1: Axioms of probability Week 2 Chapter 3: Conditional probability and independence Week 4 Chapters

More information

Generating Functions

Generating Functions 8.30 lecture notes March, 0 Generating Functions Lecturer: Michel Goemans We are going to discuss enumeration problems, and how to solve them using a powerful tool: generating functions. What is an enumeration

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Fall 203 Vazirani Note 2 Random Variables: Distribution and Expectation We will now return once again to the question of how many heads in a typical sequence

More information

Discrete Random Variable

Discrete Random Variable Discrete Random Variable Outcome of a random experiment need not to be a number. We are generally interested in some measurement or numerical attribute of the outcome, rather than the outcome itself. n

More information

Mu Sequences and Series Topic Test Solutions FAMAT State Convention 2018

Mu Sequences and Series Topic Test Solutions FAMAT State Convention 2018 . E The first term of the sum has a division by 0 and therefore the entire expression is undefined.. C We can pair off the elements in the sum, 008 008 ( (k + ) + (k + )) = 3. D We can once again pair

More information

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables ECE 6010 Lecture 1 Introduction; Review of Random Variables Readings from G&S: Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section

More information

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations EECS 70 Discrete Mathematics and Probability Theory Fall 204 Anant Sahai Note 5 Random Variables: Distributions, Independence, and Expectations In the last note, we saw how useful it is to have a way of

More information

HW Solution 7 Due: Oct 24

HW Solution 7 Due: Oct 24 ECS 315: Probability and Random Processes 2014/1 HW Solution 7 Due: Oct 24 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which

More information

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics? Lecture 1 (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 (2.1 --- 2.6). Chapter 1 1. What is Statistics? 2. Two definitions. (1). Population (2). Sample 3. The objective of statistics.

More information

CMPSCI 240: Reasoning Under Uncertainty

CMPSCI 240: Reasoning Under Uncertainty CMPSCI 240: Reasoning Under Uncertainty Lecture 5 Prof. Hanna Wallach wallach@cs.umass.edu February 7, 2012 Reminders Pick up a copy of B&T Check the course website: http://www.cs.umass.edu/ ~wallach/courses/s12/cmpsci240/

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

X = X X n, + X 2

X = X X n, + X 2 CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 22 Variance Question: At each time step, I flip a fair coin. If it comes up Heads, I walk one step to the right; if it comes up Tails, I walk

More information

Math 3338: Probability (Fall 2006)

Math 3338: Probability (Fall 2006) Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/8 2.2 Axioms, Interpretations, and Properties of Probability Probability

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

Binomial Coefficient Identities/Complements

Binomial Coefficient Identities/Complements Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology

More information

CS 246 Review of Proof Techniques and Probability 01/14/19

CS 246 Review of Proof Techniques and Probability 01/14/19 Note: This document has been adapted from a similar review session for CS224W (Autumn 2018). It was originally compiled by Jessica Su, with minor edits by Jayadev Bhaskaran. 1 Proof techniques Here we

More information

CSE 103 Homework 8: Solutions November 30, var(x) = np(1 p) = P r( X ) 0.95 P r( X ) 0.

CSE 103 Homework 8: Solutions November 30, var(x) = np(1 p) = P r( X ) 0.95 P r( X ) 0. () () a. X is a binomial distribution with n = 000, p = /6 b. The expected value, variance, and standard deviation of X is: E(X) = np = 000 = 000 6 var(x) = np( p) = 000 5 6 666 stdev(x) = np( p) = 000

More information

Probability: Terminology and Examples Class 2, Jeremy Orloff and Jonathan Bloom

Probability: Terminology and Examples Class 2, Jeremy Orloff and Jonathan Bloom 1 Learning Goals Probability: Terminology and Examples Class 2, 18.05 Jeremy Orloff and Jonathan Bloom 1. Know the definitions of sample space, event and probability function. 2. Be able to organize a

More information

1. Is the set {f a,b (x) = ax + b a Q and b Q} of all linear functions with rational coefficients countable or uncountable?

1. Is the set {f a,b (x) = ax + b a Q and b Q} of all linear functions with rational coefficients countable or uncountable? Name: Instructions. Show all work in the space provided. Indicate clearly if you continue on the back side, and write your name at the top of the scratch sheet if you will turn it in for grading. No books

More information

Math 1313 Experiments, Events and Sample Spaces

Math 1313 Experiments, Events and Sample Spaces Math 1313 Experiments, Events and Sample Spaces At the end of this recording, you should be able to define and use the basic terminology used in defining experiments. Terminology The next main topic in

More information

CIS 2033 Lecture 5, Fall

CIS 2033 Lecture 5, Fall CIS 2033 Lecture 5, Fall 2016 1 Instructor: David Dobor September 13, 2016 1 Supplemental reading from Dekking s textbook: Chapter2, 3. We mentioned at the beginning of this class that calculus was a prerequisite

More information

Basics of probability

Basics of probability Chapter 4 Basics of probability 4.1 The probability axioms Probabilities are defined over collections of sets. These collections have to have some structure to them. Definition 4.1 ( -field). A collection

More information

Some Basic Concepts of Probability and Information Theory: Pt. 2

Some Basic Concepts of Probability and Information Theory: Pt. 2 Some Basic Concepts of Probability and Information Theory: Pt. 2 PHYS 476Q - Southern Illinois University January 22, 2018 PHYS 476Q - Southern Illinois University Some Basic Concepts of Probability and

More information

Introduction to Stochastic Processes

Introduction to Stochastic Processes Stat251/551 (Spring 2017) Stochastic Processes Lecture: 1 Introduction to Stochastic Processes Lecturer: Sahand Negahban Scribe: Sahand Negahban 1 Organization Issues We will use canvas as the course webpage.

More information

Example 1. The sample space of an experiment where we flip a pair of coins is denoted by:

Example 1. The sample space of an experiment where we flip a pair of coins is denoted by: Chapter 8 Probability 8. Preliminaries Definition (Sample Space). A Sample Space, Ω, is the set of all possible outcomes of an experiment. Such a sample space is considered discrete if Ω has finite cardinality.

More information

Lecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable

Lecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed

More information

Name: Firas Rassoul-Agha

Name: Firas Rassoul-Agha Midterm 1 - Math 5010 - Spring 016 Name: Firas Rassoul-Agha Solve the following 4 problems. You have to clearly explain your solution. The answer carries no points. Only the work does. CALCULATORS ARE

More information

Worksheet 9. Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.

Worksheet 9. Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates. ATH 57H Spring 0 Worksheet 9 Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.. Let f(x) = +x. Find f (00) (0) - the 00th derivative of f at point x = 0.

More information

MA : Introductory Probability

MA : Introductory Probability MA 320-001: Introductory Probability David Murrugarra Department of Mathematics, University of Kentucky http://www.math.uky.edu/~dmu228/ma320/ Spring 2017 David Murrugarra (University of Kentucky) MA 320:

More information

Computational Perception. Bayesian Inference

Computational Perception. Bayesian Inference Computational Perception 15-485/785 January 24, 2008 Bayesian Inference The process of probabilistic inference 1. define model of problem 2. derive posterior distributions and estimators 3. estimate parameters

More information

MAS113 Introduction to Probability and Statistics. Proofs of theorems

MAS113 Introduction to Probability and Statistics. Proofs of theorems MAS113 Introduction to Probability and Statistics Proofs of theorems Theorem 1 De Morgan s Laws) See MAS110 Theorem 2 M1 By definition, B and A \ B are disjoint, and their union is A So, because m is a

More information

EE514A Information Theory I Fall 2013

EE514A Information Theory I Fall 2013 EE514A Information Theory I Fall 2013 K. Mohan, Prof. J. Bilmes University of Washington, Seattle Department of Electrical Engineering Fall Quarter, 2013 http://j.ee.washington.edu/~bilmes/classes/ee514a_fall_2013/

More information

Entropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39

Entropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39 Entropy Probability and Computing Presentation 22 Probability and Computing Presentation 22 Entropy 1/39 Introduction Why randomness and information are related? An event that is almost certain to occur

More information

Lecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality

Lecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality Lecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality Discrete Structures II (Summer 2018) Rutgers University Instructor: Abhishek Bhrushundi

More information

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Introduction to Probability and Statistics Lecture 10: Expectation and Variance Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin www.cs.cmu.edu/ psarkar/teaching

More information

HMMT February 2018 February 10, 2018

HMMT February 2018 February 10, 2018 HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18

More information