1.

The number of ways in which ten candidates A, AAo can be ranked such that A, ls always above Ao ls(D)101)10(A) 5!(B) 2(5)(C) 10

Answer»

Total number of ways to arrange a1 .. a10 = 10!In 10! / 2 combinationsa1 will be above a2 and in the other half a2 will be above a1.

Ans : 10! / 2



Discussion

No Comment Found