HELP!!! Here are 4 math questions for 25 points! Need answers ASAP!!!
1 answer:
You might be interested in
The appropriate method to use in solving the given question is permutation. Then, the numbers of ways to arrange the buttons is 1320 ways.
In the given question, the order of arrangement is important, so that the number of ways that Fiona could order the buttons can be determined by permutation method.
i.e =
Red 6
Green 3
Yellow 3
Total 12
Since no two neighbouring buttons of the same colour is allowed, then 3 buttons would be arranged at a time.
Thus, n = 12 and r = 3;
=
=
=
= 12 x 11 x 10
= 1320
Therefore the buttons can be arranged in 1320 ways without two neighbors having the same colour.
Visit: brainly.com/question/1408616