How many different anagrams (including nonsensical words) can be made from the letters in the word...

Question

Question

How many different anagrams (including nonsensical words) can be made from the letters in the word STATISTICS, using all the letters?

math Statistics-And-Probability

Answer 1

Answer #1

Solution:

STATISTICS contains 10 letters, where we have 3S, 3Ts, 2Is, and 1 letter of the other letters

N= 10

S = 3

I = 2

T = 3

A = 1

C = 1

Number of anargrams = (10!)/((3! *2! * 3!* 1! *1!) = 3628800/(6*2*6*1*1) = 50400

So there is 50400 different anargrams.

Answer 2

Similar Homework Help Questions

How many distinctly different “words” can be formed using the letters of the word “OTTAWA”？

How many distinctly different “words” can be formed using the letters of the word “OTTAWA”？
Consider the word "TUMBARUMBA" a)How many words can be made by arranging all 10 letters? b)How...

Consider the word "TUMBARUMBA" a)How many words can be made by arranging all 10 letters? b)How many of these words included TU as a subword?
a) How many different strings can be made from the word PEPPERCORN when (SHOW WORK &...

a) How many different strings can be made from the word PEPPERCORN when (SHOW WORK & Explaination) i) all the letters are used? ii) at least 6 of the letters are used? b) How many different strings can be made from the letters in AARDVARK, using all of the letters, if all three As must be consecutive? (SHOW WORK & Explaination) c) How many permuations of the 26 letters of the English alphabet do not contain any of the strings...

To be done in java code. 2 words are anagrams if 1 word can be formed...

To be done in java code. 2 words are anagrams if 1 word can be formed by rearranging all the letters of the other word, eg: mary, army a word is represented as a linked list with one letter per node of the list. Write a function that, given w1 and w2, with each pointing to a word of lowercase letters, returns 1 if the words are anagrams and 0 if they are not. Base your algorithm on the following:...
How many permutations can be made using all the letters in the word Connecticut?

How many permutations can be made using all the letters in the word Connecticut?
#4 How many different words (letter sequences) can be obtained by rearranging the letters in the...

#4 How many different words (letter sequences) can be obtained by rearranging the letters in the word MASSACHUSETTS?

How many different letter arrangements can be made from the following words (the arrangements don’t need...

How many different letter arrangements can be made from the following words (the arrangements don’t need to be meaningful)? Letters are not unique (e.g. F1 is the same thing as F2) a) WORDS b) DIFFERENT
in c, 5. Write a function that tests whether two words are anagrams. The function returns...

in c, 5. Write a function that tests whether two words are anagrams. The function returns 1 if the two words are anagrams, returns 0 otherwise. Two words are anagrams if they are permutations of the same letters. For example, smartest and mattress are anagrams and dumbest and stumble are not anagrams. Assume wordl and word2 are null-terminated strings containing arbitrary lower-case alphabetic letters. Hint: use an array of 26 integers to keep track of how many times each letter...
How many distinct 5 letter words can be made by arranging the letters ENGLISH if the word must start with L and end with either S or G?

How many distinct 5 letter words can be made by arranging the letters ENGLISH if the word must start with L and end with either S or G?

How many ways can the letters of the word KITCHEN be arranged? How many ways can...

How many ways can the letters of the word KITCHEN be arranged? How many ways can the letters of the word KITCHEN be arranged if the letters H, E, and N must remain next to each other in the order HEN? If all arrangements of the letters of the word KITCHEN are equally likely, what is the probability that an arrangement will have the letters H, E, and N next to each other in the order HEN? How many ways...