Simple Border Classic Stationery Paper A4 Document - 20240331 - 193523 - 0000

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Imagine you have a jewelry store and you want to

display three of your most popular necklaces in a


display case. You have 8 different necklaces to
choose from. In how many different ways can you
arrange the three necklaces in the display case?

To solve this problem, we can use the permutation


formula:

nPr = n! / (n - r)!

Where n is the total number of items to choose from,


r is the number of items to arrange, and "!" denotes
factorial.

In this case, n = 8 (the total number of necklaces)


and r = 3 (the number of necklaces to arrange in the
display case).

So, we can calculate the number of permutations as


follows:

nPr = 8!/(8-3)! nPr = 8! / 5! nPr = (8 × 7 ×6×5×4×3×2 x 1)


/ (5 × 4 × 3 × 2 × 1) nPr = 56

Therefore, there are 56 different ways to arrange the


three necklaces in the display case.

You might also like