Find the number of distinguishable arrangements of the letters of the worcd SEPTILLION

Question

Question

math Statistics-And-Probability

Answer 1

Answer #1

solution:-

given that word SEPTILLION

in that 10 word are there

=> 2 - I
=> 2 - L

SO formula

=> total ! / (number of looks alike !)

=> 10! / (2!*2!)

=> 10*9*8*7*6*5*4*3*2*1 / ((2*1)*(2*1))

=> 907200

Add a comment

Answer 2

Similar Homework Help Questions

Find the number of distinguishable permutations of the given letters "AABCD

Find the number of distinguishable permutations of the given letters "AABCD
1. (a) How many distinguishable arrangements are there of the letters in BOOKKEEPER? (b) How many...

1. (a) How many distinguishable arrangements are there of the letters in BOOKKEEPER? (b) How many if the P and the R must be together? (C) How many if the B must be at the beginning and the R at the end?
Find the number of distinguishable permutations of the letters in each word below. (a) bigger (b)...

Find the number of distinguishable permutations of the letters in each word below. (a) bigger (b) Kansas (c) referred

Find the number of distinct arrangements of the 10 letters in WOODWORKER. Two of the same...

Find the number of distinct arrangements of the 10 letters in WOODWORKER. Two of the same letter are considered identical (not distinct). x $ ?
Find the number of different arrangements of the letters in the word (CAVALRY) and illustrate linearly....

Find the number of different arrangements of the letters in the word (CAVALRY) and illustrate linearly. (a) Ends with a vowel (b) Has a consonant in the middle
How many distinguishable ways can the letters of the word COMMUNICATION be arranged in order?

How many distinguishable ways can the letters of the word COMMUNICATION be arranged in order?

The letters of “mississippi” are permuted randomly, with each distinguishable permutation equally likely. What is the...

The letters of “mississippi” are permuted randomly, with each distinguishable permutation equally likely. What is the probability that, in the resulting scrambled word, no four adjacent letters are all the same? That is, the four i characters cannot all be adjacent and the four s characters cannot all be adjacent. Give an exact answer as a simplified fraction.
We wish to find the number of arrangements of the word "MATH" that start with "M"...

We wish to find the number of arrangements of the word "MATH" that start with "M" OR end with "T". Determine the number of arrangements by listing them explicitly. That is, give the sent of outcomes for the task as described above and determine the total number of arrangements that start with M or end with T.
1. Consider the word "engineering". (a.) How many distinct arrangements of the letters are there? (b.)...

1. Consider the word "engineering". (a.) How many distinct arrangements of the letters are there? (b.) How many distinct arrangements are there if the letter "r" must always occur before any of the vowels?

Counting Arrangements A password is going to be formed by rearranging all of the letters of...

Counting Arrangements A password is going to be formed by rearranging all of the letters of the word WILLAMETTE. (i). How many total different arrangements are possible? (ii). How many if the two L's must be next to each other (LL)? (iii). How many if W cannot be first and E cannot be last? (So LIWMEELATT is okay, but LIWMELATTE is not.)