There are 6 members on a board of directors. If they must elect a chairperson, a secretary, and a treasurer, how many different slates of candidates are possible?

120 different slates of candidates are possible.

Step-by-step explanation:

The order is important.

For example, a slate of John, Rose and Elisa means that John is the chairperson, Rose is the secretary and Elisa is the treasurer. If two of them are exchanged, their roles will also be changed. So we use the permutations formula to solve this question.

Permutations formula:

The number of permutations of x elements from a set of n elements is given by:

In this problem, we have that:

6 members will be chosen for 3 roles. So

120 different slates of candidates are possible.

(c, 0) i might be wrong so don't put full faith on my answer

step-by-step explanation:

given that there are two triangles j'k'l' and jkl>

the former is got by dilating the second one.

when drawn on a grid, (graph paper) coordinates of vertices of first triangle is

(6,12)j, (9,6)k and (12,9)l

side jk has length = distance between j and k

=

side j'k'=distance between j' and k'

=

ie j'k'l' has sides 1/3 of that of corresponding sides of jkl.

hence scale factor of 1/3 is used to get j'k'l'from jkl