Home
Class 12
MATHS
The number of ways in which ten candidat...

The number of ways in which ten candidates `A_(1),A_(2),A_(3),A_(4),……,A_(10)` can be arranged in a row
if `A_(1)` is just above `A_(2)` then the number of ways are

Text Solution

Verified by Experts

The correct Answer is:
`(1)/(4)`
Promotional Banner

Similar Questions

Explore conceptually related problems

The number of ways in which ten candidates A_(1),A_(2),A_(3),A_(4),……,A_(10) can be arranged in a row if A_(1) and A_(2) are next to each other is

The number of ways in which ten candidates A_(1),A_(2),A_(3),A_(4),……,A_(10) can be arranged in a row If A_(1) is always above A_(2) and A_(2) is above A_(3) 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

Find the number of ways of arranging 15 students A_(1),A_(2),…….,A_(15) in a row such that neither A_(2) nor A_(3) be seated before A_(1)

Find the number of ways of arranging 15 students A_(1),A_(2),………A_(15) in a row such that A_(1),A_(2) and A_(3) sit together in specified order

Find the number of ways of seating 10 students A_(1), A_(2)…..A_(10) in a row such that (i) A_(1), A_(2), A_(3) sit together (ii) A_(1), A_(2), A_(3) sit in a specified order (iii) A_(1), A_(2),A_(3) sit together ina specified order.

The number of all three element subsets of set {a_(1),a_(2),a_(3),.......,a_(n)} which contain a_(3) is