Using the permutation formula, as the order is important, it is found that the officers can be chosen in 6840 ways.
Each "position" is a different role(president, vice president and secretary), hence the order is important.
The number of possible permutations of x elements from a set of n elements is given by:
[tex]P_{(n,x)} = \frac{n!}{(n-x)!}[/tex]
In this problem, 3 people will be chosen from a set of 20, hence:
[tex]P_{20,3} = \frac{20!}{17!} = 6840[/tex]
The officers can be chosen in 6840 ways.
More can be learned about the permutation formula at https://brainly.com/question/25925367
