219k views
4 votes
How many different 9-letter strings can be made by rearranging the characters in the word wisconsin?

User Vlad Mysla
by
9.1k points

1 Answer

6 votes

There are 11 letters in the word "wisconsin," and you can rearrange them to form 9-letter strings. To find the total number of 9-letter strings that can be formed, you can use the permutation formula, which is:

(n!)/(r!(n-r)!)

Where:

n = the number of items (in this case, the number of letters in the word "wisconsin")

r = the number of items chosen at a time (in this case, 9 letters)

Plugging in the values, you get:

(11!)/(9!(11-9)!) = (1110987654321)/(98765432121) = 330

Therefore, there are 330 different 9-letter strings that can be formed by rearranging the characters in the word "wisconsin."

User Vlad Lego
by
8.7k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.