exercise:322ff46e86: Difference between revisions
From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> How many ways can six indistinguishable letters be put in three mail boxes? '' Hint'': One representation of this is given by a sequence <math>|</math>LL<math>|</math>L<math>|</math>LLL<math>|</math> where the <math>|</math>'s represent the part...") |
No edit summary |
||
| Line 1: | Line 1: | ||
How many ways can six indistinguishable letters be put in three mail boxes? '' Hint'': One representation of this is given by a | |||
put in three mail boxes? '' Hint'': One representation of this is given by a | |||
sequence <math>|</math>LL<math>|</math>L<math>|</math>LLL<math>|</math> where the <math>|</math>'s represent the partitions for the boxes and | sequence <math>|</math>LL<math>|</math>L<math>|</math>LLL<math>|</math> where the <math>|</math>'s represent the partitions for the boxes and | ||
the L's the letters. Any possible way can be so described. Note that we need two | the L's the letters. Any possible way can be so described. Note that we need two | ||
bars at the ends and the remaining two bars and the six L's can be put in any order. | bars at the ends and the remaining two bars and the six L's can be put in any order. | ||
Latest revision as of 23:05, 12 June 2024
How many ways can six indistinguishable letters be put in three mail boxes? Hint: One representation of this is given by a sequence [math]|[/math]LL[math]|[/math]L[math]|[/math]LLL[math]|[/math] where the [math]|[/math]'s represent the partitions for the boxes and the L's the letters. Any possible way can be so described. Note that we need two bars at the ends and the remaining two bars and the six L's can be put in any order.