TRY OUT......

18b. There are 3 cars of different make available to transport 3 girls and 5 boys on a field trip. Each car can hold upto 3 children, Find

b. the numbers of ways in which they can be accomadated if 2 or 3 girls are assigned to one of the cars. In both the cars internal arrangement of children inside the car is to be considered as immaterial.

23. For each positive integer k, let Sk denote the increasing arithmetic sequence of integers whose first term is 1 and whose common difference is k. For example, S3 is the sequence 1,4,7,10....Find the number of values of k for which Sk contain the term 361.

20. Determine the number of paths from the origin to the point (9,9) in the cartesian plane which never pass through (5,5) in paths consisting only of steps going 1 unit North and 1 unit East.

12. In an election for the managing committee of a reputed club, the number of candidates contesting elections exceeds the number of members to be elected by r(r>0).If a voter can vote in 967 different ways to elect the managing committee by voting atleast 1 of them &can vote in 55 different ways to elect (r-1) candidates by voting in the same manner. Find the number of candidates contesting the elections and the number of candidates losing the elections.

6 Answers

62
Lokesh Verma ·

20. Determine the number of paths from the origin to the point (9,9) in the cartesian plane which never pass through (5,5) in paths consisting only of steps going 1 unit North and 1 unit East.

Total number of ways to go from 0,0 to 9, 9 is

18C9

Out of these, total ways in which one passed through 5,5 is

10C5 x 8C4

take the difference :)

106
Asish Mahapatra ·

23. For each positive integer k, let Sk denote the increasing arithmetic sequence of integers whose first term is 1 and whose common difference is k. For example, S3 is the sequence 1,4,7,10....Find the number of values of k for which Sk contain the term 361.

t1 = 1

361 = 1+ (n-1)k

=> (n-1)k = 360

this is equivalent to finding no. of pairs of divisors of 360 i.e the solution of xy=360 and then divide the result by 2 because the no. of solutions we obtain is the ordered pair (x,y) while we require only the combinations of the answer

4
UTTARA ·

Nishant How 18 c 9 ways from (0,0) to (9,9)

I dont get the logic : (

62
Lokesh Verma ·

This is a classical problem...

The thing here is that you have to make 2n moves in all to reach from 0,0 to n, n

of these, n of them are to the right and another n to the upward direction..

So the problem is same as arranging n right arrows and n up arrows...

Which is (2n)!/(n!n!)

4
UTTARA ·

Thanks Nishant Sir

4
UTTARA ·

Good probs but unable to get 12 th Anyone with solution???????

Your Answer

Close [X]