How many different permutations can you make with the letters in the word seventeen?
Answer
611.7k+ views
Hint: First we will mention the formula for evaluating the number of permutations if there are $n$ objects with $r$ types. Then evaluate the number of times each term appears. Then finally substitute the values in the formula and evaluate the total number of permutations.
Complete step-by-step answer:
We will mention the formula for the permutation, if there are $n$ objects with $r$ types, then
$\dfrac{{n!}}{{{n_1}!{n_2}!{n_3}!{n_4}!....{n_r}!}}$
The given object is: Seventeen
Here, you can observe that there is a total of $9$ alphabets in the word.
The letter $S$ appears $1$ time.
The letter $E$ appears $4$ time.
The letter $V$ appears $1$ time.
The letter $N$ appears $2$ time.
The letter $T$ appears $1$ time.
We can calculate the different permutations as follows:
\[
= \dfrac{{9!}}{{1!4!1!2!1!}} \\
= \dfrac{{9!}}{{1\times24\times 1\times 2\times 1}} \\
= \dfrac{{368880}}{{48}} \\
= 7560 \;
\]
Hence, the total number of permutations with the letters in the word Seventeen.
So, the correct answer is “7560”.
Note: A permutation is also called an arrangement number or order is a rearrangement of the elements of an ordered list into one-to-one correspondence with itself. A representation of a permutation as a product of permutation cycles is unique up to the ordering of the cycles. Any permutation is also a product of transpositions. Permutations are commonly denoted in lexicographic or transposition order. There is a correspondence between a permutation and a pair of young tableaux known as Schensted correspondence.
Complete step-by-step answer:
We will mention the formula for the permutation, if there are $n$ objects with $r$ types, then
$\dfrac{{n!}}{{{n_1}!{n_2}!{n_3}!{n_4}!....{n_r}!}}$
The given object is: Seventeen
Here, you can observe that there is a total of $9$ alphabets in the word.
The letter $S$ appears $1$ time.
The letter $E$ appears $4$ time.
The letter $V$ appears $1$ time.
The letter $N$ appears $2$ time.
The letter $T$ appears $1$ time.
We can calculate the different permutations as follows:
\[
= \dfrac{{9!}}{{1!4!1!2!1!}} \\
= \dfrac{{9!}}{{1\times24\times 1\times 2\times 1}} \\
= \dfrac{{368880}}{{48}} \\
= 7560 \;
\]
Hence, the total number of permutations with the letters in the word Seventeen.
So, the correct answer is “7560”.
Note: A permutation is also called an arrangement number or order is a rearrangement of the elements of an ordered list into one-to-one correspondence with itself. A representation of a permutation as a product of permutation cycles is unique up to the ordering of the cycles. Any permutation is also a product of transpositions. Permutations are commonly denoted in lexicographic or transposition order. There is a correspondence between a permutation and a pair of young tableaux known as Schensted correspondence.
Recently Updated Pages
Master Class 10 Computer Science: Engaging Questions & Answers for Success

State BPT theorem and prove it class 10 maths CBSE

A peacock is sitting on the top of a pillar which -class-10-maths-CBSE

Railways Women Helpline Number?

Explain the refraction of light through a glassslab class 10 physics CBSE

a Why did Mendel choose pea plants for his experiments class 10 biology CBSE

Trending doubts
Explain the Treaty of Vienna of 1815 class 10 social science CBSE

10 examples of evaporation in daily life with explanations

What is the full form of POSCO class 10 social science CBSE

Five things I will do to build a great India class 10 english CBSE

Write short note on buckyball class 10 chemistry CBSE

Make a sketch of the human nerve cell What function class 10 biology CBSE

