Question
How many no. of 4-letter strings can be formed by the letters {A,B,C,D,E,F} with no repetitions and A cannot be the first letter?
My Answer
I know the total no. of 4-letter strings with no repetitions is 6x5x4x3=360
Then it comes to the next consideration: how many no. of combination with A being the first letter...
Should it be 5x4x3=60?[/SIZE]
Then the answer is 360-60=300
Not sure if this is correct ...
You got it.
Another way of looking at it is that the first letter can be anything except for "A"--there are 5 possibilities for the first letter. The second letter can be anything except for whatever gets used for the first letter. For example, if the first letter were "D", then the second letter can be anything in {A,B,C,E,F}, so that's 5 more. Then there are 4 possibilities for the third letter, and three possibilities for the fourth letter. That's a total of 5*5*4*3=300 possible 4-letter strings using {A,B,C,D,E,F} without repititions.