how many permutations can be formed from all of the letters of the word houston?
This question needs the concept of ‘permutation’ to be solved. In such types of question where the number of arrangements of several definite elements is asked, the solution is obtained through solving the ‘factorial of the number of the elements’.
We have the word ‘Algebra’ and we have to count the number of arrangements in its letter.
The word Algebra has 7 letters so we can arrange them in 7! ways.
7! = 7 x 6 x 5 x 4 x 3 x 2 x 1
or n! = n x (n-1) x (n-2) x … x 2 x 1
but we clearly see that the letter ‘A’ has come twice in the word ‘Algebra’ so
the number of arrangements will be 7!/2! (because A has repeated 2 times)
let’s solve it.
total arrangement = 7! / 2!
total arrangement = 7 x 6 x 5 x 4 x 3 x 2 x1 / 2 x 1
total arrangement = 2520
So the letters of word ‘Algebra’ can be arranged in 2520 ways irrespective to a meaningful word.
how many permutations can be formed from all of the letters of the word houston?
So 2520 distinct permutations can be formed from all letters of the word Houston.
