Solution to Ask about the lenght of 5 formed using the lettre ABCDEFG without repetitions. How many … - Sikademy
Author Image

Archangel Macsika

Ask about the lenght of 5 formed using the lettre ABCDEFG without repetitions. How many string begins with the letter F and end with the letter A

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

It follows that that by Combinatorial Product Rule the number of strings of length 5 which consist of the letters A, B, C, D, E, F and G without repetition is equal to 7\cdot6\cdot 5\cdot4\cdot 3=2,520. The number of strings of length 5 without repetition which begins with the letter F and end with the letter A is equal to 5\cdot 4\cdot 3=60.


Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-586-qpid-471