Cognizant Permutation & Combinations Quiz-1

: the number of ways in which a visitor can visit the places are

5c1 + 5c2+ 5c3= 5 +10+10

25 ways

distinct functions you cannot repeat.

So 10^10

There are 3 alternatives to answer the question

So the option can be 3^12

On one of the option we have that we didn’t answer the question at all

3^12  - 1

4 particular books must always be together.

Take 4 books as 1   & remaining books = 8

Total Books = 9

9 books can be arranged in 9 !  ways

4 books as 1 can be arranged in 4!  ways

Total number of Ways  = 9! * 4!

in order that no two Hindi come together we need to have following arrangement.

X E X E X E X……….E X

There are 18 English books so places needs to be is 19

And for the Hindi books 12 places are used 19C12 = 50388 ways

we can have different colours in 5^3

= 125

there are M keys which can be used in N ways

Number of ways to select the M keys are M+1

Total ways are (M+1) X(M+1)…………………..N

(M+1)n

Number of different ways of selection are

(M+1)n  - 1

let there be students A to j out of which A and b don’t participate together,

Case 1: neither of A and B come then the remain students’ needs to be selected 8c6

Case 2: only one of them comes i.e. selecting 5 out of 8 and one from A and b

8c6 + 8c5 x 2c1

=728 ways

:  triangle needs 3 points

14c3 – 7c3

= 329