Chapt 1 Flashcards

(42 cards)

0
Q

Probability

A

The extent to which something is likely to happen

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
1
Q

Experiment

A

any process that requires some action to be performed and has an outcome that can be recorded.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Outcome

A

Any single result from an experiment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Sample space

A

The set/collection of all possible outcomes of an exoeriment and is typically denoted as S
Eg s={ 1 2. 3}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Event

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The null event

A

Or empty set contains no outcomes and is denoted by ∅.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Intersection A ∩ B

A

Means both A and B occur “∩” denotes logical AND

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Union A∪B

A

Either A or B or both occur U denotes logical OR

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Complement A ̄ ( bar on top of A)

A

Not A which occurs when A does not,

Sometimes denoted Ac and is the logical NOT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Disjoint A∩B=∅

A

A and B have no points in common so if A occurs then B does not
AKA mutually exclusive

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Subset A ⊂ B

A

If A happens them B will definitely happen AKA A implies B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Compound experiment

A

Large experiment made u if two or more experiments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

2^k

A

Total number of outcomes when tossing k coins

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

6^k

A

Number of outcomes when tolling 6 dices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Independent

A

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)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

If A and B are independent…

A

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)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

three main methods of counting events

A

1 multiplication principle
2 permutations
3 conbinations

17
Q

the multiplication principle

A

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…

18
Q

permutations

(orderings or objets

A

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

19
Q

n! and 0!

A

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.

20
Q

when the order in which you select the n objects is important

A
eg selecting AB is different fromBA...
then the number of possible permutations from n is:
nPr=  n!
        (n - r)!
***divided by***
21
Q

when the objects are not all different…

A

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.

22
Q

combinations

A

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”

23
Q

probability rule 4:

the general addition law

A

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/

24
probability rules 1: P(S) = 1
where S is the sample space (something must happen).
25
probability rules 2: P(0/)=0 ** 0 with line through...empty set
where 0/ is the empty event
26
probability rules 3: P(A ̄) = 1 P(A) **A ̄ MEANS AWITH BAR ONTOP
A or A ̄ must happen
27
relative frequency
an experiment is repeated several times and the proportion of times that event A occurs is that the probability of it occurring in the future rfn= number of times A occurred/ number of repetitions of experiment= r/n
28
subjective probability
when an individual estimates the probability of event A occurring based on theyr prior knowledge
29
p (AlB)=
probability of A given that B has already happened
30
conditional probability
the conditional probability that event A occurs given that B has already happened is P(AlB)= P (A n B)/ P(B) can also be written as P(AnB)= P(AlB)P(B)
31
equally likely outcomes probability model
if an experimenter has an experiment with n outcomes that are all equally likely to occur the probability of any single outcome is P(any single outcome)=1/n then for an event A made up of m outcomes its probability is: P(A)=m/n= number of favourable outcomes /total number of outcomes
32
general addition law
P(AUB)=P(A) + P(B)-P(AnB)
33
independence
``` events A and B are independent if: P(AnB)=P(A)P(B) informally, they are independent if knowing the result of one event does not affect the probability of the other occurring if independant P(AnB) is equal to: P(AlB)p(B), PBlA)P(A), P(A)P(B) ```
34
P(AlB) if A and B are disjoint?
PAnB)= PAlB)P(B) P(AlB)=P(AnB)/P(B) P(AlB=0/P(B) =0
35
miltiplication principle
allows us to determine the number of outcomes in a compound experiment- that is one with several experiments multiply together number of outcomes e.g. rolling one dice and tossing a coin =12 outcomes in general number of outcomes to the power of how many times experiment is done so for coin it would be 2(outcomes) to the power of k (how many coins were tossed
36
permutations
n different objects and n spaces to put them number of different ways to put them is n! this is called the number of permutations i.e. the number of different orders in which you can select the n objects
37
permutations
when the order in which you select the n objects is important nPr= n!/(n-r)!
38
say you have different numbers of the n objects then
the number of orderings is n!/n(type1)!+n(type2)!+n(type3)! | r= groups so number of different types
39
permutation exampleyou have one suspect and eight normal people how many ways can you order them
8!=
40
combinations
collection of n objects all of which are different from these r are chosen then if order they are chosen doesn't matter then nCr=n!/(n-r!)r! this is also written (n over r without a line in between) and its pronounced n choose r
41
Bayes theory
Bayes theorem is based on the idea of a partition, which is a set of events that follow the three rules defined below. last ting in chapt 1 go through with examples******