Consider the letter WANDER
how many do not beign with WA use permutation
There are 5 letters in the word WANDER. To find the number of permutations that do not begin with WA, we need to subtract the permutations that do begin with WA from the total number of permutations.
The total number of permutations of the 5 letters is 5! = 120.
To find the permutations that begin with WA, we can treat WA as a single letter. This gives us 4 letters to permute: WA, N, D, E, and R. The number of permutations of these 4 letters is 4! = 24. However, we need to multiply this by 2 to account for the fact that WA can be rearranged as AW. So there are 2 × 24 = 48 permutations that begin with WA.
Therefore, the number of permutations that do not begin with WA is 120 - 48 = 72.
To calculate the number of permutations of the word "WANDER" that do not begin with "WA", we first need to determine the total number of permutations of the word.
The word "WANDER" has 6 letters. To find the number of permutations, we use the formula for the number of permutations of a set of items, where there are n items and k of them are the same:
Number of permutations = n!
In this case, n = 6, so the number of permutations of the word "WANDER" is 6! = 6 x 5 x 4 x 3 x 2 x 1 = 720.
Now let's calculate the number of permutations that do not begin with "WA".
If we fix "WA" at the beginning, we have 720 - 2! permutations remaining, because the remaining 4 letters can be arranged in 4! ways. (Remember, the 2! accounts for the 2 letters "WA" already fixed at the beginning.)
So, the number of permutations that do not begin with "WA" is 720 - 2! = 720 - 2 = 718.
Therefore, there are 718 permutations of the word "WANDER" that do not begin with "WA".