Question

Brute Force Algorithms

A club with 10 students elects a president, vice president, treasurer, and secretary. No student can hold more than one position. How many ways are there to select the class officers?

Answer 1

There are 10 choices for president.

After president is chosen, there are 9 choices for vice president

After president and vice president are chosen, there are 8 choices for treasurer.

After choosing the first 3 officers, there are 7 ways of choosing the Secretary.

Total number of ways;

$=10×9×8×7$

$=5040\>ways$