All Exams Test series for 1 year @ ₹349 only
Question

In how many distinguishable ways can the letters of the word CHANCE be arranged?

The correct answer is
360

Distinguishable Ways to Arrange Letters

The question asks for the number of unique ways the letters in the word "CHANCE" can be arranged. This is a problem of permutations with repetitions.

Permutation Formula for Repetitions

When arranging items where some items are identical, we use the formula:

$ \text{Number of arrangements} = \frac{n!}{n_1! n_2! \dots n_k!} $

Where:

  • $n$ is the total number of letters.
  • $n_1, n_2, \dots, n_k$ are the frequencies of each distinct repeated letter.

Applying the Formula to "CHANCE"

The word "CHANCE" has 6 letters.

  • Total letters, $n = 6$.
  • The letters are C, H, A, N, C, E.
  • The letter 'C' is repeated 2 times. So, $n_1 = 2$.
  • All other letters (H, A, N, E) appear only once.

Using the formula:

$ \text{Number of arrangements} = \frac{6!}{2!} $

Calculation Steps

  1. Calculate the factorial of the total number of letters: $6! = 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 720$.
  2. Calculate the factorial of the frequency of the repeated letter: $2! = 2 \times 1 = 2$.
  3. Divide the result from step 1 by the result from step 2: $ \frac{720}{2} = 360 $

Therefore, there are 360 distinguishable ways to arrange the letters of the word CHANCE.

Was this answer helpful?

Important Questions from Permutation and Combination (Notes)

  1. In how many ways can 10 men be divided into two groups of 4 men and 6 men?
  2. Out of 5 consonants and 4 vowels, how many words of 3 consonants and 3 vowels can be made?
  3. How many 5-digit numbers can be formed from the digits 0, 2, 3, 4, 6, 7 and 9, using each at most once, which are divisible by 5?
  4. From a group of 40 players, a cricket team of 11 players is chosen. Then, one of the eleven is chosen as the captain of the team. The total number of ways this can be done is
    [$\binom{m}{n}$ below means the number of ways $n$ objects can be chosen from $m$ objects]
  5. The maximum number of points formed by intersection of all pairs of diagonals of convex octagon is
Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App