The number of ways in which 10 candidates A1,A2,…,A10 can be ranked such that A1, is always above A10 is

Two positions for A1, and A10 can be selected in  10C2 ways. Rest eight students can be ranked in 8! ways.Hence, total number of ways is   10C2×8!=(1/2)(10!)