Permutations without repetition formulas, proof, exercises, examples

2072
Egbert Haynes
Permutations without repetition formulas, proof, exercises, examples

A permutation without repetition of n elements are the different groups of different elements that can be obtained by not repeating any element, only varying the order of placement of the elements.

To find out the number of permutations without repetition, the following formula is used: 

Pn = n! 

Which expanded would be Pn = n! = N (n - 1) (n - 2)… (2) (1).

So in the previous practical example it would be applied as follows:

P4 = 4 * 3 * 2 * 1 = 24 different 4-digit numbers.

These being the 24 arrays in total: 2468, 2486, 2648, 2684, 2846, 2864, 4268, 4286, 4628, 4682, 4826, 4862, 6248, 6284, 6428, 6482, 6824, 6842, 8246, 8264, 8426, 8462, 8624, 8642.

As can be seen, there is no repetition in any case, being 24 different numbers.

Article index

  • 1 Demonstration and formulas
    • 1.1 24 Arrangements of 4 different figures
    • 1.2 12 Arrangements of 2 different figures
  • 2 Examples
    • 2.1 Example 1
    • 2.2 Example 2
  • 3 Solved exercises
    • 3.1 Exercise 1
    • 3.2 Exercise 2
    • 3.3 Exercise 3
  • 4 References

Demo and formulas

24 Arrangements of 4 different figures

We are going to analyze more specifically the example of the 24 different 4-digit arrangements that can be formed with the digits of the number 2468. The number of arrangements (24) can be known as follows:

You have 4 options to select the first digit, that leaves 3 options to select the second. Two digits have already been set and 2 options remain for selecting the third digit. The last digit has only one selection option.

Therefore, the number of permutations, denoted by P4, is obtained by the product of the selection options in each position:

P4 = 4 * 3 * 2 * 1 = 24 different 4-digit numbers

In general, the number of permutations or distinct arrangements that can be performed with all the n elements of a given set is:

Pn = n! = N (n - 1) (n - 2)… (2) (1)

The expression n! is known as n factorial and means the product of all natural numbers that lie between the number n and the number one, including both.

12 Arrangements of 2 different figures

Now suppose that you want to know the number of permutations or numbers of two different figures that can be formed with the digits of the number 2468.

These would be 12 arrangements in total: 24, 26, 28, 42, 46, 48, 62, 64, 68, 82, 84, 86

You have 4 options to select the first digit, that leaves 3 digits to select the second. Therefore, the number of permutations of the 4 digits taken two by two, denoted by 4P2, is obtained by the product of the selection options in each position:

4P2 = 4 * 3 = 12 different 2-digit numbers

In general, the number of different permutations or arrangements that can be performed with r elements of the n in total in a given set is:

nPr = n (n - 1) (n - 2)… [n - (r - 1)]

The above expression is truncated before playing n !. To complete n! from it we should write:

n! = N (n - 1) (n - 2)… [n - (r - 1)] (n - r)… (2) (1)

The factors that we add, in turn, represent a factorial:

(n - r)… (2) (1) = (n - r)!

Therefore,

n! = N (n - 1) (n - 2)… [n - (r - 1)] (n - r)… (2) (1) = n (n - 1) (n - 2)… [n - (r - 1)] (n - r)!

From here

n! / (n - r)! = N (n - 1) (n - 2)… [n - (r - 1)] = nPr

Examples

Example 1

How many different 5-letter letter combinations can be constructed with the letters of the word KEY??

We want to find the number of different 5-letter letter combinations that can be constructed with the 5 letters of the word KEY; that is, the number of 5-letter arrays involving all the letters available in the word KEY.

Number of 5 letter words = P5 = 5! = 5 * 4 * 3 * 2 * 1 = 120 different 5-letter letter combinations.

These would be: CLAVE, VELAC, LCAEV, VLEAC, ECVLAC ... up to 120 different letter combinations in total.

Example 2

You have 15 numbered balls and you want to know How many different groups of 3 balls can be built with the 15 numbered balls?

You want to find the number of groups of 3 balls that can be made with the 15 numbered balls.

N ° of groups of 3 balls = 15P3 = 15! / (15 - 3)!

N ° of groups of 3 balls = 15 * 14 * 13 = 2730 groups of 3 balls

Solved exercises

Exercise 1

A fruit store has an exhibition stand that consists of a row of compartments located in the entrance hall to the premises. In one day, the greengrocer acquires for sale: oranges, bananas, pineapples, pears and apples.

a) How many different ways do you have to order the exhibition stand?

b) How many different ways do you have to order the stand if, in addition to the aforementioned fruits (5), you received on that day: mangoes, peaches, strawberries and grapes (4)?

a) We want to find the number of different ways to order all the fruits in the display row; that is, the number of arrangements of 5 fruit items that involve all the fruits available for sale on that day.

No. of stand arrangements = P5 = 5! = 5 * 4 * 3 * 2 * 1

N ° of stand arrangements = 120 ways to present the stand

b) We want to find the number of different ways to order all the fruits in the display row if 4 additional items were added; that is, the number of arrangements of 9 fruit items that involve all the fruits available for sale on that day.

N ° of stand arrangements = P9 = 9! = 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1

N ° of stand arrangements = 362,880 ways to present the stand

Exercise 2

A small food outlet has a plot of land with enough space to park 6 vehicles.

a) How many different ways of ordering the vehicles in the plot of land can be selected?

b) Suppose that a contiguous plot of land is acquired whose dimensions allow 10 vehicles to be parked, how many different ways of ordering the vehicles can be selected now?

a) We want to find the number of different ways of ordering in the plot of land the 6 vehicles that can be housed.

No. of arrangements of the 6 vehicles = P6 = 6! = 6 * 5 * 4 * 3 * 2 * 1

N ° of arrangements of the 6 vehicles = 720 different ways of ordering the 6 vehicles in the plot of land.

b) We want to find the number of different ways of ordering in the plot of land the 10 vehicles that can be housed after the expansion of the plot of land.

N ° of arrangements of the 10 vehicles = P10 = 10!

No. of vehicle arrangements = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1

N ° of arrangements of the 10 vehicles = 3,628,800 different ways of ordering the 10 vehicles in the plot of land.

Exercise 3

A florist has flowers of 6 different colors to make floral flags of nations that have only 3 colors. If it is known that the order of the colors is important in the flags,

a) How many different flags of 3 colors can be made with the 6 available colors?

b) The seller buys flowers of 2 additional colors to the 6 he already had, now how many different flags of 3 colors can be made?

c) Since you have 8 colors you decide to expand your offer of flags, how many different flags of 4 colors can you make?

d) How many of 2 colors?

a) We want to find the number of different flags of 3 colors that can be made by selecting from the 6 available colors.

N ° of 3-color flags = 6P3 = 6! / (6 - 3)!

No. of 3-color flags = 6 * 5 * 4 = 120 flags

b) You want to find the number of different flags of 3 colors that can be made by selecting from the 8 available colors.

N ° of 3-color flags = 8P3 = 8! / (8 - 3)!

No. of 3-color flags = 8 * 7 * 6 = 336 flags

c) The number of different 4-color flags that can be made by selecting from the 8 available colors must be calculated.

No. of 4-color flags = 8P4 = 8! / (8 - 4)!

No. of 4-color flags = 8 * 7 * 6 * 5 = 1680 flags

d) You want to determine the number of different flags of 2 colors that can be made by selecting from the 8 available colors.

No. of 2-color flags = 8P2 = 8! / (8 - 2)!

No. of 2-color flags = 8 * 7 = 56 flags

References

  1. Boada, A. (2017). Use of permutation with repetition as teaching of experiments. Vivat Academia Magazine. Recovered from researchgate.net.
  2. Canavos, G. (1988). Probability and statistics. Applications and methods. McGraw-Hill / Interamericana de México S. A. de C. V.
  3. Glass, G .; Stanley, J. (1996). Statistical methods not applied to the social sciences. Prentice Hall Hispanoamericana S. A.
  4. Spiegel, M .; Stephens, L. (2008). Statistics. Fourth ed. McGraw-Hill / Interamericana de México S. A.
  5. Walpole, R .; Myers, R .; Myers, S .; Ye, Ka. (2007). Probability & Statistics for engineers & scientists. Eighth ed. Pearson Education International Prentice Hall.
  6. Webster, A. (2000). Statistics applied to business and economy. Third ed. McGraw-Hill / Interamericana S. A.
  7. (2019). Permutation. Recovered from en.wikipedia.org.

Yet No Comments