如果总共有 23 张 CD,求 5 张 CD 的排列数
排列是一组项目的所有部分的有序排列。在排列的情况下考虑元素的出现顺序。这是一个有序的组合。
例如,一次取 r 的 n 个不同对象的排列数为n P r ,其中;
nPr = n!/(n-r)!
= n(n−1)(n−2)…{n−(r−1)}
(Note that n! = n×(n−1)×(n−2)×…×2×1)
如果总共有 23 张 CD,请找出 5 张 CD 的排列数。
解决方案:
Given a total of 23 CDs, assuming that each CD is different, taking only 5 CDs at a time is given by;
23P5 = 23!/(23 – 5)!
23P5 = 23!/18!
Simplifying
23P5 = 23 × 22 × 21 × 20 × 19 × 18!/18!
23P5 = 23 × 22 × 21 × 20 × 19
23P5 = 4037880
Therefore,
The number of permutations of 5 CDs if we have a total of 23 CDs is 4037880.
示例问题
问题 1.如果你总共有 20 名学生,求 3 名学生的排列数。
解决方案:
nPr = n!/(n-r)!
Given a total of 20 students, assuming that each student is different, take only 3 students at a time is given by;
20P3 = 20!/(20 – 3)!
20P3 = 20!/17!
Simplifying
20P3 = 20 × 19 × 18 × 17!/17!
20P3 = 20 × 19 × 18
20P3 = 6840
Therefore,
The number of permutations of 3 students if we have a total of 20 students is 6840.
问题 2. Mallika有 4 块巧克力,Mallika 想把它们送给 3 个乞丐。找出她可以通过多少种可能的方式做到这一点?
解决方案:
Here,
We have given that
n = 4
r = 3
Therefore,
nPr = n!/(n-r)!
4P3 = 4!/(4-3)!
4P3 = 4!/1!
4P3 = 4 × 3 × 2 × 1
4P3 = 24
Hence,
Mallika can give 4 chocolates to 3 beggars in 24 ways.
问题 3. 假设一组 5 个字母 a、b、c、d、e。
找出有多少种方法可以选择不重复的 4 个字母?
解决方案:
Here,
We have given that
n = 5
r = 4
Therefore,
nPr = n!/(n-r)!
5P4 = 5!/(5-4)!
5P4 = 5!/1!
5P4 = 5 × 4 × 3 × 2 × 1
5P4 = 120
Hence,
We can select letters in 120 ways.
问题 4. 找出有或无意义的四个字母可以用单词“LOGARITHMS”组成,假设字母不能重复?
解决方案:
Here
We have
n = 10
r = 4
nPr = n!/(n-r)!
10P4 = 10!/(10-4)!
10P4 = 10!/6!
10P4 = 10 × 9 × 8 × 7 × 6!/6!
10P4 = 10 × 9 × 8 × 7
10P4 = 5040
In 5040 ways.
问题 5。如果您总共有 16 位女性,请找出 4 位女性的排列数。
解决方案:
nPr = n!/(n-r)!
Given a total of 16 women, assuming that each student is different, take only 4 women at a time is given by;
16P4 = 16!/(16 – 4)!
16P4 = 16!/12!
Simplifying
16P4 = 16 × 15 × 14 × 13 × 12!/12!
16P4 = 16 × 15 × 14 × 13
16P4 = 43680
Therefore,
The number of permutations of 4 women if we have a total of 16 women is 43680.