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

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

  1. A

    10!

  2. B

    10!2

  3. C

    9!

  4. D

    none of these

    Register to Get Free Mock Test and Study Material

    +91

    Verify OTP Code (required)

    I agree to the terms and conditions and privacy policy.

    Solution:

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

    Chat on WhatsApp Call Infinity Learn

      Register to Get Free Mock Test and Study Material

      +91

      Verify OTP Code (required)

      I agree to the terms and conditions and privacy policy.