UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 3: Solutions Fall 2007
|
|
- Grace Jennings
- 5 years ago
- Views:
Transcription
1 UC Berkeley Department of Electrical Engineering and Computer Science EE 126: Probablity and Random Processes Problem Set 3: Solutions Fall 2007 Issued: Thursday, September 13, 2007 Due: Friday, September 21, 2007 Reading: Bertsekas & Tsitsiklis, 1.4, 1.5. and 1.6 Problem 3.1 A mouse is wandering on a rectangular grid with grid points (a, b, a, b = 0, 1, 2, From grid position (a, b, the mouse must move either to position (a + 1, b or (a, b + 1. (a Find the total number of different paths from (0, 0 to (n, n. (b Find the total number of different paths from (1, 0 to (n + 1, n that pass through at least one of the points (r, r, with 1 r n. (a Each path from (0, 0 to (n, n can be specified by a list of ordered moves. There will always be n moves in each of the two directions, for a total of 2n moves to get to (n, n. Therefore, any such list of ordered moves will have length 2n. The different possible paths can be counted by finding the number of ways to label the 2n spots in the list with R and U moves, corresponding to incrememnting the first and second coordinate, ( 2n respectively. The answer is therefore. n The argument can be generalized to see that to get from any (a 0, b 0 to (a 1, b 1 (with a 0 < a 1 and b 0 < b 1 there are ( (a 1 a 0 +(b 1 b 0 a 1 a 0 paths. (b We instead consider the unrestricted paths from (0, 1 to (n + 1, n. We can construct a bijective map from this new set of paths to the paths in the original problem statement, meaning for each path in the new set there is exactly one path in the original set, and no path in the original set is unaccounted for. To construct the mapping, we notice that any path from (0, 1 to (n + 1, n must cross the diagonal (touch some (r, r for 1 r n at least once, though it may touch more than once. For any such path, we consider the path segment from (0, 1 to the first time the path touches the diagonal. By reflecting this path segment across the diagonal (so that the point (0, 1 becomes (1, 0, etc. we generate a path from (1, 0 to (n + 1, n that at least touches the diagonal at the point (r, r, and so it is one of the paths in the original set. This mapping is bijective, and so the original set and the new set have the same cardinality (number of elements. We count the number of paths in the new set by our generalization in part (a: we have ( 2n such paths. n + 1 1
2 Problem 3.2 A lazy GSI returns exams to students randomly. If the class has n students, what is the probability that at least one student receives his/her own exam? Compute the limiting value of this probability as n +. We define the collection of events {A i } i 1,2,...,n, with A i = { student i gets his own test }. The probability in question is given by P ( n i A i, and since the probability law is uniform, we can equivalently count n i=1 A i and normalize by n! to get the desired probability. To count a union like the one above, we will use the inclusion-exclusion formula from p. 54 of Bertsekas and Tsitsiklis: n A i = i ( n A i A i A j + A i A j A k i=1 1 i<j n 1 i<j<k n Note that for any i we have: A i = (n 1! The equality can be seen by fixing the ith student to get his paper back and counting the number of permutations of the remaining (n 1 papers with respect to their corresponding students. There are n such i s in the first inclusion-exclusion summation. By the same reasoning, we have for any i j: A i A j = (n 2! In the inclusion-exclusion formula we only sum over i < j because otherwise we would be counting events such as A 1 A 1 and double-counting A 1 A 2 as both A 1 A 2 and A 2 A 1. We also note that there are ( n 2 such events Ai A j for i < j, since we have one for each subset of {A i } i 1,2,...,n of size two. Therefore, in general we have, for intersections of k of our A i events: A i1 A i2 A ik = (n k! And we sum over ( n k such sets in the corresponding inclusion-exclusion term. We apply the described counting to the terms in the inclusion-exclusion formula to get: 2
3 n n A i = ( A i ( A i A j + i i=1 1 i<j n ( ( n n = n! (n 2! + (n 3! 2 3 = n! (1 12! + 13! = n! = n! n k=1 ( 1 ( 1 (k 1 k! n ( 1 k k=0 k! 1 i<j<k n ( A i A j A k Where the last equality holds by rewriting the summation to begin at 0. To calculate the n ( 1 k appropriate probability, we normalize by n! to get 1. k! We recognize the summation in the final expression as the power series for e 1, and so in the limiting case we have: k=0 n lim 1 ( 1 k n k! k=0 = 1 1 e Problem 3.3 (Fishing trip Koichi s backyard pond contains g goldfish and c catfish. All fish are equally likely to be caught. (a Suppose that Koichi catches a total of k fish (no fish are thrown back. What is the probability of catching x goldfish? (b Now suppose that all k fish are returned to the pond, and he starts fishing again, and catches a total of m fish. What is the probability that among the caught set of m fish, exactly 2 goldfish are included that were also caught in the first catch? (Assume that fish do not learn from experience. (a Since the experiment is under a uniform probability law, we can solve this problem by counting. We want to count the number of ways to catch x goldfish in a total of k fish caught. We decompose the enumeration of the set into two decisions using the counting principle; we first select x goldfish and then select k x catfish, completely counting the sets of size k containing exactly x goldfish. The number of ways to select x goldfish in the first step is given by ( ( g x, and the number of ways to select k x catfish is given by c k x, 3
4 and so there are ( ( g c x k x ways of selecting a catch k with x goldfish. We normalize by the total number of ways to catch k fish, yielding: ( g c x( k x ( g+c k (b Again we use counting to solve for the probability. We decompose the countng problem into two steps; we first select the two goldfish to be caught again from our original catch, and then we select the m 2 other fish from the g + c x fish that were not goldfish caught the first time. Therefore we have ( ( x g+c x 2, yielding a probability of: m 2 ( x g+c x 2( m 2 ( g+c m Problem 3.4 In each running of a lottery, a sequence r numbers are drawn independently (with replacement from a total of n numbers. You win the lottery if the r-number sequence on your ticket matches the drawn sequence. (a Suppose I buy one (randomly chosen lottery ticket. What is the probability of winning the lottery? (b Suppose that I hack into the lottery computer, and program it to only draw sequences with r numbers in a non-decreasing order. I then go and buy a ticket with its numbers in non-decreasing order. Now what is my probability of winning the lottery? (a The probability of choosing any given number correctly is 1/n, and since there is replacement, the probability of getting any number in the sequence correct is independent of getting the other numbers correct. Thus, by multiplying out the probabilities with independence, the probability is 1/n r. (b We can rephrase the problem in terms of placing labels on the selected numbers, or placing r indistinguishable balls in n bins, with each ball corresponding to picking a number once (we can place zero or more balls in each bin and each bin corresponding with one of the possible numbers to select. Since we know the sequence is in nondecreasing order, there exists a bijective map between the r-balls-in-n-bins description and the nondecreasing sequence description. (Note that if the sequence had to be in increasing order, we could not pick the same number twice, or, correspondingly, place more than one ball in a bin. Also, if the sequence were not sorted, we could not draw a bijection to the balls-in-bins scenario, since we would need some way to distinguish the order of selected numbers. Thus we have a collection of integers x ii {1,2,...,n}, with each x i 0 indicating the number of balls placed in bin i for i = 1, 2,..., n. (Though the problem only tells us there are n 4
5 Case 1: b > a + 1 Case 2: b = a + 1 distinct numbers to choose from, we make this labeling without loss of generality because we can just choose some way to match the n numbers in the lottery to 1, 2,..., n. We also know that since we place r balls total, we have n i=1 x i = r. Thus we can use the provided formula to find that the number of ways to choose such non-decreasing sequences of length r from n numbers with replacement is ( ( n+r 1 n 1 = n+r 1 r. To win the lottery, we must choose the correct one out of the ( n+r 1 n 1 equally likely sequences, and so the probability is given by: 1 ( n+r 1 n 1 Problem 3.5 An urn contains a aquamarine balls, and b blue balls. The balls are removed successively without replacement until the urn is empty. If b > a, show that the probability that at all stages until the urn is empty there are more blue than aquamarine balls in the urn is equal to (b a/(b + a. Proof by induction on the sum of a and b. Base case: Let a + b = 1. From b > a 0, we know b = 1 and a = 0. There is one blue ball and no aquamarine ball. The result holds trivially. For inductive hypothesis, we assume the result is correct when a + b = k. The following inductive step is to show that it still holds for a+b = k +1. Let P (i, j denote the probability that the urn with i aquamarine balls and j blue balls has more blue than aquamrine balls during a sequence of removal until the urn is empty. After one ball, either aquamarine or blue, is removed, the urn still has more blue balls than aquamarine balls. P (a, b = P (one aquamarine ball is removedp (a 1, b + P (one blue ball is removedp (a, b 1 a = a + b b a + 1 b + a 1 + b a + b b 1 a b + a 1 = b a b + a If one blue ball is removed, the urn will have the same number of blue and aquamarine balls. This is not the event we are looking for. P (a, b = P (one aquamarine ball is removedp (a 1, b a = a + b b a + 1 b + a 1 1 = 2a + 1 = b a b + a 5
6 Case 1 and 2 conclude our proof. Problem 3.6 A communication system transmits one of three signals, s 1, s 2 and s 3, with equal probabilities. The transmission is corrupted by noise, causing the received signal to be changed according to the following table of conditional probabilities: Receive, j P(s j s i s 1 s 2 s 3 s Send, i s s For example, if s 1 is sent, the probability of receiving s 3 is 0.3. The entries of the table list the probability of s j received, given that s i is sent, i.e., P (s j received s i sent. (a Compute the (unconditional probability that s j is received for j = 1, 2, 3. (b Compute the probability P(s i sent s j received for i, j = 1, 2, 3. (c As seen from the numbers above, the transmitted signal can be very different from the received signal. Thus, when symbol s j is received, it may not be a good idea to conclude that s j was sent. We need a decision scheme to decide which signal was sent based on the signal we receive with the lowest possible error probability, that is, the probability of making a wrong decision. Find the scheme that minimizes the overall error probability. The problem statement provides P (s i sent = 1/3 as well as a table listing the conditional probabilities P (s j received s i sent. 1. Via the Total Probability Theorem, we can calculate the unconditional probability that s j is received, for each j = 1, 2, 3, according to P (s j received = i P (s j received s i sentp (s i sent = , j = , j = , j = For each unique pair (i, j, Bayes Rule yields P (s i sent s j received = P (s j received s i sentp (s i sent P (s j received where the denominator for each j has already been computed in part (a. Performing this calculation for each pair (i, j, the desired inverse conditional probabilities can be arranged in a table similar to the one given in the problem statement: 6
7 Sent, i P (s j s i s 1 s 2 s 3 s Received, j s s Note that we have rounded all calculations to the fourth decimal place, also ensuring that the conditional distribution P (s i sent s j received sums to unity for each j = 1, 2, Let a j {s 1, s 2, s 3 } be our decision for the signal sent when we receive s j. 3 P (error = P (wrong decision s j received P (s j received j=1 = [1 P (a j sent s j received] P (s j received j = 1 j P (a j sent s j received P (s j received. To minimize P (error, we need to choose a j to maximize the sum. In other words, we need to choose a j to maximize P (a j sent s j received for every j. From part (b, a 1 = s 3, a 2 = s 2, a 3 = s 1. Problem 3.7 Evelyn has n coins in her left pocket, and n coins in her right pocket. Every minute, she takes a coin out of a pocket chosen at randomly (and independently from previous draws, until the first time one of her pockets is empty. For an integer t [1, n], compute the probability of having t coins in the other pocket when she stops. Let (i, j denote the status that Evelyn has i coins in her left pocket and j coins in the right. Initially, her pocket status is (n, n, equivalently n coins in left pocket and n coins in the right. After first draw, her pocket status is (n 1, n if a coin is taken from her left pocket, or (n, n 1 otherwise. Let N(i, j be the number of all possible draw sequences that reach (i, j from (n, n. From Problem 3.1 (a, we know ( 2n i j N(i, j = N(j, i = n i Case 1: 2 t n. One step before a pocket becomes empty at the first time, her pocket status must be (1, t or (t, 1 and she must take one coin from left or right pocket respectively. And the set of sequences reaching (1, t and the set of sequences reaching (t, 1 are disjoint, when t 2. Once the pocket status is at (0, t or (t, 0, there is only one way to get (0,0. Thus, the probability that one pocket becomes empty at the first time and the other has t 7
8 coins is equal to ( 2n 1 t ( 2n 1 t N(1, t + N(t, 1 N(0, 0 = 2 n 1 ( = 2n n n 1 ( = 2n 1 n 1 n (n 1 (n t + 1 (2n 1 (2n t Case 2: t = 1. One step before one of pockets becomes empty at the first time, her pocket status must be (1,1. There are two paths from (1,1 to (0,0. Thus, the probability is: N(1, 1 2 N(0, 0 = n 2n 1 Note: although case 2 can be included in case 1 by choosing t = 1, we should be aware of the duplicated counts happening in case 2. 8
2.6 Tools for Counting sample points
2.6 Tools for Counting sample points When the number of simple events in S is too large, manual enumeration of every sample point in S is tedious or even impossible. (Example) If S contains N equiprobable
More informationMATH 556: PROBABILITY PRIMER
MATH 6: PROBABILITY PRIMER 1 DEFINITIONS, TERMINOLOGY, NOTATION 1.1 EVENTS AND THE SAMPLE SPACE Definition 1.1 An experiment is a one-off or repeatable process or procedure for which (a there is a well-defined
More informationLecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events
Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events Discrete Structures II (Summer 2018) Rutgers University Instructor: Abhishek
More informationMath 378 Spring 2011 Assignment 4 Solutions
Math 3 Spring 2011 Assignment 4 Solutions Brualdi 6.2. The properties are P 1 : is divisible by 4. P 2 : is divisible by 6. P 3 : is divisible by. P 4 : is divisible by 10. Preparing to use inclusion-exclusion,
More informationStatistical 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 informationELEG 3143 Probability & Stochastic Process Ch. 1 Probability
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 1 Probability Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Applications Elementary Set Theory Random
More informationDiscrete 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 informationLecture 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 informationLECTURE 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 informationMAT 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 information6 Permutations Very little of this section comes from PJE.
6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action
More informationMAT 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 informationProbability and Statistics Notes
Probability and Statistics Notes Chapter One Jesse Crawford Department of Mathematics Tarleton State University (Tarleton State University) Chapter One Notes 1 / 71 Outline 1 A Sketch of Probability and
More information2. AXIOMATIC PROBABILITY
IA Probability Lent Term 2. AXIOMATIC PROBABILITY 2. The axioms The formulation for classical probability in which all outcomes or points in the sample space are equally likely is too restrictive to develop
More informationIntroduction to Probability 2017/18 Supplementary Problems
Introduction to Probability 2017/18 Supplementary Problems Problem 1: Let A and B denote two events with P(A B) 0. Show that P(A) 0 and P(B) 0. A A B implies P(A) P(A B) 0, hence P(A) 0. Similarly B A
More informationPROBABILITY.
PROBABILITY PROBABILITY(Basic Terminology) Random Experiment: If in each trial of an experiment conducted under identical conditions, the outcome is not unique, but may be any one of the possible outcomes,
More informationProbabilities and Expectations
Probabilities and Expectations Ashique Rupam Mahmood September 9, 2015 Probabilities tell us about the likelihood of an event in numbers. If an event is certain to occur, such as sunrise, probability of
More informationMATH 10B METHODS OF MATHEMATICS: CALCULUS, STATISTICS AND COMBINATORICS
MATH 10B METHODS OF MATHEMATICS: CALCULUS, STATISTICS AND COMBINATORICS Lior Pachter and Lawrence C. Evans Department of Mathematics University of California Berkeley, CA 94720 January 21, 2013 Lior Pachter
More informationLecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya Resources: Kenneth
More informationCombinatorics. But there are some standard techniques. That s what we ll be studying.
Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of
More information1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).
CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 8 Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According to clinical trials,
More informationMAT 271E Probability and Statistics
MAT 271E Probability and Statistics Spring 2011 Instructor : Class Meets : Office Hours : Textbook : Supp. Text : İlker Bayram EEB 1103 ibayram@itu.edu.tr 13.30 16.30, Wednesday EEB? 10.00 12.00, Wednesday
More informationTutorial 3: Random Processes
August 18 Semester 2018-II Tutorial 3: Random Processes Lecturer: Utpal Mukherji/ Parimal Parag Prepared by: Prathamesh Mayekar Note: LaTeX template courtesy of UC Berkeley EECS dept. 3.1 Conditional Probability
More informationMidterm 2. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:
CS70 Discrete Mathematics and Probability Theory, Fall 2018 Midterm 2 8:00-10:00pm, 31 October Your First Name: SIGN Your Name: Your Last Name: Your SID Number: Your Exam Room: Name of Person Sitting on
More informationTest One Mathematics Fall 2009
Test One Mathematics 35.2 Fall 29 TO GET FULL CREDIT YOU MUST SHOW ALL WORK! I have neither given nor received aid in the completion of this test. Signature: pts. 2 pts. 3 5 pts. 2 pts. 5 pts. 6(i) pts.
More informationSum 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 informationLecture 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 informationProblems for 2.6 and 2.7
UC Berkeley Department of Electrical Engineering and Computer Science EE 6: Probability and Random Processes Practice Problems for Midterm: SOLUTION # Fall 7 Issued: Thurs, September 7, 7 Solutions: Posted
More informationChase Joyner. 901 Homework 1. September 15, 2017
Chase Joyner 901 Homework 1 September 15, 2017 Problem 7 Suppose there are different types of coupons available when buying cereal; each box contains one coupon and the collector is seeking to collect
More informationLecture 1: An introduction to probability theory
Econ 514: Probability and Statistics Lecture 1: An introduction to probability theory Random Experiments Random experiment: Experiment/phenomenon/action/mechanism with outcome that is not (fully) predictable.
More informationP (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 informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics
More informationPRACTICE PROBLEMS FOR EXAM 1
PRACTICE PROBLEMS FOR EXAM 1 Math 3160Q Spring 01 Professor Hohn Below is a list of practice questions for Exam 1. Any quiz, homework, or example problem has a chance of being on the exam. For more practice,
More informationChapter 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 informationPRIMES Math Problem Set
PRIMES Math Problem Set PRIMES 017 Due December 1, 01 Dear PRIMES applicant: This is the PRIMES 017 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 01.
More informationBmMT 2017 Individual Round Solutions November 19, 2017
1. It s currently 6:00 on a 12 hour clock. What time will be shown on the clock 100 hours from now? Express your answer in the form hh : mm. Answer: 10:00 Solution: We note that adding any multiple of
More informationChapter 7. Inclusion-Exclusion a.k.a. The Sieve Formula
Chapter 7. Inclusion-Exclusion a.k.a. The Sieve Formula Prof. Tesler Math 184A Fall 2019 Prof. Tesler Ch. 7. Inclusion-Exclusion Math 184A / Fall 2019 1 / 25 Venn diagram and set sizes A = {1, 2, 3, 4,
More informationHW2 Solutions, for MATH441, STAT461, STAT561, due September 9th
HW2 Solutions, for MATH44, STAT46, STAT56, due September 9th. You flip a coin until you get tails. Describe the sample space. How many points are in the sample space? The sample space consists of sequences
More informationSTAT 516 Answers Homework 2 January 23, 2008 Solutions by Mark Daniel Ward PROBLEMS. = {(a 1, a 2,...) : a i < 6 for all i}
STAT 56 Answers Homework 2 January 23, 2008 Solutions by Mark Daniel Ward PROBLEMS 2. We note that E n consists of rolls that end in 6, namely, experiments of the form (a, a 2,...,a n, 6 for n and a i
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationthe time it takes until a radioactive substance undergoes a decay
1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete
More informationSection F Ratio and proportion
Section F Ratio and proportion Ratio is a way of comparing two or more groups. For example, if something is split in a ratio 3 : 5 there are three parts of the first thing to every five parts of the second
More informationExample. If 4 tickets are drawn with replacement from ,
Example. If 4 tickets are drawn with replacement from 1 2 2 4 6, what are the chances that we observe exactly two 2 s? Exactly two 2 s in a sequence of four draws can occur in many ways. For example, (
More informationCS626 Data Analysis and Simulation
CS626 Data Analysis and Simulation Instructor: Peter Kemper R 104A, phone 221-3462, email:kemper@cs.wm.edu Today: Probability Primer Quick Reference: Sheldon Ross: Introduction to Probability Models 9th
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 5 Spring 2006
Review problems UC Berkeley Department of Electrical Engineering and Computer Science EE 6: Probablity and Random Processes Solutions 5 Spring 006 Problem 5. On any given day your golf score is any integer
More informationSTAT 516: Basic Probability and its Applications
Lecture 3: Conditional Probability and Independence Prof. Michael September 29, 2015 Motivating Example Experiment ξ consists of rolling a fair die twice; A = { the first roll is 6 } amd B = { the sum
More informationProbability Problems for Group 3(Due by EOC Mar. 6)
Probability Problems for Group (Due by EO Mar. 6) Bob And arol And Ted And Alice And The Saga ontinues. Six married couples are standing in a room. a) If two people are chosen at random, find the probability
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationStatistical Theory 1
Statistical Theory 1 Set Theory and Probability Paolo Bautista September 12, 2017 Set Theory We start by defining terms in Set Theory which will be used in the following sections. Definition 1 A set is
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More information2030 LECTURES. R. Craigen. Inclusion/Exclusion and Relations
2030 LECTURES R. Craigen Inclusion/Exclusion and Relations The Principle of Inclusion-Exclusion 7 ROS enumerates the union of disjoint sets. What if sets overlap? Some 17 out of 30 students in a class
More informationSTAT 285 Fall Assignment 1 Solutions
STAT 285 Fall 2014 Assignment 1 Solutions 1. An environmental agency sets a standard of 200 ppb for the concentration of cadmium in a lake. The concentration of cadmium in one lake is measured 17 times.
More informationPROBABILITY VITTORIA SILVESTRI
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8 4. Properties of Probability measures Preface These lecture notes are for the course
More informationIntroduction to Probability, Fall 2009
Introduction to Probability, Fall 2009 Math 30530 Review questions for exam 1 solutions 1. Let A, B and C be events. Some of the following statements are always true, and some are not. For those that are
More informationMath P (A 1 ) =.5, P (A 2 ) =.6, P (A 1 A 2 ) =.9r
Math 3070 1. Treibergs σιι First Midterm Exam Name: SAMPLE January 31, 2000 (1. Compute the sample mean x and sample standard deviation s for the January mean temperatures (in F for Seattle from 1900 to
More informationUndergraduate Probability I. Class Notes for Engineering Students
Undergraduate Probability I Class Notes for Engineering Students Fall 2014 Contents I Probability Laws 1 1 Mathematical Review 2 1.1 Elementary Set Operations.................... 4 1.2 Additional Rules
More informationProblem # Number of points 1 /20 2 /20 3 /20 4 /20 5 /20 6 /20 7 /20 8 /20 Total /150
Name Student ID # Instructor: SOLUTION Sergey Kirshner STAT 516 Fall 09 Practice Midterm #1 January 31, 2010 You are not allowed to use books or notes. Non-programmable non-graphic calculators are permitted.
More informationL11.P1 Lecture 11. Quantum statistical mechanics: summary
Lecture 11 Page 1 L11.P1 Lecture 11 Quantum statistical mechanics: summary At absolute zero temperature, a physical system occupies the lowest possible energy configuration. When the temperature increases,
More informationMATH2206 Prob Stat/20.Jan Weekly Review 1-2
MATH2206 Prob Stat/20.Jan.2017 Weekly Review 1-2 This week I explained the idea behind the formula of the well-known statistic standard deviation so that it is clear now why it is a measure of dispersion
More informationName: Exam 2 Solutions. March 13, 2017
Department of Mathematics University of Notre Dame Math 00 Finite Math Spring 07 Name: Instructors: Conant/Galvin Exam Solutions March, 07 This exam is in two parts on pages and contains problems worth
More informationDiscrete Mathematics and Probability Theory Fall 2017 Ramchandran and Rao Midterm 2 Solutions
CS 70 Discrete Mathematics and Probability Theory Fall 2017 Ramchandran and Rao Midterm 2 Solutions PRINT Your Name: Oski Bear SIGN Your Name: OS K I PRINT Your Student ID: CIRCLE your exam room: Pimentel
More informationNotes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Combinatorics Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 4.1-4.6 & 6.5-6.6 of Rosen cse235@cse.unl.edu
More informationChapter 8 Sequences, Series, and Probability
Chapter 8 Sequences, Series, and Probability Overview 8.1 Sequences and Series 8.2 Arithmetic Sequences and Partial Sums 8.3 Geometric Sequences and Partial Sums 8.5 The Binomial Theorem 8.6 Counting Principles
More informationSTAT:5100 (22S:193) Statistical Inference I
STAT:5100 (22S:193) Statistical Inference I Week 3 Luke Tierney University of Iowa Fall 2015 Luke Tierney (U Iowa) STAT:5100 (22S:193) Statistical Inference I Fall 2015 1 Recap Matching problem Generalized
More informationMA 524 Final Fall 2015 Solutions
MA 54 Final Fall 05 Solutions Name: Question Points Score 0 0 3 5 4 0 5 5 6 5 7 0 8 5 Total: 60 MA 54 Solutions Final, Page of 8. Let L be a finite lattice. (a) (5 points) Show that p ( (p r)) (p ) (p
More information1 Probability Theory. 1.1 Introduction
1 Probability Theory Probability theory is used as a tool in statistics. It helps to evaluate the reliability of our conclusions about the population when we have only information about a sample. Probability
More information1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves?
1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves? This is most easily done by Prüfer codes. The number of times a vertex appears is the degree of the vertex.
More information8.1 Polynomial Threshold Functions
CS 395T Computational Learning Theory Lecture 8: September 22, 2008 Lecturer: Adam Klivans Scribe: John Wright 8.1 Polynomial Threshold Functions In the previous lecture, we proved that any function over
More informationCalifornia 5 th Grade Standards / Excel Math Correlation by Lesson Number
(Activity) L1 L2 L3 Excel Math Objective Recognizing numbers less than a million given in words or place value; recognizing addition and subtraction fact families; subtracting 2 threedigit numbers with
More informationMAT2377. 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 informationBMT 2018 Team Test Solutions March 18, 2018
. A circle with radius is inscribed in a right triangle with hypotenuse 4 as shown below. What is the area of the triangle? Note that the diagram is not to scale. 4 Answer: 9 Solution : We wish to use
More informationModule 1. Probability
Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive
More informationFebruary 2017 February 18, 2017
February 017 February 18, 017 Combinatorics 1. Kelvin the Frog is going to roll three fair ten-sided dice with faces labelled 0, 1,,..., 9. First he rolls two dice, and finds the sum of the two rolls.
More informationProbability Notes (A) , Fall 2010
Probability Notes (A) 18.310, Fall 2010 We are going to be spending around four lectures on probability theory this year. These notes cover approximately the first three lectures on it. Probability theory
More informationTopic 3: Introduction to Probability
Topic 3: Introduction to Probability 1 Contents 1. Introduction 2. Simple Definitions 3. Types of Probability 4. Theorems of Probability 5. Probabilities under conditions of statistically independent events
More information7 = 8 (Type a simplified fraction.)
Student: Date: Assignment: Exponential and Radical Equations 1. Perform the indicated computation. Write the answer in scientific notation. 3. 10 6 10. 3. 4. 3. 10 6 10 = (Use the multiplication symbol
More informationTHE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours
THE 018-019 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: hours 1 Let m be a three-digit integer with distinct digits Find all such integers
More informationSenior Math Circles November 19, 2008 Probability II
University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles November 9, 2008 Probability II Probability Counting There are many situations where
More informationECS 120 Lesson 18 Decidable Problems, the Halting Problem
ECS 120 Lesson 18 Decidable Problems, the Halting Problem Oliver Kreylos Friday, May 11th, 2001 In the last lecture, we had a look at a problem that we claimed was not solvable by an algorithm the problem
More informationMath 463/563 Homework #2 - Solutions
Math 463/563 Homework #2 - Solutions 1. How many 5-digit numbers can be formed with the integers 1, 2,..., 9 if no digit can appear exactly once? (For instance 43443 is OK, while 43413 is not allowed.)
More information1 True/False. Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao
Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao 1 True/False 1. True False When we solve a problem one way, it is not useful to try to solve it in a second
More informationTeam Solutions. November 19, qr = (m + 2)(m 2)
Team s November 19, 2017 1. Let p, q, r, and s be four distinct primes such that p + q + r + s is prime, and the numbers p 2 + qr and p 2 + qs are both perfect squares. What is the value of p + q + r +
More informationConditional Probability, Independence and Bayes Theorem Class 3, Jeremy Orloff and Jonathan Bloom
Conditional Probability, Independence and Bayes Theorem Class 3, 18.05 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of conditional probability and independence of events. 2.
More informationMath 55 Second Midterm Exam, Prof. Srivastava April 5, 2016, 3:40pm 5:00pm, F295 Haas Auditorium.
Math 55 Second Midterm Exam, Prof Srivastava April 5, 2016, 3:40pm 5:00pm, F295 Haas Auditorium Name: SID: Instructions: Write all answers in the provided space Please write carefully and clearly, in complete
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 16. Random Variables: Distribution and Expectation
CS 70 Discrete Mathematics and Probability Theory Spring 206 Rao and Walrand Note 6 Random Variables: Distribution and Expectation Example: Coin Flips Recall our setup of a probabilistic experiment as
More informationProbability Experiments, Trials, Outcomes, Sample Spaces Example 1 Example 2
Probability Probability is the study of uncertain events or outcomes. Games of chance that involve rolling dice or dealing cards are one obvious area of application. However, probability models underlie
More informationUC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes
UC Berkeley Department of Electrical Engineering and Computer Sciences EECS 26: Probability and Random Processes Problem Set Spring 209 Self-Graded Scores Due:.59 PM, Monday, February 4, 209 Submit your
More informationWith Question/Answer Animations. Chapter 7
With Question/Answer Animations Chapter 7 Chapter Summary Introduction to Discrete Probability Probability Theory Bayes Theorem Section 7.1 Section Summary Finite Probability Probabilities of Complements
More informationSUMS PROBLEM COMPETITION, 2000
SUMS ROBLEM COMETITION, 2000 SOLUTIONS 1 The result is well known, and called Morley s Theorem Many proofs are known See for example HSM Coxeter, Introduction to Geometry, page 23 2 If the number of vertices,
More informationMath/Stat 394 Homework 5
Math/Stat 394 Homework 5 1. If we select two black balls then X 4. This happens with probability ( 4 2). If we select two white balls then X 2. This happens with ( 14 probability (8 2). If we select two
More informationChapter Learning Objectives. Random Experiments Dfiii Definition: Dfiii Definition:
Chapter 2: Probability 2-1 Sample Spaces & Events 2-1.1 Random Experiments 2-1.2 Sample Spaces 2-1.3 Events 2-1 1.4 Counting Techniques 2-2 Interpretations & Axioms of Probability 2-3 Addition Rules 2-4
More informationRandomized 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 informationHomework every week. Keep up to date or you risk falling behind. Quizzes and Final exam are based on homework questions.
Week 1 Fall 2016 1 of 25 CISC-102 Fall 2016 Week 1 David Rappaport daver@cs.queensu.ca Goodwin G-532 Office Hours: Monday 1:00-3:00 (or by appointment) Homework Homework every week. Keep up to date or
More informationMidterm Exam 1 Solution
EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2015 Kannan Ramchandran September 22, 2015 Midterm Exam 1 Solution Last name First name SID Name of student on your left:
More information2 Exercises 1. The following represent graphs of functions from the real numbers R to R. Decide which are one-to-one, which are onto, which are neithe
Infinity and Counting 1 Peter Trapa September 28, 2005 There are 10 kinds of people in the world: those who understand binary, and those who don't. Welcome to the rst installment of the 2005 Utah Math
More informationCISC-102 Fall 2017 Week 1 David Rappaport Goodwin G-532 Office Hours: Tuesday 1:30-3:30
Week 1 Fall 2017 1 of 42 CISC-102 Fall 2017 Week 1 David Rappaport daver@cs.queensu.ca Goodwin G-532 Office Hours: Tuesday 1:30-3:30 Homework Homework every week. Keep up to date or you risk falling behind.
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More information1 Combinatorial Analysis
ECE316 Notes-Winter 217: A. K. Khandani 1 1 Combinatorial Analysis 1.1 Introduction This chapter deals with finding effective methods for counting the number of ways that things can occur. In fact, many
More informationProbabilistic 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 informationSolving Equations. A: Solving One-Variable Equations. One Step x + 6 = 9-3y = 15. Two Step 2a 3 6. Algebra 2 Chapter 1 Notes 1.4 Solving Equations
Algebra 2 Chapter 1 Notes 1.4 Solving Equations 1.4 Solving Equations Topics: Solving Equations Translating Words into Algebra Solving Word Problems A: Solving One-Variable Equations The equations below
More information