1. 1. (with replacement) 2. (without replacement)
|
|
- Ophelia Riley
- 7 years ago
- Views:
Transcription
1 Chapter 2: Problems Some notation: N denotes the set of natural numbers, i.e., the set of positive integers. Z denotes the set of all integers. Z + denotes the set of all nonnegative integers (with replacement) Ω = {(r, r), (r, b), (r, g), (g, r), (g, b), (g, g), (b, r), (b, g), (b, b)} = {r, g, b} 2 2. (without replacement) Ω = {(r, b), (r, g), (g, r), (g, b), (b, r), (b, g)} 2. Ω = {(n, x 1,..., x n 1 ) n N and for k = 1, 2,..., n 1, x k {1, 2, 3, 4, 5}} {(x 1, x 2,...) x k {1, 2, 3, 4, 5} for k = 1, 2,...} The interpretation of an element of the form (n, x 1,..., x n 1 ) is that the first 6 appeared on roll n and roll k had outcome x k for k = 1,..., n 1, and the interpretation of an element of the form (x 1, x 2,...) is that a 6 never appears. We are using a notational convention here: if n = 1 or n = 2, i.e., if n 1 1, (n, x 1,..., x n 1 ) cannot be taken literally. If n = 1, the only element is (1); if n = 2, the elements have the form (2, x 1 ), where x 1 {1, 2, 3, 4, 5}. The event that the experiment ends on roll n, where n N, is E n = {(n, x 1,..., x n 1 ) (n, x 1,..., x n 1 ) Ω}. The event ( ) c E n n=1 1
2 is the event that 6 never appears. One might also describe the sample space in the following way. Ω = {(x 1,..., x n ) n N, for k = 1, 2,..., n 1, x k {1, 2, 3, 4, 5}, and x n = 6} {(x 1, x 2,...) x k {1, 2, 3, 4, 5} for k = 1, 2,...} 3. EF is the event that one die shows 1 and the sum is odd. Equivalently, it is the event that one shows 1 and the other shows an even number. Explicitly, EF = {(1, 2), (1, 4), (1, 6), (2, 1), (4, 1), (6, 1)}. E F is the event that the sum is odd or one die shows 1. Explicitly, E F = {(1, 2), (1, 4), (1, 6), (2, 1), (2, 3), (2, 5), (3, 2), (3, 4), (3, 6), (4, 1), (4, 3), (4, 5), (5, 2), (5, 4), (5, 6), (6, 1), (6, 3), (6, 5), (1, 1), (1, 3), (1, 5), (3, 1), (5, 1)}. F G is the event that one die shows 1 and the sum is 5. Equivalently, it is the event that one die shows 1 and the other shows 4. Explicitly, F G = {(1, 4), (4, 1)}. EF c is the event that neither die shows 1, and the sum is odd. Explicitly, EF c = {(2, 3), (2, 5), (3, 2), (3, 4), (3, 6), (4, 3), (4, 5), (5, 2), (5, 4), (5, 6), (6, 3), (6, 5)} EF G = F G 4. a. There are two kinds of sample points: one point is an infinite string of 0s; the other points have a string of zero or more 0s followed by a 1. The infinite string of 0s represents the outcome that a head never appears. A string of n 1 zeros, where n N means that the first n 1 tosses resulted in tails, and the n-th toss yielded a head. b. A is the set of all sample points of the form 0 } {{ 0} 1. 3k where k Z +. That is, A = {1, 0001, ,...}. 2
3 B is the set of all sample points of the form where k Z +. That is, 0 } {{ 0} 1. 3k+1 B = {01, 00001, ,...}. (A B) c is the event that neither A nor B wins. Equivalently, it is the set of all sample points of the form 0 } {{ 0} 1. 3k+2 together with the sample point That is, (A B) c = {001, , ,...} {0000 } 6. a. Ω = {(0, g), (0, f), (0, s), (1, g), (1, f), (1, s)} = 0, 1 {g, f, s} b. A = {(0, s), (1, s)} c. B = {(0, g), (0, f), (0, s)} d. B c A = {(1, g), (1, f), (1, s), (0, s)} 7. a. For each team member there are 2 possibilities for type of job and 3 possibilities for political affiliation, thus there are 6 possibilities in all. There are 15 team members, so the choice must be made 15 times. Hence there are 6 15 elements in the sample space. 3
4 b. There are three possible classifications of a team member who is not a bluecollar worker: namely, that the member is a white-collar worker and has one of the three possibile poitical affiliations. There are thus 3 15 sample points in the event that no team member is a blue-collar worker. Thus there are sample points in the event that at least one team member is a blue-collar worker. c. There are four possible classifications of a team member who is not an Independent. Thus there are 4 15 sample points in the event that no team member is an Independent. 8. a. Since A and B are mutually exclusive, P (A B) = P (A) + P (B)) = = 0.8 b. In general, the event that A occurs but B does not occur is AB c. Since A and B are mutually exclusive, A B c. Thus P (AB c ) = P (A) = 0.3 c. Since A and B are mutually exclusive, AB =, so P (AB) = Let A denote the event that a customer carries an American Express card, and let V denote the event that a customer carries a Visa card. Thus, P (A V ) = P (A) + P (V ) P (AV ) = = 0.74 So 74% of the customers carry a card the establishment accepts. 4
5 Chapter 2: Theoretical Exercises 6. There are different ways of expressing many of these. Sometimes I will give more than one. a. EF c G c = E \ (F G) b. EGF c = EG \ F c. E F G d. F G EG EF e. EF G f. (E F G) c = E c F c G c g. E c F c G c EF c G c E c F G c E c F c G = (F G EG EF ) c See parts (a) and (f) for the lhs and part (d) for the rhs. h. (EF G) c i. E c F G EF c G EF G c j. S, where S is the universal set. 7. a. (E F )(E F c ) = (E F )E (E F )F c = EE F E EF c F F c = E (EF EF c ) = E E = E b. (E F )(E c F )(E F c ) = F (E F c ) = EF where we have used the result in part (a). 5
6 c. (E F )(F G) = (E F )F (E F )G = EF F EG F G = F EG because EF F G F. 8. For each n in N, let S n = {1, 2,..., n}. First we find all partitions of the set S 3, using what we know about partitions of S 1 and S 2. Fix a subset A of S 2, and let B = S 2 \ A. For each partition P of B, Q = {A {3}} P is a partition of S 3. As we shall see below, every partition of S 3 is obtained this way. Here is what we get: Thus, T 3 = 5. A B P Q {1, 2} {{1, 2, 3}} {1} {2} {{2}} {{1, 3}, {2}} {2} {1} {{1}} {{2, 3}, {1}} {1, 2} {{1}, {2}} {{3}, {1}, {2}} {{1, 2}} {{3}, {1, 2}} 6
7 We find all the partitions of S 4 by the same method: A B P Q {1, 2, 3} {{1, 2, 3, 4}} {1, 2} {3} {{3}} {{1, 2, 4}, {3}} {1, 3} {2} {{2}} {{1, 3.4}, {2}} {2, 3} {1} {{1}} {{2, 3, 4}, {1}} {1} {2, 3} {{2}, {3}} {{1, 4}, {2}, {3}} {{2, 3}}} {{1, 4}, {2, 3}} {2} {1, 3} {{1}, {3}} {{2, 4}, {1}, {3}} {{1, 3}}} {{2, 4}, {1, 3}} {3} {1, 2} {{1}, {2}} {{3, 4}, {1}, {2}} {{1, 2}}} {{3, 4}, {1, 2}} {1, 2, 3} {{1}, {2}, {3}} {{4}, {1}, {2}, {3}} {{1}, {2, 3}} {{4}, {1}, {2, 3}} {{2}, {1, 3}} {{4}, {2}, {1, 3}} {{3}, {1, 2}} {{4}, {3}, {1, 2}} {{1, 2, 3}} {{4}, {1, 2, 3}} Thus T 4 = 15. This method works in general. We could use it to find all partitions of S 5, S 6, etc. (It isn t really clear why one would want to, but, in principle, it is possible.) 7
8 b. Constructing the Partitions. For each integer n 1, we describe how to construct a partition Q of S n+1 from a subset A of S n and a partition P of the relative complement B = S n \ A. If A = S n, then B =, and we have not defined partitions of the emptyset. By convention, we shall take P = in this case. We form Q by first adding the new element n + 1 to A and then adding the set A {n + 1} to P: Q = {A n + 1} P. We must show that this construction gives us each partition of S n+1 once and only once. Let R be a partition of S n+1. Since the union of the sets in R is S n+1, the new element n + 1 belongs to exactly one of them. Since the sets in R are pairwise disjoint, n + 1 belongs to only one of them. The set containing n + 1 is of the form A {n + 1}, where A S n. Note that A is completely determined by R. If A = S n, then R = {S n+1 }. In this case, R is the partition constructed from (S n, ). Otherwise, the other sets in R form a partition P of S n \ A, and R is the partition constructed from (A, P). Observe that the partition P is also completely determined by R. Thus each partition R of S n+1 arises from this construction, and since R uniquely determines A and P, we obtain R only once. Counting the Partitions. Now fix an integer k such that 1 k n. Let A be a subset of S n containing n k elements. Then B = S n \ A contains k elements and so has T k partitions. So there are T k partitions arising from A by our construction. There are ( n n k) = ( n k) subsets A of Sn that have n k elements. By the BPC there are ( n k) Tk partitions arising from the subsets of S n of size n k. Thus letting A run over all proper subsets A of S n, i.e., letting k take the values 1,..., n, we find that the proper subsets of S n generate n ( ) n T k k partitions of S n+1. There is one more partition of S n+1, namely, the partition {S n+1 }. Thus, n ( ) n T n+1 = 1 + T k. k 8
9 Calculating T 10. Beginning with T 1 = 1, we calculate T 2 = 2 T 3 = 5 T 4 = 15 T 5 = 52 T 6 = 203 T 7 = 877 T 8 = 4140 T 9 = T 10 = Verification of Axiom 1. For any event E, 0 n(e) n, for E cannot occur more times than the experiment is performed. Dividing through by the positive number n, we find 0 f(e) 1. Verification of Axiom 2. If S is the sample space, then S is an event and S occurs each time the experiment is performed. Thus n(s) = n, so f(s) = n(s) n = n n = 1 Verification of Axiom 3. For each integer m = 0,..., n, and each event A, we let ν m (A) be the number of times that the event A occurs in the first m repetitions of the experiment. Now, ν 0 (A) = 0 and ν n (A) = n(a) for all events A. Let E k be a sequence of pairwise mutually exclusive events and let E = E k be their union. Now ( ) ν 0 E k = ν 0 (E k ) since each side of the equation has the value zero. 9
10 We next show that ( ) ν 1 E k = ν 1 (E k ) (Logically speaking, this is unnecessary, but it might help with understanding the inductive step below.) Run the experiment for the first time. Since the events E k, k = 1, 2,..., are pairwise mutually exclusive, at most one of them occurs. If none of these events occurs, then E also does not occur and so ν 1 (E k ) = 0 for all k, k = 1, 2,..., and ν 1 (E) = 0. Thus the equation holds in this case. If one of the events occurs, then exactly one term in the sum is equal to 1. All the other terms are equal to 0. Thus the value of the sum is 1. The union also occurs, and so the left hand side of the equation also has value 1. Thus, the equation holds in both cases. Now, we are ready for the induction. Suppose that for some integer m, with 0 m < n, we have ( ) ν m E k = ν m (E k ) (1) We show that then ( ) ν m+1 E k = ν m+1 (E k ) (2) For when the experiment is run for the m + 1 st time, either (i) none of the events E k, k = 1, 2,... occurs or (ii) exactly one, say E j, occurs. In case (i), we have ν m+1 (E k ) = ν m (E k ) for k = 1, 2,.... Also E does not occur, so ν m+1 (E) = ν m (E). Thus the two sides of equation 2 are equal, respectively, to the two sides of equation 1. Thus the last equation holds in case (i). In case (ii) we have ν m+1 (E k ) = ν m (E k ) for k = 1, 2,..., k j, ν m+1 (E j ) = ν m (E j ) + 1, and ν m+1 (E) = ν m (E) + 1. Thus, we obtain each side of equation 2 by adding 1 to the corresponding side of equation 1. Thus the equation 2 holds in this case also. Therefore equation 1 implies equation 2. Thus we have, by induction, That is, ( ) ν n E k = ( ) f E k = 10 ν n (E k ). f(e k ).
11 Chapter 1 Problems 1. a. There are 26 possibilities for each of the first two places, and there are 10 possibilities for each of the 5 following places. By the GBPC there are possible license plates b. There are 26 possible choices for the first letter, 25 for the second letter, 10 for the first digit, 9 for the second digit, and so on. Thus there are possible license plates cdot7 6 = 19, 656, If each can play any of the four instruments, then 4! = 24 arrangements are possible, by GBPC. For John can choose any of the four instruments, Jim can then choose any of the remaiuning three, Jay can choose either of the remaining two, and Jack will take the remaining one. If John and Jim can play all four instruments, but Jay and Jack can each play only piano and drums, then there are two ways that Jay and Jack can be given piano and drums. For each of these there are two ways to assign the other two instruments to John and Jim. Thus in this case there are 4 possibilities. 8. a. 5! = 120, for there are 5 distinct letters. b. 7! 2!2! = 1260, for there are 7 letters, but o and p occur twice. 11! c. = 34, 650 for there are 11 letters, but i and s each occur four times, and 4!2!4! p occurs twice. d. 7! 2!2! = 1260, for there are 7 letters, but a and r occur twice. 11
12 11. a. 6! = 720 b. First arrange the books by kind. Since there are three kinds, this can be done in 3! = 6 ways. For each of these ways permute the books of each kind within their sections of the shelf. Thus by the GBPC, arrangements are possible. 3! 3! 2! 1! = 72 c. First think of the novels as being one unit. There are now 4 units to arrange. This can be done in 4! ways. Then the unit corresponding to the three novels can be expanded to an ordering of the novels in 3! ways. Thus by the BPC, arrangements are possible. 3! 4! = There will be one handshake for each 2-element subset of the set of 20 people. Thus there will be ( ) 20 = handshakes. ( ) because a poker hand is just a 5-element subset of the set of 52 cards in 5 the deck. 12
13 15. The set of 5 women can be chosen from the 10 in the class in ( ) 10 5 ways. Similarly the 5 men can be chosen in ( ) 12 5 ways. The set of partners can be formed in 5! ways. For we can order the women arbitrarily, and then the first woman can choose any of the 5 men as her partner. The second woman can choose any of the remaining 4 men as her partner, etc. Thus, by the GBPC, ( ) ( ) ! 5 5 different results are possible. 18. By the GBPC, ( ) 5 2 distinct committees are possible. ( ) 6 2 ( ) 4 =
Lecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
More informationMath/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability
Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock
More informationLecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University
Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University 1 Chapter 1 Probability 1.1 Basic Concepts In the study of statistics, we consider experiments
More informationDefinition and Calculus of Probability
In experiments with multivariate outcome variable, knowledge of the value of one variable may help predict another. For now, the word prediction will mean update the probabilities of events regarding the
More informationThe study of probability has increased in popularity over the years because of its wide range of practical applications.
6.7. Probability. The study of probability has increased in popularity over the years because of its wide range of practical applications. In probability, each repetition of an experiment is called a trial,
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationCOUNTING SUBSETS OF A SET: COMBINATIONS
COUNTING SUBSETS OF A SET: COMBINATIONS DEFINITION 1: Let n, r be nonnegative integers with r n. An r-combination of a set of n elements is a subset of r of the n elements. EXAMPLE 1: Let S {a, b, c, d}.
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More information6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationStatistics 100A Homework 1 Solutions
Chapter 1 tatistics 100A Homework 1 olutions Ryan Rosario 1. (a) How many different 7-place license plates are possible if the first 2 places are for letters and the other 5 for numbers? The first two
More informationProbability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of sample space, event and probability function. 2. Be able to
More information8.3 Probability Applications of Counting Principles
8. Probability Applications of Counting Principles In this section, we will see how we can apply the counting principles from the previous two sections in solving probability problems. Many of the probability
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationBasic Probability Theory II
RECAP Basic Probability heory II Dr. om Ilvento FREC 408 We said the approach to establishing probabilities for events is to Define the experiment List the sample points Assign probabilities to the sample
More informationA Little Set Theory (Never Hurt Anybody)
A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationIAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION
IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION 1 WHAT IS STATISTICS? Statistics is a science of collecting data, organizing and describing it and drawing conclusions from it. That is, statistics
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More information4. Binomial Expansions
4. Binomial Expansions 4.. Pascal's Triangle The expansion of (a + x) 2 is (a + x) 2 = a 2 + 2ax + x 2 Hence, (a + x) 3 = (a + x)(a + x) 2 = (a + x)(a 2 + 2ax + x 2 ) = a 3 + ( + 2)a 2 x + (2 + )ax 2 +
More information1 Combinations, Permutations, and Elementary Probability
1 Combinations, Permutations, and Elementary Probability Roughly speaking, Permutations are ways of grouping things where the order is important. Combinations are ways of grouping things where the order
More informationSection 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.
Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationCh. 13.2: Mathematical Expectation
Ch. 13.2: Mathematical Expectation Random Variables Very often, we are interested in sample spaces in which the outcomes are distinct real numbers. For example, in the experiment of rolling two dice, we
More informationProbability. a number between 0 and 1 that indicates how likely it is that a specific event or set of events will occur.
Probability Probability Simple experiment Sample space Sample point, or elementary event Event, or event class Mutually exclusive outcomes Independent events a number between 0 and 1 that indicates how
More informationHoover High School Math League. Counting and Probability
Hoover High School Math League Counting and Probability Problems. At a sandwich shop there are 2 kinds of bread, 5 kinds of cold cuts, 3 kinds of cheese, and 2 kinds of dressing. How many different sandwiches
More informationStatistics 100A Homework 2 Solutions
Statistics Homework Solutions Ryan Rosario Chapter 9. retail establishment accepts either the merican Express or the VIS credit card. total of percent of its customers carry an merican Express card, 6
More informationRegular Expressions and Automata using Haskell
Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressions
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationA Few Basics of Probability
A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study
More informationProbabilistic Strategies: Solutions
Probability Victor Xu Probabilistic Strategies: Solutions Western PA ARML Practice April 3, 2016 1 Problems 1. You roll two 6-sided dice. What s the probability of rolling at least one 6? There is a 1
More informationSTAT 319 Probability and Statistics For Engineers PROBABILITY. Engineering College, Hail University, Saudi Arabia
STAT 319 robability and Statistics For Engineers LECTURE 03 ROAILITY Engineering College, Hail University, Saudi Arabia Overview robability is the study of random events. The probability, or chance, that
More informationSection 6-5 Sample Spaces and Probability
492 6 SEQUENCES, SERIES, AND PROBABILITY 52. How many committees of 4 people are possible from a group of 9 people if (A) There are no restrictions? (B) Both Juan and Mary must be on the committee? (C)
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationBasics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850
Basics of Counting 22C:19, Chapter 6 Hantao Zhang 1 The product rule Also called the multiplication rule If there are n 1 ways to do task 1, and n 2 ways to do task 2 Then there are n 1 n 2 ways to do
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationAutomata and Formal Languages
Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,
More informationChapter 4: Probability and Counting Rules
Chapter 4: Probability and Counting Rules Learning Objectives Upon successful completion of Chapter 4, you will be able to: Determine sample spaces and find the probability of an event using classical
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 7, due Wedneday, March 14 Happy Pi Day! (If any errors are spotted, please email them to morrison at math dot berkeley dot edu..5.10 A croissant
More informationContemporary Mathematics- MAT 130. Probability. a) What is the probability of obtaining a number less than 4?
Contemporary Mathematics- MAT 30 Solve the following problems:. A fair die is tossed. What is the probability of obtaining a number less than 4? What is the probability of obtaining a number less than
More information36 Odds, Expected Value, and Conditional Probability
36 Odds, Expected Value, and Conditional Probability What s the difference between probabilities and odds? To answer this question, let s consider a game that involves rolling a die. If one gets the face
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More informationCardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.
Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationSection 6.4: Counting Subsets of a Set: Combinations
Section 6.4: Counting Subsets of a Set: Combinations In section 6.2, we learnt how to count the number of r-permutations from an n-element set (recall that an r-permutation is an ordered selection of r
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationBasic Probability. Probability: The part of Mathematics devoted to quantify uncertainty
AMS 5 PROBABILITY Basic Probability Probability: The part of Mathematics devoted to quantify uncertainty Frequency Theory Bayesian Theory Game: Playing Backgammon. The chance of getting (6,6) is 1/36.
More informationMAS113 Introduction to Probability and Statistics
MAS113 Introduction to Probability and Statistics 1 Introduction 1.1 Studying probability theory There are (at least) two ways to think about the study of probability theory: 1. Probability theory is a
More informationWe can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)
More informationSECTION 10-5 Multiplication Principle, Permutations, and Combinations
10-5 Multiplication Principle, Permutations, and Combinations 761 54. Can you guess what the next two rows in Pascal s triangle, shown at right, are? Compare the numbers in the triangle with the binomial
More informationFundamentals of Probability
Fundamentals of Probability Introduction Probability is the likelihood that an event will occur under a set of given conditions. The probability of an event occurring has a value between 0 and 1. An impossible
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationSection 6.2 Definition of Probability
Section 6.2 Definition of Probability Probability is a measure of the likelihood that an event occurs. For example, if there is a 20% chance of rain tomorrow, that means that the probability that it will
More information1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:
Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationa n+1 = a n + d 10 and a n+1 = a n +5,thenthesequencea 1,a 2,a 3,... is 10, 5, 0, 5, 10, 15, 20, 25,...
Sequences A sequence is an infinite list of numbers. Sequences are written in the form a 1,a 2,a 3,a 4,... where a 1 2 R, anda 2 2 R, anda 3 2 R, anda 4 2 R, and so on. A shorter way to write what s above
More informationMarkov random fields and Gibbs measures
Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).
More informationThe Binomial Distribution
The Binomial Distribution James H. Steiger November 10, 00 1 Topics for this Module 1. The Binomial Process. The Binomial Random Variable. The Binomial Distribution (a) Computing the Binomial pdf (b) Computing
More informationHomework 3 (due Tuesday, October 13)
Homework (due Tuesday, October 1 Problem 1. Consider an experiment that consists of determining the type of job either blue-collar or white-collar and the political affiliation Republican, Democratic,
More informationREPEATED TRIALS. The probability of winning those k chosen times and losing the other times is then p k q n k.
REPEATED TRIALS Suppose you toss a fair coin one time. Let E be the event that the coin lands heads. We know from basic counting that p(e) = 1 since n(e) = 1 and 2 n(s) = 2. Now suppose we play a game
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationSection 5-3 Binomial Probability Distributions
Section 5-3 Binomial Probability Distributions Key Concept This section presents a basic definition of a binomial distribution along with notation, and methods for finding probability values. Binomial
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationProbability definitions
Probability definitions 1. Probability of an event = chance that the event will occur. 2. Experiment = any action or process that generates observations. In some contexts, we speak of a data-generating
More informationAP Stats - Probability Review
AP Stats - Probability Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. I toss a penny and observe whether it lands heads up or tails up. Suppose
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationBayesian Tutorial (Sheet Updated 20 March)
Bayesian Tutorial (Sheet Updated 20 March) Practice Questions (for discussing in Class) Week starting 21 March 2016 1. What is the probability that the total of two dice will be greater than 8, given that
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More information2. How many ways can the letters in PHOENIX be rearranged? 7! = 5,040 ways.
Math 142 September 27, 2011 1. How many ways can 9 people be arranged in order? 9! = 362,880 ways 2. How many ways can the letters in PHOENIX be rearranged? 7! = 5,040 ways. 3. The letters in MATH are
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationSOLUTIONS FOR PROBLEM SET 2
SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such
More informationACMS 10140 Section 02 Elements of Statistics October 28, 2010. Midterm Examination II
ACMS 10140 Section 02 Elements of Statistics October 28, 2010 Midterm Examination II Name DO NOT remove this answer page. DO turn in the entire exam. Make sure that you have all ten (10) pages of the examination
More informationCombinatorial Proofs
Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A
More informationSums of Independent Random Variables
Chapter 7 Sums of Independent Random Variables 7.1 Sums of Discrete Random Variables In this chapter we turn to the important question of determining the distribution of a sum of independent random variables
More informationProbability and Statistics Vocabulary List (Definitions for Middle School Teachers)
Probability and Statistics Vocabulary List (Definitions for Middle School Teachers) B Bar graph a diagram representing the frequency distribution for nominal or discrete data. It consists of a sequence
More informationQuestion: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?
ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationMath 3C Homework 3 Solutions
Math 3C Homework 3 s Ilhwan Jo and Akemi Kashiwada ilhwanjo@math.ucla.edu, akashiwada@ucla.edu Assignment: Section 2.3 Problems 2, 7, 8, 9,, 3, 5, 8, 2, 22, 29, 3, 32 2. You draw three cards from a standard
More informationNormal distribution. ) 2 /2σ. 2π σ
Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationColored Hats and Logic Puzzles
Colored Hats and Logic Puzzles Alex Zorn January 21, 2013 1 Introduction In this talk we ll discuss a collection of logic puzzles/games in which a number of people are given colored hats, and they try
More informationACMS 10140 Section 02 Elements of Statistics October 28, 2010 Midterm Examination II Answers
ACMS 10140 Section 02 Elements of Statistics October 28, 2010 Midterm Examination II Answers Name DO NOT remove this answer page. DO turn in the entire exam. Make sure that you have all ten (10) pages
More informationPermutations & Combinations
Permutations & Combinations Extension 1 Mathematics HSC Revision Multiplication Rule If one event can occur in m ways, a second event in n ways and a third event in r, then the three events can occur in
More information