Log In
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
0 votes
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 67 views




@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.

soo GOOD!!

Please log in or register to answer this question.

Related questions

1 vote
0 answers
If the precedence graph has a cycle,then will the polygraph also have a cycle? Why or Why not?
asked Jan 26, 2018 in Databases Balaji Jegan 70 views
1 vote
0 answers
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inconsistent with the ordering produced.
asked Jul 4, 2018 in Algorithms Abhilash Mishra 207 views