Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Rule 1: Pr( A ) + Pr( A' ) = 1 Where A is the event, A' is the complement. Rule 2: For mutually exclusive events (disjoint events): A B
Determine the Probability (PROBABILITY SLIDE 14) Sample space: { x1, x2, x3, . . . , xn } Determine the probability: p(x1)= p1, p(x2) = p2, . . . p(xn)=pn Characteristic in determining the probability: 1. 0 pi 1, i = 1, n 2. Answer Q1.a: p1 + p2 + + pn = 1
Discrete Probability (PROBABILITY SLIDE 25) Let E1 and E2 be events in the sample space S. Then we have: p(E1 E2) = p(E1) + p(E2) - p(E1 E2)
T = watching TV
N and T (
Conditional Probability (PROBABILITY SLIDE 38) If we want to compute the conditional probability of E given F, we use F as the sample space. For any outcome of E to occur under the condition that F also occurs, this outcome must also be in E F. Definition: Let E and F be events with p(F) > 0. The conditional probability of E given F, denoted by p(E | F), is defined as p(E | F) = p(E F) / p(F)
Men = 75 35 = 40
Answer Q1.c. i:
Answer Q1.d.i: 1 dice consists of 6 numbers which are 1, 2, 3, 4, 5, and 6. Cartesian product of Cardinality of the sample space is Answer Q1.d.ii: B1 = only the dice 1 came up 6
Answer Q1.d.iii: C = sum of 2 dices is 7. C = (1, 6), (2, 5), (3, 4), (4, 3), (5, 2), (6, 1)
Answer Q1.d.iv: (1, 6), (2, 5), (3, 4), (4, 3), (5, 2), (6, 1)
(MATHEMATICAL INDUCTION SLIDE 4) These are the steps of proving by mathematical Induction: If we have a propositional function P(n), and we want to prove that P(n) is true for any natural number n, we do the following:
Inductive step: Show that =5 Since both terms on the right side in the above equation are divisible by 4, we have PROVED
. This is different from saying that and Thus the induction is wrong.
Answer Q2.c:
Answer Q2.d:
Special properties for relation on a set A: reflexive : every element is self-related. I.e. aRa for all a A symmetric : order is irrelevant. I.e. for all a,b A aRb iff bRa transitive : when a is related to b and b is related to c, it follows that a is related to c. I.e. for all a,b,c A aRb and bRc implies aRc Properties of Binary Relations Warnings Warnings: there are additional concepts with confusing names antisymmetric : not equivalent to not symmetric. Meaning: its never the case for a b that both aRb and bRa hold. asymmetric : also not equivalent to not symmetric. Meaning: its never the case that both aRb and bRa hold. irreflexive : not equivalent to not reflexive. Meaning: its never the case that aRa holds.
For relations R on a set A. Q: What does MR look like when when R is reflexive? A: Reflexive. Upper-Left corner to Lower-Right corner diagonal is all 1s. EG:
Q: How about if R is symmetric? A: A symmetric matrix. I.e., flipping across diagonal (transposing) does not change matrix. EG:
Answer Q3.a: A relation is asymmetric if and only if it is both antisymmetric and irreflexive. Not asymmetric = not antisymmetric (symmetric) and not irreflexive (reflexive). ,
Equivalent Relation
POSET
Answer Q3.b:
Answer Q4.a:
Answer Q4.c:
Draw the relation for two bus rides from 4c in the previous digraph
Notation: Cardinality of a Set The cardinality of a set A is denoted by | A |. a. If A = , then | A |= 0. b. If A has exactly n elements, then | A | = n. c. If A is an infinite set, then | A | = . Examples: A = {2, 3, 5, 7, 11, 13, 17, 19}; | A | = 8
Answer Q5.a:
PAA
QBB
Answer Q5.b: