Scribd
Upload
48 views3 pages

Mat08-Data Analysis

An experiment consists of tossing a die and flipping a coin based on the result. The sample space (S) contains all possible outcomes. If the die number is even, one coin flip occurs. If odd, two flips occur. S has 16 elements. The event (A) of getting less than 3 on the die contains 4 elements from S. The event (B) of getting two tails has 3 elements. The complement of A contains 12 elements from S. The intersection of A' and B contains 2 elements. The union of A and B contains 10 elements.

Uploaded by

chibi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views3 pages

Mat08-Data Analysis

An experiment consists of tossing a die and flipping a coin based on the result. The sample space (S) contains all possible outcomes. If the die number is even, one coin flip occurs. If odd, two flips occur. S has 16 elements. The event (A) of getting less than 3 on the die contains 4 elements from S. The event (B) of getting two tails has 3 elements. The complement of A contains 12 elements from S. The intersection of A' and B contains 2 elements. The union of A and B contains 10 elements.

Uploaded by

chibi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Experiment – any process that generates a Sum Rule Principle – events cannot occur

set of data. simultaneously.

Sample space (S) - set of all possible outcomes will Product Rule Principle – events can occur
depend on chances and therefore, cannot predicted with
simultaneously.
certainty.
Permutation – is an arrangement of all or part of a
Element or member – outcome in a sample space or group objects or elements.
sample point.

1. ROSTER METHOD - has a finite number of


sample points, we may describe the set by listing.
2. SET BUILDER / RULE METHOD – has large or
infinite number of sample points, the set of data
can be described by a statement or rule.

Permutation – is an arrangement of all or part of a


group of objects or elements.

In general, the total number of permutations of n


different objects is n!, where n! = n(n-1)(n-2)…(n-
n+1). It read as “n factorial”, whichk is the product of
counting numbers from 1 to n.
3. TREE DIAGRAM - list the sample space
systematically

Event – subcollection of outcomes

1. The complement of an event with respect to S is Circular permutation – we consider one object fixed
the subset of all elements of S that are not in A. and calculate the number of arrangements based on
we denote the complement of A by the symbol A’ the remaining number of object left. P = (n-1)!
2. The intersection of two events A and B, denoted
by the symbol AnB, is the event containing all
element that are common to both A and B
mutually exclusive -events that cannot occur
simultaneously.
3. The union of the two A and B, denoted by the
symbol AUB, is the events containing all the
elements that belongs to A or B or both. PERMUTATION OF DISTINCT OBJECT TAKEN r AT A
An experiment consists of tossing a die and then flipping a coin once if TIME
the number on the die is even. If the number on the die is odd, then the
coin is flipped twice.
a. List the elements of the sample space S. The arrangement of r distinct object without
b. List the elements corresponding to the event A that a number less repetition, from the set of n objects in a definite
than 3 occurs on the die.
c. List the elements corresponding to the event B that 2 tails occur.
order is also a permutation (r and n are positive
d. List the elements corresponding to event A’. integers; r≤n )
e. List the elements corresponding to the event A’ՌB. The number of permutations of n distinct objects
f. List the elements corresponding to the event AUB
Answers: taken r at a time iis
a. S = {1HH, 1HT, 1TH, 1TT, 2H, 2T, 3HH, 3HT, 3TH, 3TT, 4H, 4T, 5HH, 5HT, 5TH, 5TT,
6H, 6T}
b. A = {1HH, 1HT, 1TH, 1TT, 2H, 2T}
c. B = {1TT, 3TT, 5TT}
d. A’ = {3HH, 3HT, 3TH, 3TT, 4H, 4T, 5HH, 5HT, 5TH, 5TT, 6H, 6T}
e. A’ՌB = {3TT, 5TT}
f. AUB = {1HH, 1HT, 1TH, 1TT, 2H, 2T, 3TT, 5TT}
Ex.

PERMUTATION WITH REPITITION

Frequently, we want to know the number of permutations


of a multiset, that is, a set of objects of which are alike.
The number of distinct permutations of n things of which
n1 are of one kind, n2 of a second kind, …nk of a kth kind
is
Pemutations and Combanition

Ex.

PERMUTATION WITH PARTITION – the number of ways of


partitioning a set of n objects into r cells with n1 elements
in the first cell, n2 in the second and so forth.

The number of ways of partitioning a set of n objects into r


cells with n1 elements in the first cell, n2 elements in the
second and so forth, is

Combination – is the number of ways of selecting r objects


from n without giving regard to order.

The number of combinations of n distict objects taken r at


a time is

You might also like