Question: Number of ways in which candidates C1, C2, C3, … C8 can ...

Question

Number of ways in which candidates C₁, C₂, C₃, … C₈ can be ranked such that C₁ is always above C₈ is

Answer 1

Number of ways of Ranking = 8 !

In half cases C₁ is above C₈, while in half cases C₁ is below C₈

∴ Total ways = $\frac{8!}{2} = 20160$ .

Question: Number of ways in which candidates C<sub>1</sub>, C<sub>2</sub>, C<sub>3</sub>, … C<sub>8</sub> can ...