A classic counting problem is to determine the number of different ways that the letters of "success" can be arranged. Find that number

Question

Peanut

Mathematics

11 October, 06:34

A classic counting problem is to determine the number of different ways that the letters of "success" can be arranged. Find that number

+3

Answers (2)

Know the Answer?

Adan · Answer 1

Answer: 420 ways

Step-by-step explanation:

Given the word "success"

It consists of:

3 letter "s" = 3!

2 letter "c" = 2!

And a total of 7 letters. = 7!

The number of ways that the letters can be arranged can be given as;

N = 7! / (3!) (2!)

N = 7!/12 = 420 ways

Sharp · Answer 2

Answer:420 ways

Step-by-step explanation:

Success

The total = 7!

S: 3!

C:2!

Permutation: 7! / (3!2!)

: 5040 / (6*2)

The arrangement will be 420ways