Chapt 1 Flashcards
(42 cards)
Probability
The extent to which something is likely to happen
Experiment
any process that requires some action to be performed and has an outcome that can be recorded.
Outcome
Any single result from an experiment
Sample space
The set/collection of all possible outcomes of an exoeriment and is typically denoted as S
Eg s={ 1 2. 3}
Event
Any collection of outcomes from the sample soacmore formally in terms of set theory it is a subset of the sample space
Usually denoted by capital letters
The null event
Or empty set contains no outcomes and is denoted by ∅.
Intersection A ∩ B
Means both A and B occur “∩” denotes logical AND
Union A∪B
Either A or B or both occur U denotes logical OR
Complement A ̄ ( bar on top of A)
Not A which occurs when A does not,
Sometimes denoted Ac and is the logical NOT
Disjoint A∩B=∅
A and B have no points in common so if A occurs then B does not
AKA mutually exclusive
Subset A ⊂ B
If A happens them B will definitely happen AKA A implies B
Compound experiment
Large experiment made u if two or more experiments
2^k
Total number of outcomes when tossing k coins
6^k
Number of outcomes when tolling 6 dices
Independent
Independence is when knowing the result of one event does not effect the probability of the other occurring my eg
P(A n B)= p(A) p(B)
If A and B are independent…
Then P(A n B is equal to all of the following
P(A|B) P(B)
P(B|A) P(A)
P(A) P(B)
three main methods of counting events
1 multiplication principle
2 permutations
3 conbinations
the multiplication principle
Suppose there are two experiments 1, 2
which contain n1, n2 outcomes
Then the joint experiment of conducting 1 and 2 together has n1 x n2 possible outcomes.
if there were 3 experiments it would be n1 x n2 x n3 and so on…
permutations
(orderings or objets
when there are n number of different objects and n spaces to put them in
so the number of ways of putting the n different objects in the n different spaces is…
n! = n x (n - 1) x (n- 2) x . . . x 2 x
n! and 0!
0!=1
n!…
The 1st object can be put in any one of n spaces.
• The 2nd object can be put in any one of (n 1) spaces (one space is already taken).
• The nth object can only be put in 1 space.
when the order in which you select the n objects is important
eg selecting AB is different fromBA... then the number of possible permutations from n is: nPr= n! (n - r)! ***divided by***
when the objects are not all different…
there are t < n di↵erent types. Assume there are n1 objects of type 1, n2 of type 2,. . . , nt objects of type t, where n1 + n2 + . . . + nt = n. Then the number of permutations (orderings) of all n objects is:
n!
n1! x n2! x… x nt!
** divided by**
Note that in the above formula if all objects are di↵erent then nr = 1 for all groups r and we obtain the same formula as above.
combinations
Suppose there are a collection of n objects all of which are di↵erent. From these n, 0 r n are chosen. Then if the order in which they are chosen does not matter, then there are
nCr = n!
(n r)!r!
…possibble combinations
it is written as n over r in a bracket without a line between them and is said as “n chooses r”
probability rule 4:
the general addition law
P(A U B) = P(A) + P(B) P(A n B)
can also be…
P(A n B)=P(A)+P(B) P(A u B).
• P(A u B) = P(A) + P(B) if A and B are disjoint, i.e. if A n B = 0/