The king has 15 (different) colored flags that he uses to send coded messages to his general in the field. for example, blue-green-red might mean "attack at dawn" and red-green-blue may mean "retreat." he sends the message by arranging three of the flags atop the castle wall. how many coded messages can the king sent

2730

Step-by-step explanation:

the king has 15 flags, different colored, one of each color and he sends messages of three flags, in some specific order. For each message he can`t use two times the same flag because he leaves the three flags on the top of the castle wall (and he has only one of each color).

then we have a combination of 3 elements from a list of 15 elements, in wich the order of the elements matters and we can`t use one element more than one time

then there are

15x14x13 options

when the king chooses the first flag he has 15 options, then for the second flag there are only 14 flags left to choose, and then for the third flag he has to choose between the rest of 13 flags.

15x14x13=2730

.there can be infinite values of m and n that can satisfy the above equation. for each value of m of m or n. there maybe infinite sets of solution for the above

step-by-step explanation: