Menu Close

in-how-many-ways-can-a-teacher-divide-his-10-studens-into-4-groups-such-that-each-group-has-at-least-2-students-




Question Number 212686 by mr W last updated on 21/Oct/24
in how many ways can a teacher  divide his 10 studens into 4 groups  such that each group has at least 2   students?
inhowmanywayscanateacherdividehis10studensinto4groupssuchthateachgrouphasatleast2students?
Commented by Spillover last updated on 21/Oct/24
2268000?
2268000?
Commented by mr W last updated on 21/Oct/24
how?
how?
Commented by Spillover last updated on 21/Oct/24
is it correct?
isitcorrect?
Commented by Spillover last updated on 21/Oct/24
((10!)/((2!)^4 ))=2268000
10!(2!)4=2268000
Answered by mehdee7396 last updated on 21/Oct/24
2/2/2/4  or  2/2/3/3  ⇒ (((    10)),((2,2,2,4)) )+ (((    10)),((2,2,3,3)) )= 44100
2/2/2/4or2/2/3/3(102,2,2,4)+(102,2,3,3)=44100
Commented by mr W last updated on 21/Oct/24
your answer were correct if the  question is to divide the students  into 4 groups for mathmatics,   physics, chemistry and biology   respectively, i.e. distinct objects  into distinct bins. but in this question  we just divide 10 students into 4  (identical) groups.
youranswerwerecorrectifthequestionistodividethestudentsinto4groupsformathmatics,physics,chemistryandbiologyrespectively,i.e.distinctobjectsintodistinctbins.butinthisquestionwejustdivide10studentsinto4(identical)groups.
Commented by mehdee7396 last updated on 21/Oct/24
you are right  ⋛
youareright
Answered by mr W last updated on 21/Oct/24
2/2/2/4 ⇒((10!)/((2!)^3 3!4!))=3150  2/2/3/3 ⇒((10!)/((2!)^2 2!(3!)^2 2!))=6300  Σ: 3150+6300=9450
2/2/2/410!(2!)33!4!=31502/2/3/310!(2!)22!(3!)22!=6300Σ:3150+6300=9450
Answered by Spillover last updated on 21/Oct/24
Student=10(n) say  group=4(k)   say  selected student in each group=(2×4)=8  10−8=2  Number of arrangement= (((n+k−1)),((k−1)) )   (((n+k−1)),((k−1)) )= (((2+4−1)),((4−1)) )= ((5),(3) )=10  Total way=((10!)/((2!)^4 ))×10=2268000
Student=10(n)saygroup=4(k)sayselectedstudentineachgroup=(2×4)=8108=2Numberofarrangement=(n+k1k1)(n+k1k1)=(2+4141)=(53)=10Totalway=10!(2!)4×10=2268000
Commented by mr W last updated on 21/Oct/24
this is wrong sir.  to divide 10 distinct objects into 4  identical bins such that no bin is  empty, there are {_4 ^(10) }=S(10,4)=34105  ways. since in our question each bin  should have at least 2 objects, so the  answer should be less than 34105.
thisiswrongsir.todivide10distinctobjectsinto4identicalbinssuchthatnobinisempty,thereare{410}=S(10,4)=34105ways.sinceinourquestioneachbinshouldhaveatleast2objects,sotheanswershouldbelessthan34105.
Commented by mr W last updated on 22/Oct/24
{_4 ^(10) } or S(10,4) is the stirling  number of the second kind.
{410}orS(10,4)isthestirlingnumberofthesecondkind.
Answered by golsendro last updated on 22/Oct/24
(1) (( (((10)),((  2)) )  ((8),(2) )  ((6),(2) )  ((4),(4) ))/(3!))   (2) (( (((10)),((  2)) )  ((8),(2) )  ((6),(3) )  ((3),(3) ))/((2!)^2 ))
(1)(102)(82)(62)(44)3!(2)(102)(82)(63)(33)(2!)2
Commented by golsendro last updated on 22/Oct/24
yes
yes

Leave a Reply

Your email address will not be published. Required fields are marked *