Counting, Permutations, &amp; Combinations

1 / 16

# Counting, Permutations, &amp; Combinations - PowerPoint PPT Presentation

Counting, Permutations, &amp; Combinations. A counting problem asks “how many ways” some event can occur. Ex. 1: How many three-letter codes are there using letters A, B, C, and D if no letter can be repeated? One way to solve is to list all possibilities.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Counting, Permutations, &amp; Combinations' - diep

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Counting, Permutations, & Combinations

Ex. 1: How many three-letter codes are there using letters A, B, C, and D if no letter can be repeated?

One way to solve is to list all possibilities.

Ex. 2: An experimental psychologist uses a sequence of two food rewards in an experiment regarding animal behavior. These two rewards are of three different varieties. How many different sequences of rewards are there if each variety can be used only once in each sequence?

Next slide

Fundamental Counting Principle

Suppose that a certain procedure P can be broken into n successive ordered stages, S1, S2, . . . Sn, and suppose that

S1 can occur inr1 ways.

S2 can occur inr2 ways.

Sn can occur inrn ways.

Then the number of ways P can occur is

Ex. 2: An experimental psychologist uses a sequence of two food rewards in an experiment regarding animal behavior. These two rewards are of three different varieties. How many different sequences of rewards are there if each variety can be used only once in each sequence?

Using the fundamental counting principle:

3

2

Permutations

An r-permutation of a set of n elements is an orderedselection of r elements from the set of n elements

! means factorial

Ex. 3! = 3∙2∙1

0! = 1

Ex. 1:How many three-letter codes are there using letters A, B, C, and D if no letter can be repeated?

Note: The order does matter

Combinations

The number of combinations of n elements taken r at a time is

Order does NOT matter!

Where n & r are nonnegative integers & r<n

Use A, B, C, and D to represent the people

Note: Does the order matter?

Ex. 4: How many ways can the 4 call letters of a radio station be arranged if the first letter must be W or K and no letters repeat?

Ex. 5: In how many ways can our class elect a president, vice-president, and secretary if no student can hold more than one office?

Ex. 7: Given the digits 5, 3, 6, 7, 8, and 9, how many 3-digit numbers can be made if the first digit must be a prime number? (can digits be repeated?)

Think of these numbers as if they were on tiles, like Scrabble. After you use a tile, you can’t use it again.

Ex. 9: In how many ways can a team of 9 players be selected if there are 3 pitchers, 2 catchers, 6 in-fielders, and 4 out-fielders?