Find the number of ways in which the candidates `A_1,A_2,A_3...........,A_10` can be ranked.

The number of ways in which ten candidates A_1, A_2, ...., A_(10) can be ranked so that A_1 is always above A_2 is

The number of ways in which candidates A_1,A_2 ,. . . A_(10) can be ranked if A_1 is always above A_2 is

The number of ways in which 10 candidates A_1,A_2,….A_10 can be ranked so that A_1 is always above A_2 is

The number of ways in which 10 candidates A_1,A_2, A_(10) can be ranked such that A_1 is always above A_(10) is a. 5! b. 2(5!) c. 10 ! d. 1/2(10 !)

The number of ways in which 10 candidates A_1,A_2, A_(10) can be ranked such that A_1 is always above A_(10) is a. 5! b. 2(5!) c. 10 ! d. 1/2(10 !)

, the number of ways in which 10 candidates A_(1)andA_(2) can be ranked if if A1 is always above A2

Find the number of ways of arranging 15 students A_1,A_2,........A_15 in a row such that (i) A_2 , must be seated after A_1 and A_3 , must come after A_2 (ii) neither A_2 nor A_3 seated brfore A_1

Find the number of ways of arranging 15 students A_1,A_2,........A_15 in a row such that (i) A_2 , must be seated after A_1 and A_3 , must come after A_2 (ii) neither A_2 nor A_3 seated brfore A_1

Find the number of ways of arranging 15 students A_1,A_2,........A_15 in a row such that (i) A_2 , must be seated after A_1 and A_2 , must come after A_2 (ii) neither A_2 nor A_3 seated brfore A_1

Find the number of all three elements subsets of the set {a_1, a_2, a_3, ........... a_n} which contain a_3dot