A club with 33 members is to select five officers (president, vice president, secretary, treasurer, and historian). In how many ways can this be done?

Answer 1

The five posts are distinct (i.e. no duplicate posts).
So the order of selection of these posts is important => solution is a permutation.
Selecting r objects from n distinct objects, where order is important is given by P(n,r) where
P(n,r)=n!/(n-r)!
n! = n factorial
For the given example, n=33, r=5.
Can you take it from here?