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

Ten candidates can be ranked in 10! ways. In half of these ways is above A2 is above A2 and in another half A2 is above A1. so, required number of ways = 10!2