Math 463/563 Homework #2 - Solutions

Size: px
Start display at page:

Download "Math 463/563 Homework #2 - Solutions"

Transcription

1 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 is OK, while is not allowed.) There could be no more than two different digits in the number. First count the numbers formed out of exactly one digit, such as There are 9 of them. Next count the numbers made of two digits, call them digit a and digit b, where a appears twice, and b appears three times in a number (for example abbab). There are 9 8 = 72 choices for a and b, and 5! = 10 ways to arrange two a and three b in 2!3! a string of five digits. Thus the answer is = We shuffle a deck of six cards 1, 2, 3, 4, 5, and 6 so that each of the 6! possible configurations (orderings) has equal probability of 1. Let A be the event that card 1 6! is among the top three cards in the deck, and let B be the event that card 5 ends up being second from the top. Find the probability of the event A B. First, we compute P (A B). There is only one way to place card 5 : it will take the second spot from the top. There are 2 spots left for card 1 : it can be placed either first or third. There are 4! ways to arrange the rest of the cards. Thus A B = 2 4! = 48 and P (A B) = 48 = 1. 6! 15 Trivially, P (A) = 1, and P (B) = 1. Thus, by the inclusion-exclusion theorem, 2 6 P (A B) = P (A) + P (B) P (A B) = = 9 15 = Simplify (E F ) (E F ), and (E F ) (E F ) (E F ) (E F ) (E F ) = ( E (E F ) ) ( F (E F ) ) = E (E F ) (F E) (F F ) = E and therefore (E F ) (E F ) (E F ) = F (E F ) = (F E) (F F ) = E F 4. Consider events E, F,and G. Find the expressions in E, F and G for the following events. (a) At least one of the three events occurs. (b) At most one of the three events occurs.

2 (c) Exactly two of them occur. (d) At most two of the three events occur. (e) All three events occur. (f) None of the three events occurs. (g) At most three of the events occur. (h) E or F, but not G occur. (i) Both E and F, but not G occur. (j) Exactly one of the three events occurs. Example: The event that only G occurs is expressed as E F G. (a) E F G (b) (E F G) (E F G) (E F G) (E F G) (c) (E F G) (E F G) (E F G) (d) E F G = E F G (e) E F G (f) E F G = E F G (g) S (h) (E F ) G (i) E F G (j) (E F G) (E F G) (E F G) 5. Prove that P (E F G) = P (E)+P (F )+P (G) P (E F G) P (E F G) P (E F G) 2P (E F G) The inclusion-exclusion rule implies P (E F G) = P (E)+P (F )+P (G) P (E F ) P (E G) P (F G)+P (E F G), where, after plugging in P (E F ) = P (E F G) + P (E F G), P (E G) = P (E F G) + P (E F G)

3 and P (F G) = P (E F G) + P (E F G) we obtain the desired equation P (E F G) = P (E)+P (F )+P (G) P (E F G) P (E F G) P (E F G) 2P (E F G) 6. Prove that P (E F G) = 1 P (E) P (F ) P (G)+P (E F )+P (E G)+P (F G) P (E F G) The de Morgan s law implies E F G = E F G and therefore P (E F G) = 1 P (E F G), where P (E F G) = P (E)+P (F )+P (G) P (E F ) P (E G) P (F G)+P (E F G) by the inclusion-exclusion formula. Thus, plugging in, we obtain the desired equation P (E F G) = 1 P (E) P (F ) P (G)+P (E F )+P (E G)+P (F G) P (E F G) 7. Given events E, F and G, such that P (F ) > P (F G) > 0. Prove directly that P (E F ) = P (E F G) P (G F ) + P (E F G) P (G F ) P (E F ) P (F ) = P (E F G) P (E F G) + P (F ) P (F ) = P (E F G) (F G) P + P (F G) P (F ) P (E F G) P (F G) P (F G) P (F )

4 8. Use induction to generalize Bonferroni s inequality to n events: P (E 1 E 2... E n ) P (E 1 ) + P (E 2 ) + + P (E n ) (n 1) We know this is true for n = 2: P (E 1 E 2 ) P (E 1 ) + P (E 2 ) 1 For n 2, suppose we established the Bonferroni s inequality for any n events: P (E 1 E 2... E n ) P (E 1 ) + P (E 2 ) + + P (E n ) (n 1) We need to prove the inequality for any n + 1 events: P (E 1 E 2... E n E n+1 ) P (E 1 ) + P (E 2 ) + + P (E n ) + P (E n+1 ) n We use the Bonferroni s inequality for any n events, E 1, E 2,..., E n 1 and E n E n+1, to get P (E 1 E 2... E n 1 (E n E n+1 )) P (E 1 )+P (E 2 )+ +P (E n 1 )+P (E n E n+1 ) (n 1), where P (E n E n+1 ) P (E n ) + P (E n+1 ) 1, and therefore P (E 1 E 2... E n E n+1 ) P (E 1 )+P (E 2 )+ +P (E n 1 )+P (E n )+P (E n+1 ) 1 (n 1) 9. Show that the probability that exactly one of the two events, E or F, occurs is P (E) + P (F ) 2P (E F ) (E F ) (E F ) is the event that exactly one of the two occurs. The inclusion-exclusion formula implies P ( (E F ) (E F ) ) = P (E F ) + P (E F ) = P (E) + P (F ) 2P (E F ) as and P (E F ) = P (E) P (E F ) P (E F ) = P (F ) P (E F )

5 10. Prove that if E 1, E 2,..., E n are independent events, then n ( P (E 1 E 2... E n ) = 1 1 P (Ei ) ) P (E 1 E 2... E n ) = 1 P ((E 1 E 2 E n ) c ) = 1 P (E 1 E 2... E n ) by De Morgan s law. Hence, by independence, P (E 1 E 2 E n ) = 1 P (E 1 E 2... E n ) = 1 n P (E i ) = 1 n (1 P (E i )) 11. An urn contains n green and m black marbles of the same size, shape, and weight. The marbles are drawn from the urn at random one at a time so that no preference is given to one marble over others, until only those of the same color are left. Show that with probability n n+m they are all green. The outcome of the experiment will not change if you pull all but one last marble from the urn, and then check its color. Now, removing n + m 1 marbles from the urn, and checking the color of the last marble is no different from selecting one marble and checking its color. Both are equivalent to separating marbles into two groups, one of size one, and the other of size n + m 1. Thus the marble is green with probability n. n+m

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 2. (a) (b) (c) (d) (e) (a) (b) (c) (d) (e) 4. (a) (b) (c) (d) (e)...

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 2. (a) (b) (c) (d) (e) (a) (b) (c) (d) (e) 4. (a) (b) (c) (d) (e)... Math 020, Exam II October, 206 The Honor Code is in effect for this examination. All work is to be your own. You may use a calculator. The exam lasts for hour 5 minutes. Be sure that your name is on every

More information

Basic Combinatorics. Math 40210, Section 01 Fall Homework 8 Solutions

Basic Combinatorics. Math 40210, Section 01 Fall Homework 8 Solutions Basic Combinatorics Math 4010, Section 01 Fall 01 Homework 8 Solutions 1.8.1 1: K n has ( n edges, each one of which can be given one of two colors; so Kn has (n -edge-colorings. 1.8.1 3: Let χ : E(K k

More information

Axioms of Probability. Set Theory. M. Bremer. Math Spring 2018

Axioms of Probability. Set Theory. M. Bremer. Math Spring 2018 Math 163 - pring 2018 Axioms of Probability Definition: The set of all possible outcomes of an experiment is called the sample space. The possible outcomes themselves are called elementary events. Any

More information

Review Counting Principles Theorems Examples. John Venn. Arthur Berg Counting Rules 2/ 21

Review Counting Principles Theorems Examples. John Venn. Arthur Berg Counting Rules 2/ 21 Counting Rules John Venn Arthur Berg Counting Rules 2/ 21 Augustus De Morgan Arthur Berg Counting Rules 3/ 21 Algebraic Laws Let S be a sample space and A, B, C be three events in S. Commutative Laws:

More information

HW2 Solutions, for MATH441, STAT461, STAT561, due September 9th

HW2 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 information

Stat330 - Solution to Homework 2. 1 Kolmogorov. (c) For any two events A, B Ω, P (A B) = P (A) P (B). Because. and

Stat330 - Solution to Homework 2. 1 Kolmogorov. (c) For any two events A, B Ω, P (A B) = P (A) P (B). Because. and Stat330 - Solution to Homework 2 1 Kolmogorov (a For any two evens, B Ω, Because and P ( B = P ( P ( B. = ( B ( B, ( B ( B =, axiom iii implies that P ( = P ( B + P ( B. The statement follows from subtraction.

More information

Problem # Number of points 1 /20 2 /20 3 /20 4 /20 5 /20 6 /20 7 /20 8 /20 Total /150

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

STAT 516 Answers Homework 2 January 23, 2008 Solutions by Mark Daniel Ward PROBLEMS. = {(a 1, a 2,...) : a i < 6 for all i}

STAT 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 information

PRACTICE PROBLEMS FOR EXAM 1

PRACTICE 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 information

Module 1. Probability

Module 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 information

Lecture 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 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 information

MATH 556: PROBABILITY PRIMER

MATH 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 information

PROBABILITY VITTORIA SILVESTRI

PROBABILITY 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 information

Slide 1 Math 1520, Lecture 21

Slide 1 Math 1520, Lecture 21 Slide 1 Math 1520, Lecture 21 This lecture is concerned with a posteriori probability, which is the probability that a previous event had occurred given the outcome of a later event. Slide 2 Conditional

More information

CHAPTER - 16 PROBABILITY Random Experiment : If an experiment has more than one possible out come and it is not possible to predict the outcome in advance then experiment is called random experiment. Sample

More information

Example. What is the sample space for flipping a fair coin? Rolling a 6-sided die? Find the event E where E = {x x has exactly one head}

Example. What is the sample space for flipping a fair coin? Rolling a 6-sided die? Find the event E where E = {x x has exactly one head} Chapter 7 Notes 1 (c) Epstein, 2013 CHAPTER 7: PROBABILITY 7.1: Experiments, Sample Spaces and Events Chapter 7 Notes 2 (c) Epstein, 2013 What is the sample space for flipping a fair coin three times?

More information

Math , Fall 2012: HW 5 Solutions

Math , Fall 2012: HW 5 Solutions Math 230.0, Fall 202: HW 5 Solutions Due Thursday, October 4th, 202. Problem (p.58 #2). Let X and Y be the numbers obtained in two draws at random from a box containing four tickets labeled, 2, 3, 4. Display

More information

Discrete Probability

Discrete Probability Discrete Probability Counting Permutations Combinations r- Combinations r- Combinations with repetition Allowed Pascal s Formula Binomial Theorem Conditional Probability Baye s Formula Independent Events

More information

Exam 2 Solutions. x 1 x. x 4 The generating function for the problem is the fourth power of this, (1 x). 4

Exam 2 Solutions. x 1 x. x 4 The generating function for the problem is the fourth power of this, (1 x). 4 Math 5366 Fall 015 Exam Solutions 1. (0 points) Find the appropriate generating function (in closed form) for each of the following problems. Do not find the coefficient of x n. (a) In how many ways can

More information

Introduction to Probability, Fall 2009

Introduction 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 information

Senior Math Circles March 3, 2010 Counting Techniques and Probability II

Senior Math Circles March 3, 2010 Counting Techniques and Probability II 1 University of Waterloo Faculty of Mathematics Senior Math Circles March 3, 2010 Counting Techniques and Probability II Centre for Education in Mathematics and Computing Counting Rules Multiplication

More information

MATH 243E Test #3 Solutions

MATH 243E Test #3 Solutions MATH 4E Test # Solutions () Find a recurrence relation for the number of bit strings of length n that contain a pair of consecutive 0s. You do not need to solve this recurrence relation. (Hint: Consider

More information

UNC Charlotte 2010 Algebra with solutions March 8, 2010

UNC Charlotte 2010 Algebra with solutions March 8, 2010 with solutions March 8, 2010 1. Let y = mx + b be the image when the line x 3y + 11 = 0 is reflected across the x-axis. The value of m + b is: (A) 6 (B) 5 (C) 4 (D) 3 (E) 2 Solution: C. The slope of the

More information

Discussion 01. b) What is the probability that the letter selected is a vowel?

Discussion 01. b) What is the probability that the letter selected is a vowel? STAT 400 Discussion 01 Spring 2018 1. Consider the following experiment: A letter is chosen at random from the word STATISTICS. a) List all possible outcomes and their probabilities. b) What is the probability

More information

Total. Name: Student ID: CSE 21A. Midterm #2. February 28, 2013

Total. Name: Student ID: CSE 21A. Midterm #2. February 28, 2013 Name: Student ID: CSE 21A Midterm #2 February 28, 2013 There are 6 problems. The number of points a problem is worth is shown next to the problem. Show your work (even on multiple choice questions)! Also,

More information

Independence 1 2 P(H) = 1 4. On the other hand = P(F ) =

Independence 1 2 P(H) = 1 4. On the other hand = P(F ) = Independence Previously we considered the following experiment: A card is drawn at random from a standard deck of cards. Let H be the event that a heart is drawn, let R be the event that a red card is

More information

CSCI 150 Discrete Mathematics Homework 5 Solution

CSCI 150 Discrete Mathematics Homework 5 Solution CSCI 150 Discrete Mathematics Homework 5 Solution Saad Mneimneh Computer Science Hunter College of CUNY Problem 1: Happy Birthday (if it applies to you)! Based on the size of the class, there is approximately

More information

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting

Discrete 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 information

Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya

Lecture 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 information

Chapter. Probability

Chapter. Probability Chapter 3 Probability Section 3.1 Basic Concepts of Probability Section 3.1 Objectives Identify the sample space of a probability experiment Identify simple events Use the Fundamental Counting Principle

More information

Year 10 Mathematics Probability Practice Test 1

Year 10 Mathematics Probability Practice Test 1 Year 10 Mathematics Probability Practice Test 1 1 A letter is chosen randomly from the word TELEVISION. a How many letters are there in the word TELEVISION? b Find the probability that the letter is: i

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

Elementary Discrete Probability

Elementary Discrete Probability Elementary Discrete Probability MATH 472 Financial Mathematics J Robert Buchanan 2018 Objectives In this lesson we will learn: the terminology of elementary probability, elementary rules of probability,

More information

Unit Combinatorics State pigeonhole principle. If k pigeons are assigned to n pigeonholes and n < k then there is at least one pigeonhole containing more than one pigeons. Find the recurrence relation

More information

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set

More information

Combinatorics. But there are some standard techniques. That s what we ll be studying.

Combinatorics. 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 information

Intermediate Math Circles November 8, 2017 Probability II

Intermediate Math Circles November 8, 2017 Probability II Intersection of Events and Independence Consider two groups of pairs of events Intermediate Math Circles November 8, 017 Probability II Group 1 (Dependent Events) A = {a sales associate has training} B

More information

7.5: Conditional Probability and Independent Events

7.5: Conditional Probability and Independent Events c Dr Oksana Shatalov, Spring 2012 1 7.5: Conditional Probability and Independent Events EXAMPLE 1. Two cards are drawn from a deck of 52 without replacement. (a) What is the probability of that the first

More information

MATH c UNIVERSITY OF LEEDS Examination for the Module MATH2210 (May/June 2004) INTRODUCTION TO DISCRETE MATHEMATICS. Time allowed : 2 hours

MATH c UNIVERSITY OF LEEDS Examination for the Module MATH2210 (May/June 2004) INTRODUCTION TO DISCRETE MATHEMATICS. Time allowed : 2 hours This question paper consists of 5 printed pages, each of which is identified by the reference MATH221001 MATH221001 No calculators allowed c UNIVERSITY OF LEEDS Examination for the Module MATH2210 (May/June

More information

Definition (The carefully thought-out calculus version based on limits).

Definition (The carefully thought-out calculus version based on limits). 4.1. Continuity and Graphs Definition 4.1.1 (Intuitive idea used in algebra based on graphing). A function, f, is continuous on the interval (a, b) if the graph of y = f(x) can be drawn over the interval

More information

CS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A

CS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic

More information

Chapter 7: Section 7-1 Probability Theory and Counting Principles

Chapter 7: Section 7-1 Probability Theory and Counting Principles Chapter 7: Section 7-1 Probability Theory and Counting Principles D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 7: Section 7-1 Probability Theory and

More information

TOPIC 12 PROBABILITY SCHEMATIC DIAGRAM

TOPIC 12 PROBABILITY SCHEMATIC DIAGRAM TOPIC 12 PROBABILITY SCHEMATIC DIAGRAM Topic Concepts Degree of Importance References NCERT Book Vol. II Probability (i) Conditional Probability *** Article 1.2 and 1.2.1 Solved Examples 1 to 6 Q. Nos

More information

Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin,

Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin, Chapter 8 Exercises Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin, morin@physics.harvard.edu 8.1 Chapter 1 Section 1.2: Permutations 1. Assigning seats *

More information

The Geometric Distribution

The Geometric Distribution MATH 382 The Geometric Distribution Dr. Neal, WKU Suppose we have a fixed probability p of having a success on any single attempt, where p > 0. We continue to make independent attempts until we succeed.

More information

Each trial has only two possible outcomes success and failure. The possible outcomes are exactly the same for each trial.

Each trial has only two possible outcomes success and failure. The possible outcomes are exactly the same for each trial. Section 8.6: Bernoulli Experiments and Binomial Distribution We have already learned how to solve problems such as if a person randomly guesses the answers to 10 multiple choice questions, what is the

More information

CLASS XI Maths : Sample Paper-1

CLASS XI Maths : Sample Paper-1 CLASS XI Maths : Sample Paper-1 Allotted Time : 3 Hrs Max. Marks : 100 Instructions 1. This questionnaire consists of 30 questions divided in four sections. Please verify before attempt. 2. Section I consists

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

1. Solve the following system of equations. 5x + y = 2z 13 3x + 3z = y 4y 2z = 2x + 12

1. Solve the following system of equations. 5x + y = 2z 13 3x + 3z = y 4y 2z = 2x + 12 Math 166 Final Exam Review Note: This review does not cover every concept that could be tested on a final. Please also take a look at previous Week in Reviews for more practice problems. Every instructor

More information

UNIVERSITY OF NORTH CAROLINA CHARLOTTE 1996 HIGH SCHOOL MATHEMATICS CONTEST March 4, f(x, y) = (max(x, y)) min(x,y)

UNIVERSITY OF NORTH CAROLINA CHARLOTTE 1996 HIGH SCHOOL MATHEMATICS CONTEST March 4, f(x, y) = (max(x, y)) min(x,y) UNIVERSITY OF NORTH CAROLINA CHARLOTTE 1996 HIGH SCHOOL MATHEMATICS CONTEST March 4, 1996 1. If and then f(x, y) (max(x, y)) min(x,y) g(x, y) max(x, y) min(x, y), f(g( 1, 3 ), g( 4, 1.75)) (A) 0.5 (B)

More information

1 True/False. Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao

1 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 information

Math P (A 1 ) =.5, P (A 2 ) =.6, P (A 1 A 2 ) =.9r

Math 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 information

4. Probability of an event A for equally likely outcomes:

4. Probability of an event A for equally likely outcomes: University of California, Los Angeles Department of Statistics Statistics 110A Instructor: Nicolas Christou Probability Probability: A measure of the chance that something will occur. 1. Random experiment:

More information

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours

THE 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 information

Lecture 1: An introduction to probability theory

Lecture 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 information

Axioms of Probability

Axioms of Probability Sample Space (denoted by S) The set of all possible outcomes of a random experiment is called the Sample Space of the experiment, and is denoted by S. Example 1.10 If the experiment consists of tossing

More information

1 Combinatorial Analysis

1 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 information

Counting Methods. CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo

Counting Methods. CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo Counting Methods CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 48 Need for Counting The problem of counting

More information

Properties of Probability

Properties of Probability Econ 325 Notes on Probability 1 By Hiro Kasahara Properties of Probability In statistics, we consider random experiments, experiments for which the outcome is random, i.e., cannot be predicted with certainty.

More information

Some Review Problems for Exam 3: Solutions

Some Review Problems for Exam 3: Solutions Math 3355 Spring 017 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want

More information

Math 378 Spring 2011 Assignment 4 Solutions

Math 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 information

Counting. Spock's dilemma (Walls and mirrors) call it C(n,k) Rosen, Chapter 5.1, 5.2, 5.3 Walls and Mirrors, Chapter 3 10/11/12

Counting. Spock's dilemma (Walls and mirrors) call it C(n,k) Rosen, Chapter 5.1, 5.2, 5.3 Walls and Mirrors, Chapter 3 10/11/12 Counting Rosen, Chapter 5.1, 5.2, 5.3 Walls and Mirrors, Chapter 3 Spock's dilemma (Walls and mirrors) n n planets in the solar system n can only visit k

More information

Independence. P(A) = P(B) = 3 6 = 1 2, and P(C) = 4 6 = 2 3.

Independence. P(A) = P(B) = 3 6 = 1 2, and P(C) = 4 6 = 2 3. Example: A fair die is tossed and we want to guess the outcome. The outcomes will be 1, 2, 3, 4, 5, 6 with equal probability 1 6 each. If we are interested in getting the following results: A = {1, 3,

More information

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch Monty Hall Puzzle Example: You are asked to select one of the three doors to open. There is a large prize behind one of the doors and if you select that door, you win the prize. After you select a door,

More information

Econ 325: Introduction to Empirical Economics

Econ 325: Introduction to Empirical Economics Econ 325: Introduction to Empirical Economics Lecture 2 Probability Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall Ch. 3-1 3.1 Definition Random Experiment a process leading to an uncertain

More information

Name: Exam 2 Solutions. March 13, 2017

Name: 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 information

PROBABILITY. Contents Preface 1 1. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8. Preface

PROBABILITY. Contents Preface 1 1. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8. Preface PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction. Combinatorial analysis 5 3. Stirling s formula 8 Preface These lecture notes are for the course Probability IA, given in Lent 09 at the University

More information

Introduction to Induction (LAMC, 10/14/07)

Introduction to Induction (LAMC, 10/14/07) Introduction to Induction (LAMC, 10/14/07) Olga Radko October 1, 007 1 Definitions The Method of Mathematical Induction (MMI) is usually stated as one of the axioms of the natural numbers (so-called Peano

More information

Applied Mathematics 12 Selected Solutions Chapter 1

Applied Mathematics 12 Selected Solutions Chapter 1 TLE OF ONTENTS H ELP pplied Mathematics Selected Solutions hapter Tutorial : Experimental and Theoretical Probability Exercises, page 0 hecking Y our Skills The simulation of the 00 trials of each experiment

More information

Binomial Probability. Permutations and Combinations. Review. History Note. Discuss Quizzes/Answer Questions. 9.0 Lesson Plan

Binomial Probability. Permutations and Combinations. Review. History Note. Discuss Quizzes/Answer Questions. 9.0 Lesson Plan 9.0 Lesson Plan Discuss Quizzes/Answer Questions History Note Review Permutations and Combinations Binomial Probability 1 9.1 History Note Pascal and Fermat laid out the basic rules of probability in a

More information

1. Determine whether each of the following stochastic matrices is a transition matrix for a Markov process that is regular, absorbing, or neither.

1. Determine whether each of the following stochastic matrices is a transition matrix for a Markov process that is regular, absorbing, or neither. Math 166 Final Exam Review Note: This review does not cover every concept that could be tested on a final. Please also take a look at previous Week in Reviews for more practice problems. Every instructor

More information

Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5 th Edition) by Kenneth H. Rosen

Slides for a Course Based on the Text Discrete Mathematics & Its Applications (5 th Edition) by Kenneth H. Rosen University of Florida Dept. of Computer & Information Science & Engineering COT 3100 Applications of Discrete Structures Dr. Michael P. Frank Slides for a Course Based on the Text Discrete Mathematics

More information

Solution: There are 30 choices for the first person to leave, 29 for the second, etc. Thus this exodus can occur in. = P (30, 8) ways.

Solution: There are 30 choices for the first person to leave, 29 for the second, etc. Thus this exodus can occur in. = P (30, 8) ways. Math-2320 Assignment 7 Solutions Problem 1: (Section 7.1 Exercise 4) There are 30 people in a class learning about permutations. One after another, eight people gradually slip out the back door. In how

More information

Math.3336: Discrete Mathematics. Combinatorics: Basics of Counting

Math.3336: Discrete Mathematics. Combinatorics: Basics of Counting Math.3336: Discrete Mathematics Combinatorics: Basics of Counting Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu

More information

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu Home Work: 1 1. Describe the sample space when a coin is tossed (a) once, (b) three times, (c) n times, (d) an infinite number of times. 2. A coin is tossed until for the first time the same result appear

More information

MULTIPLE CHOICE QUESTIONS SUBJECT : MATHEMATICS Duration : Two Hours Maximum Marks : 100. [ Q. 1 to 60 carry one mark each ] A. 0 B. 1 C. 2 D.

MULTIPLE CHOICE QUESTIONS SUBJECT : MATHEMATICS Duration : Two Hours Maximum Marks : 100. [ Q. 1 to 60 carry one mark each ] A. 0 B. 1 C. 2 D. M 68 MULTIPLE CHOICE QUESTIONS SUBJECT : MATHEMATICS Duration : Two Hours Maimum Marks : [ Q. to 6 carry one mark each ]. If sin sin sin y z, then the value of 9 y 9 z 9 9 y 9 z 9 A. B. C. D. is equal

More information

Total score: /100 points

Total score: /100 points Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 710 (Tarnoff) Discrete Structures TEST for Spring Semester,

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 3: Solutions Fall 2007

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 3: Solutions Fall 2007 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

More information

2. Counting and Probability

2. Counting and Probability 2. Counting and Probability 2.1.1 Factorials 2.1.2 Combinatorics 2.2.1 Probability Theory 2.2.2 Probability Examples 2.1.1 Factorials Combinatorics Combinatorics is the mathematics of counting. It can

More information

P (second card 7 first card King) = P (second card 7) = %.

P (second card 7 first card King) = P (second card 7) = %. Example 1. A card is dealt from the top of a well-shu ed deck, then it is replaced, the deck is reshu ed and another card is dealt. What is the probability that the second card is a 7 given that the first

More information

Notes for Math 324, Part 12

Notes for Math 324, Part 12 72 Notes for Math 324, Part 12 Chapter 12 Definition and main properties of probability 12.1 Sample space, events We run an experiment which can have several outcomes. The set consisting by all possible

More information

Exercise Exercise Homework #6 Solutions Thursday 6 April 2006

Exercise Exercise Homework #6 Solutions Thursday 6 April 2006 Unless otherwise stated, for the remainder of the solutions, define F m = σy 0,..., Y m We will show EY m = EY 0 using induction. m = 0 is obviously true. For base case m = : EY = EEY Y 0 = EY 0. Now assume

More information

3. A square has 4 sides, so S = 4. A pentagon has 5 vertices, so P = 5. Hence, S + P = 9. = = 5 3.

3. A square has 4 sides, so S = 4. A pentagon has 5 vertices, so P = 5. Hence, S + P = 9. = = 5 3. JHMMC 01 Grade Solutions October 1, 01 1. By counting, there are 7 words in this question.. (, 1, ) = 1 + 1 + = 9 + 1 + =.. A square has sides, so S =. A pentagon has vertices, so P =. Hence, S + P = 9..

More information

Homework 7 Solutions, Math 55

Homework 7 Solutions, Math 55 Homework 7 Solutions, Math 55 5..36. (a) Since a is a positive integer, a = a 1 + b 0 is a positive integer of the form as + bt for some integers s and t, so a S. Thus S is nonempty. (b) Since S is nonempty,

More information

Chapter 2 PROBABILITY SAMPLE SPACE

Chapter 2 PROBABILITY SAMPLE SPACE Chapter 2 PROBABILITY Key words: Sample space, sample point, tree diagram, events, complement, union and intersection of an event, mutually exclusive events; Counting techniques: multiplication rule, permutation,

More information

Example. If 4 tickets are drawn with replacement from ,

Example. 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 information

Mathematical Problem Solving TEAM A-11/12/2010

Mathematical Problem Solving TEAM A-11/12/2010 Mathematical Problem Solving TEAM A-/2/200 Tramaine Find all integer solutions to x 2 + y 2 + z 2 = 2xyz. Solution. We see there is no solution other than x = y = z = 0. In fact, assume x, y, z are integers,

More information

Chapter 8 Sequences, Series, and Probability

Chapter 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 information

2 BAMO 2015 Problems and Solutions February 26, 2015

2 BAMO 2015 Problems and Solutions February 26, 2015 17TH AY AREA MATHEMATIAL OLYMPIAD PROLEMS AND SOLUTIONS A: There are 7 boxes arranged in a row and numbered 1 through 7. You have a stack of 2015 cards, which you place one by one in the boxes. The first

More information

we need to describe how many cookies the first person gets. There are 6 choices (0, 1,... 5). So the answer is 6.

we need to describe how many cookies the first person gets. There are 6 choices (0, 1,... 5). So the answer is 6. () (a) How many ways are there to divide 5 different cakes and 5 identical cookies between people so that the first person gets exactly cakes. (b) How many ways are there to divide 5 different cakes and

More information

Lesson One Hundred and Sixty-One Normal Distribution for some Resolution

Lesson One Hundred and Sixty-One Normal Distribution for some Resolution STUDENT MANUAL ALGEBRA II / LESSON 161 Lesson One Hundred and Sixty-One Normal Distribution for some Resolution Today we re going to continue looking at data sets and how they can be represented in different

More information

Notes Week 2 Chapter 3 Probability WEEK 2 page 1

Notes Week 2 Chapter 3 Probability WEEK 2 page 1 Notes Week 2 Chapter 3 Probability WEEK 2 page 1 The sample space of an experiment, sometimes denoted S or in probability theory, is the set that consists of all possible elementary outcomes of that experiment

More information

Mathathon Round 1 (2 points each)

Mathathon Round 1 (2 points each) Mathathon Round ( points each). A circle is inscribed inside a square such that the cube of the radius of the circle is numerically equal to the perimeter of the square. What is the area of the circle?

More information

Exam III Review Math-132 (Sections 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3)

Exam III Review Math-132 (Sections 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3) 1 Exam III Review Math-132 (Sections 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3) On this exam, questions may come from any of the following topic areas: - Union and intersection of sets - Complement of

More information

USA Mathematical Talent Search Round 4 Solutions Year 20 Academic Year

USA Mathematical Talent Search Round 4 Solutions Year 20 Academic Year 1/4/20. Consider a sequence {a n } with a 1 = 2 and a n = a2 n 1 a n 2 for all n 3. If we know that a 2 and a 5 are positive integers and a 5 2009, then what are the possible values of a 5? Since a 1 and

More information

Adding and Subtracting Polynomials

Adding and Subtracting Polynomials 7.2 Adding and Subtracting Polynomials subtract polynomials? How can you add polynomials? How can you 1 EXAMPLE: Adding Polynomials Using Algebra Tiles Work with a partner. Six different algebra tiles

More information

MATH 10B METHODS OF MATHEMATICS: CALCULUS, STATISTICS AND COMBINATORICS

MATH 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 information

Statistics for Engineers

Statistics for Engineers Statistics for Engineers Antony Lewis http://cosmologist.info/teaching/stat/ Starter question Have you previously done any statistics? 1. Yes 2. No 54% 46% 1 2 BOOKS Chatfield C, 1989. Statistics for

More information

(2) Generalize De Morgan s laws for n sets and prove the laws by induction. 1

(2) Generalize De Morgan s laws for n sets and prove the laws by induction. 1 ARS DIGITA UNIVERSITY MONTH 2: DISCRETE MATHEMATICS PROFESSOR SHAI SIMONSON PROBLEM SET 2 SOLUTIONS SET, FUNCTIONS, BIG-O, RATES OF GROWTH (1) Prove by formal logic: (a) The complement of the union of

More information

Math is Cool Championships

Math is Cool Championships Individual Contest Express all answers as reduced fractions unless stated otherwise. Leave answers in terms of π where applicable. Do not round any answers unless stated otherwise. Record all answers on

More information