Scribd
Upload
43 views10 pages

Techniques of Counting

This document discusses techniques for counting permutations and combinations. It introduces: - The fundamental principle of counting, which states that if n procedures can be performed in different ways, the total number of ways to perform them in order is the product of the number of ways for each procedure. - Factorial notation, where n! represents the product of all positive integers from 1 to n. It defines 0! = 1. - Permutations, which are arrangements of objects in a given order. P(n,r) represents the number of permutations of n objects taken r at a time. - Examples that apply these concepts to counting possible arrangements of people, letters, and other items in different scenarios.

Uploaded by

Ralph Ean Braza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
43 views10 pages

Techniques of Counting

This document discusses techniques for counting permutations and combinations. It introduces: - The fundamental principle of counting, which states that if n procedures can be performed in different ways, the total number of ways to perform them in order is the product of the number of ways for each procedure. - Factorial notation, where n! represents the product of all positive integers from 1 to n. It defines 0! = 1. - Permutations, which are arrangements of objects in a given order. P(n,r) represents the number of permutations of n objects taken r at a time. - Examples that apply these concepts to counting possible arrangements of people, letters, and other items in different scenarios.

Uploaded by

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

STATISTICS

TECHNIQUES OF COUNTING &


PERMUTATIONS
If some procedure can be performed in n1 different
ways, and if, following this procedure, a second
procedure can be performed in n2 different ways, and
if, following this second procedure, a third procedure
can be performed in n3 different ways, and so forth;
then the number of ways the procedures can be
performed in the order indicated is the product n1∙ n2∙
n3 . . . .

FUNDAMENTAL PRINCIPLE OF
COUNTING
EXAMPLES

How many possible license plates can be printed if:


• Two letters followed by three digits.
• Two distinct letters and three distinct digits.
• Two letters are vowels and three digits are odd
numbers.
• Two letters are consonants and three digits are
even numbers.
• First letter is a vowel, the second letter is a
consonant and the three digits are divisible by 3.
The product of the positive integers from 1 to n.
inclusive occurs very often in mathematics and hence
is denoted by the special symbol n! (read “n factorial”):
n! = 1∙2∙3∙…∙(n-2)(n-1)n.

It is also convenient to define 0! = 1.

FACTORIAL NOTATION
  EXAMPLES

4! =
5! =
6! =
An arrangement of a set of n objects in a given order
is called a permutation of the objects (taken all at a
time). An arrangement of any r≤n of these objects in a
given order is called an r-permutation or a permutation
•of  the n objects taken r at a time.
The number of permutations of n objects taken r at a
time will be denoted by P(n,r) or nPr.

PERMUTATIONS
EXAMPLES

How many possible permutations when selecting two


letters from the four letters a, b, c, and d?

A president, vice president, and treasurer are to be


selected from a group of 10 individuals. How many
different choices are possible?
In how many ways can a party of 7 persons arrange
themselves (i) in a row of 7 chairs? (ii) around a
circular table?

(i) In how many ways can 3 boys and 2 girls sit in a


row? (ii) In how many ways can they sit in a row if the
boys and girls are each to sit together? (iii) In how
many ways can they sit in a row if just the girls are to
sit together?
(i) In how many ways can 3 Americans, 4 Frenchmen,
4 Danes and 2 Italians be seated in a row so that
those of the same nationality sit together? (ii) Solve
the same problem if they sit at a round table.
How many distinct permutations can be formed from
all the letters of each word:

(i) unusual?
(ii) sociological?
(iii) Philippines?

You might also like