- #1
ENgez
- 75
- 0
Hello,
I was given a question (not a HW question..) in which i was asked to calculate the number of ways to sort n numbers into k groups, where for any two groups, the elements of one group are all smaller or larger than the elements of the other group.
The answer is supposed to be [tex](k!)^{\frac{k}{n}}(\frac{k}{n}!)[/tex]
I understand the term [tex](\frac{k}{n}!)[/tex]
as the it is the number of ways to arrange the groups. What I do not understand is the power of the first term.
Can anyone give me an intuitive answer where it comes from?
I was given a question (not a HW question..) in which i was asked to calculate the number of ways to sort n numbers into k groups, where for any two groups, the elements of one group are all smaller or larger than the elements of the other group.
The answer is supposed to be [tex](k!)^{\frac{k}{n}}(\frac{k}{n}!)[/tex]
I understand the term [tex](\frac{k}{n}!)[/tex]
as the it is the number of ways to arrange the groups. What I do not understand is the power of the first term.
Can anyone give me an intuitive answer where it comes from?