Home
Class 12
MATHS
Q.1 There are counters available in x di...

Q.1 There are counters available in x different colours. The counters are all alike except for the colour. The total number of arrangements consisting of y counters, assuming sufficient number of counters of each colour, if no arrangement consists of all counters of the same colour is: (A*) x - x) (B) x²-y (C) yx -x (D) yx _y 10 nainte are indicated on the perimeter of a triangle ABC (see figure).

Promotional Banner

Similar Questions

Explore conceptually related problems

There are counters available in 8 different colours (atleast 10 of each colour) Counters are at alike except for the colour.same colours Number of ways in which 5counters can be selected which consist of atleast2counters of same colour is

There are counters available in 7 different colours.Counters are all alike except colour and they are atleast ten of each colour.Find the number of ways in which an arrangement of 10 counters can be made.How many of these will have counters of each colour?

There are counters available in 3 different colours (atleast four of each colour). Counters are all alike except for the colour. If 'm' denotes the number of arrangements of four counters if no arrangement consists of counters of same colour and 'n' denotes the corresponding figure when every arrangement consists of counters of each colour, then :

Identify the Quantifiers in the following statements: for all real number x and y ,x.y=y.x

2m white counters and 2n red counters are arranged in a straight line with (m+n) counters on each side of central mark. The number of ways of arranging the counters, so that the arrangements are symmetrical with respect to the central mark is (A) .^(m+n)C_m (B) .^(2m+2n)C_(2m) (C) 1/2 ((m+n)!)/(m! n!) (D) None of these

2m white counters and 2n red counters are arranged in a straight line with (m+n) counters on each side of central mark. The number of ways of arranging the counters, so that the arrangements are symmetrical with respect to the central mark is (A) .^(m+n)C_m (B) .^(2m+2n)C_(2m) (C) 1/2 ((m+n)!)/(m! n!) (D) None of these

2m white counters and 2n red counters are arranged in a straight line with (m+n) counters on each side of central mark. The number of ways of arranging the counters, so that the arrangements are symmetrical with respect to the central mark is (A) .^(m+n)C_m (B) .^(2m+2n)C_(2m) (C) 1/2 ((m+n)!)/(m! n!) (D) None of these

2m white counters and 2n red counters are arranged in a straight line with (m+n) counters on each side of central mark. The number of ways of arranging the counters, so that the arrangements are symmetrical with respect to the central mark is (A) .^(m+n)C_m (B) .^(2m+2n)C_(2m) (C) 1/2 ((m+n)!)/(m! n!) (D) None of these

There are n identical red balls & m identical green balls. The number of different linear arrangements consisting of "n red balls but not necessarily all the green balls" is "^xC_y then (A) x=m+n , y=m (B) x=m+n+1, y=m (C) x=m+n+1, y=m+1 (D) x=m+n, y=n

There are n identical red balls & m identical green balls. The number of different linear arrangements consisting of "n red balls but not necessarily all the green balls" is "^xC_y then (A) x=m+n , y=m (B) x=m+n+1, y=m (C) x=m+n+1, y=m+1 (D) x=m+n, y=n