Question on # of possible rearrangements given conditions

  • Thread starter Thread starter thelannonmonk
  • Start date Start date
  • Tags Tags
    Conditions
AI Thread Summary
To find the number of rearrangements of the letters in "INVESTIGATION" with the first letter as V and the last letter not being T, start with 12! for the total permutations. To address the last letter condition, calculate the permutations where T is the last letter, which is 11! since the first letter is fixed as V. Subtract this from the total permutations to find the valid arrangements. The final count will give the total number of valid rearrangements under the specified conditions.
thelannonmonk
Messages
6
Reaction score
0
1. How many ways are there to rearrange the letters of INVESTIGATION given that the first letter is a V and the last letter is not a T?

I get the first part, first letter being V cuts the # of combinations from 13! to 12!, but how do I handle the part about the last letter not being T? Most of what I have found online doesn't really relate to this particular issue.
 
Physics news on Phys.org
How many possibilities do you have for the last letter? And then before the last one?

ehild
 
12! is the number of permutations in which we allow both T and non-T as the last letter. Can you count the number in which T *is* the last letter?

RGV
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top