If the n objects in a permutations problem are not all distinguishable-that is, if there are n, of type 1, n2 of type 2, and The number of possible permutations is n! 2520 so on, for r different types-then the number of distinguishable permutations is given by n, !n2! • ••n,!" How many permutations are possible using the 7 letters in the word ALABAMA?

A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
icon
Related questions
icon
Concept explainers
Topic Video
Question
### Permutations with Non-Distinguishable Objects

In permutations problems where not all objects are distinguishable, the number of distinguishable permutations is calculated differently. If there are \( n \) objects with \( n_1 \) objects of type 1, \( n_2 \) objects of type 2, and so on for \( r \) different types, the formula for the number of distinguishable permutations is given by:

\[
\frac{n!}{n_1! \cdot n_2! \cdot \ldots \cdot n_r!}
\]

### Example Problem

**Question:** How many permutations are possible using the 7 letters in the word ALABAMA?

**Solution:** 

Given the word "ALABAMA":
- The letter A appears 4 times.
- The letter L appears 1 time.
- The letter B appears 2 times.
- The letter M appears 1 time.

Using the formula for distinguishable permutations, we have:

\[
\frac{7!}{4! \cdot 1! \cdot 2! \cdot 1!}
\]

Calculating factorials:
- \( 7! = 5040 \)
- \( 4! = 24 \)
- \( 1! = 1 \)
- \( 2! = 2 \)

Therefore:

\[
\frac{5040}{24 \cdot 1 \cdot 2 \cdot 1} = \frac{5040}{48} = 105
\]

Hence, the number of possible permutations of the word ALABAMA is **2520**.
Transcribed Image Text:### Permutations with Non-Distinguishable Objects In permutations problems where not all objects are distinguishable, the number of distinguishable permutations is calculated differently. If there are \( n \) objects with \( n_1 \) objects of type 1, \( n_2 \) objects of type 2, and so on for \( r \) different types, the formula for the number of distinguishable permutations is given by: \[ \frac{n!}{n_1! \cdot n_2! \cdot \ldots \cdot n_r!} \] ### Example Problem **Question:** How many permutations are possible using the 7 letters in the word ALABAMA? **Solution:** Given the word "ALABAMA": - The letter A appears 4 times. - The letter L appears 1 time. - The letter B appears 2 times. - The letter M appears 1 time. Using the formula for distinguishable permutations, we have: \[ \frac{7!}{4! \cdot 1! \cdot 2! \cdot 1!} \] Calculating factorials: - \( 7! = 5040 \) - \( 4! = 24 \) - \( 1! = 1 \) - \( 2! = 2 \) Therefore: \[ \frac{5040}{24 \cdot 1 \cdot 2 \cdot 1} = \frac{5040}{48} = 105 \] Hence, the number of possible permutations of the word ALABAMA is **2520**.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Sample space, Events, and Basic Rules of Probability
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, probability and related others by exploring similar questions and additional content below.
Recommended textbooks for you
A First Course in Probability (10th Edition)
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
A First Course in Probability
A First Course in Probability
Probability
ISBN:
9780321794772
Author:
Sheldon Ross
Publisher:
PEARSON