Home
Class 11
MATHS
Find the numbers of ways of arranging 6 ...

Find the numbers of ways of arranging 6 players to throw the cricket ball so that the oldest players may not throw first.

Text Solution

Verified by Experts

The correct Answer is:
` 600 `
Promotional Banner

Similar Questions

Explore conceptually related problems

The number of ways of arranging 6 players to throw the cricket ball so that oldest player may not throw first is

Find the number of ways of dividing 52 cards among four players equally.

Find the number of ways of dividing 52 cards among four players equally.

Find the number of ways of getting 2 heads and 4 tails in 6 throws of a coin.

There are fifteen players for a cricket match In how many ways the 11 players can be selected?

A basket ball team consists of 12 pairs of twin brothers. On the first day of training, all 24 players stand in a circle in such a way that all pairs of twin brothers are neighbours. Number of ways this can be done is :

You are given 8 balls of different colour (black,white ......). The number of ways in which these balls can be arranged in a row so that the two balls of particular colour (say red and white) may never come together is-

116 people participated in a knockout tennis tournament. The players are paired up in the first round, the winners of the first round are paired up in the second round, and so on till the final is played between two players. If after any round, there is odd number of players, one player is given a by, i.e. he skips that round and plays the next round with the winners. The total number of matches played in the tournment is

Ravi can throw a ball at a speed on the earth which can cross a river of width 10 m . Ravi reaches on an imaginary planet whose mean density is twice that of the earth. Find out the maximum possible radius of the planet so that if Ravi throws the ball at the same speed it may escape from the planet. Given radius of the earth = 6.4 xx 10^(6) m .

16 players P_(1),P_(2),P_(3),….P_(16) take part in a tennis tournament. Lower suffix player is better than any higher suffix player. These players are to be divided into 4 groups each comprising of 4 players and the best from each group is selected to semifinals. Q. Number of ways in which these 16 players can be divided into four equal groups, such that when the best player is selected from each group P_(6) in one among them is (k)(12!)/((4!)^(3)) the value of k is