The Gateway to Computer Science Excellence
0 votes
40 views
If A = {1,2,3 …. n}

then how many multisets of size 4 are possible ,such that atleast of the elements appears twice.
in Mathematical Logic by Active (2.3k points) | 40 views
0

@arvin

 

0

@manisha11 atleast how many elements??? one or two or three or..............

lets solve using atleast one element..

which means we can have only one element appearing exactly twice or atleast two element appearing twice or three elements(which is not possible)

atleast one element appearing twice :

select one element which is appearing twice which can be done in n ways.. and from remaining n-1 select any two elements in n-1C2 ways.

#ways =  n*(n-1C2)

atleast two elements appearing exactly twice:

means we will select two elements from n in nC2 ways..

#way= nC2

now total number of ways in which this can be done: 

=n*((n-1)C2) +nC2 

=n(n-1)(n+1)/ 2 answer.

0
soo GOOD!!

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
198,229 comments
104,909 users