Scribd
Upload
123 views

Part 1: The Fundamental Counting Principle

1) The document discusses fundamental counting principles for permutations and combinations. It provides examples of using permutations to count arrangements of objects and passwords, and using combinations to count groups selected from a larger set where order doesn't matter, such as committees. 2) Examples are given to count the number of ways to arrange letters, choose pizzas, and select combinations from groups of objects. Formulas are provided for permutations with and without repetition and for circular permutations. 3) Written examples provide the number of ways to visit colleges, arrange letters in a word, and seat people around a table. Combination examples include selecting students for a committee and commissioners from candidates.

Uploaded by

Shanna Basallo Alenton
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
123 views

Part 1: The Fundamental Counting Principle

1) The document discusses fundamental counting principles for permutations and combinations. It provides examples of using permutations to count arrangements of objects and passwords, and using combinations to count groups selected from a larger set where order doesn't matter, such as committees. 2) Examples are given to count the number of ways to arrange letters, choose pizzas, and select combinations from groups of objects. Formulas are provided for permutations with and without repetition and for circular permutations. 3) Written examples provide the number of ways to visit colleges, arrange letters in a word, and seat people around a table. Combination examples include selecting students for a committee and commissioners from candidates.

Uploaded by

Shanna Basallo Alenton
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Part 1: THE FUNDAMENTAL COUNTING PRINCIPLE x 1 = 6 ways to arrange the letters.

In general, the number


Two events: If one event can occur in m ways and !
of permutations of n distinct objects is: =
another event can occur in n ways, then the number of ()!
ways both events can occur is m x n. For example, if one !
For permutations with repetition, use =
event can occur 3 ways and another event occurs 2 ways, ! ! !
then both events can occur in 3 x 2 = 6 ways. where q represents the number of times the character is
Three or more events: The fundamental being repeated.
counting principle can be extended to three or more
events. For example, if three events can occur in m, n, For circular permutations, we use the formula: = (
and p ways, then the number of ways that all three can )!
occur is m x n x p.
Example:
Example: 1) You are considering 10 different colleges. Before
1) At a bloodletting drive, blood can be labeled in you decide to apply to the colleges, you want to
four types (A, B, AB, or O), one of two RH factors visit some or all of them. In how many ways can
(+ or -), and one of the two genders (F or M). How you visit 6 of the colleges? In how many ways can
many different ways can blood be labeled? you visit all 10 colleges?
2) You are choosing a password that has four letters 2) Find the number of distinguishable permutations
followed by 2 digits. How many passwords are of the letters in the word PHILIPPINES.
possible if letters and digits can be repeated? 3) In how many ways can 3 people be seated
Written Work #1: around a circular table?
1) A pizza shop runs a special where you can buy a
large pizza with one cheese, one vegetable, and Written work # 2:
one meat. You have a choice of 7 cheeses, 11 Answer Activity no. 6 of your book page 296.
vegetables, and 6 meats. Additionally, you have Answers number 3 and 4.
a choice of 3 crusts and 2 sauces. How many
different variations of pizza special are available? Part 3: COMBINATION
2) To keep computer files secure, many programs A combination is a way of several things out of a larger
require users to enter a password. The shortest group, where order does not matter. A combination of
allowable passwords are typically six characters items occurs when the items are selected from the same
long and can contain both numbers and letters. group, no item is used more than once, and the order of
How many six-character password can be made items makes no difference.
if characters can be repeated? The number of possible combinations if r items are taken
from n items is:
Part 2: PERMUTATION !
=
Permutation is an ordered arrangement of items that ( )! !
occurs when no item is used more than once and the
order of arrangement makes a difference. Example:
The fundamental counting principle can be used to 1) From a class of 20 students we need to select 3
determine the number of permutations of n objects. For for a committee.
instance, you can find the number of ways you can Written Work
arrange the letters A, B, and C by multiplying. There are 1) An election ballot asks voters to select three city
3 choices for the first letter, 2 choices for the second commissioners from a group of six candidates. In
letter, and 1 choice for the third letter, so there are 3 x 2 how many ways can this be done?

Page | 1 Statistics and Probability Notes 1

You might also like