Arrangement of 15 balls including 3 each of 5 different colors in a triangle

Clash Royale CLAN TAG#URR8PPP
up vote
5
down vote
favorite
Fifteen balls including 3 each of 5 different colors are arranged in a triangle as shown. How many ways can this be done if rotations are allowed?

I was thinking the answer should be
$15!/(3*(3!)^5)$ as we can arrange 15 balls in 15 positions in 15! ways. Then since there are 3 balls of 5 different colors each, we divide it by $(3!)^5$ and then divide by 3 as rotation is allowed.
But this is not correct as if 6 balls are needed to arrange like this where there are 3 balls each of 2 different colors, by this logic, the answer should be $6!/3!3!3$ which is not an integer.
combinatorics
add a comment |Â
up vote
5
down vote
favorite
Fifteen balls including 3 each of 5 different colors are arranged in a triangle as shown. How many ways can this be done if rotations are allowed?

I was thinking the answer should be
$15!/(3*(3!)^5)$ as we can arrange 15 balls in 15 positions in 15! ways. Then since there are 3 balls of 5 different colors each, we divide it by $(3!)^5$ and then divide by 3 as rotation is allowed.
But this is not correct as if 6 balls are needed to arrange like this where there are 3 balls each of 2 different colors, by this logic, the answer should be $6!/3!3!3$ which is not an integer.
combinatorics
See Burnside's Lemma .
â N. F. Taussig
Aug 24 at 2:39
@MishaLavrov Burnside's lemma is applicable: You let X be the set of all ways of coloring the balls with five colors such that each color is represented three times, and G be the group of rotations.
â Alex Zorn
Aug 24 at 2:58
@AlexZorn Never mind, you're right.
â Misha Lavrov
Aug 24 at 3:04
add a comment |Â
up vote
5
down vote
favorite
up vote
5
down vote
favorite
Fifteen balls including 3 each of 5 different colors are arranged in a triangle as shown. How many ways can this be done if rotations are allowed?

I was thinking the answer should be
$15!/(3*(3!)^5)$ as we can arrange 15 balls in 15 positions in 15! ways. Then since there are 3 balls of 5 different colors each, we divide it by $(3!)^5$ and then divide by 3 as rotation is allowed.
But this is not correct as if 6 balls are needed to arrange like this where there are 3 balls each of 2 different colors, by this logic, the answer should be $6!/3!3!3$ which is not an integer.
combinatorics
Fifteen balls including 3 each of 5 different colors are arranged in a triangle as shown. How many ways can this be done if rotations are allowed?

I was thinking the answer should be
$15!/(3*(3!)^5)$ as we can arrange 15 balls in 15 positions in 15! ways. Then since there are 3 balls of 5 different colors each, we divide it by $(3!)^5$ and then divide by 3 as rotation is allowed.
But this is not correct as if 6 balls are needed to arrange like this where there are 3 balls each of 2 different colors, by this logic, the answer should be $6!/3!3!3$ which is not an integer.
combinatorics
edited Aug 24 at 2:28
N. F. Taussig
38.9k93153
38.9k93153
asked Aug 24 at 2:14
ChakSayantan
916
916
See Burnside's Lemma .
â N. F. Taussig
Aug 24 at 2:39
@MishaLavrov Burnside's lemma is applicable: You let X be the set of all ways of coloring the balls with five colors such that each color is represented three times, and G be the group of rotations.
â Alex Zorn
Aug 24 at 2:58
@AlexZorn Never mind, you're right.
â Misha Lavrov
Aug 24 at 3:04
add a comment |Â
See Burnside's Lemma .
â N. F. Taussig
Aug 24 at 2:39
@MishaLavrov Burnside's lemma is applicable: You let X be the set of all ways of coloring the balls with five colors such that each color is represented three times, and G be the group of rotations.
â Alex Zorn
Aug 24 at 2:58
@AlexZorn Never mind, you're right.
â Misha Lavrov
Aug 24 at 3:04
See Burnside's Lemma .
â N. F. Taussig
Aug 24 at 2:39
See Burnside's Lemma .
â N. F. Taussig
Aug 24 at 2:39
@MishaLavrov Burnside's lemma is applicable: You let X be the set of all ways of coloring the balls with five colors such that each color is represented three times, and G be the group of rotations.
â Alex Zorn
Aug 24 at 2:58
@MishaLavrov Burnside's lemma is applicable: You let X be the set of all ways of coloring the balls with five colors such that each color is represented three times, and G be the group of rotations.
â Alex Zorn
Aug 24 at 2:58
@AlexZorn Never mind, you're right.
â Misha Lavrov
Aug 24 at 3:04
@AlexZorn Never mind, you're right.
â Misha Lavrov
Aug 24 at 3:04
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
4
down vote
accepted
This is almost exactly the correct answer. The error lies in rotationally symmetric arrangements.
The way I prefer to think about it is to say that a "picture" is a representation of an arrangement of $15$ balls where we draw all $15$ of them in a triangle (something like the image in the diagram, but colored differently). We can count the pictures easily: there are $frac15!3!^5$ pictures, because we just choose the colors of the balls. There are no rotations to worry about.
Almost every arrangement of $15$ balls has exactly $3$ pictures to go with it. However, some arrangements are rotationally symmetric, and in that case, there is only $1$ picture.
There are exactly $5!$ rotationally symmetric arrangements: up to permuting the colors of the balls, they have to be the arrangement represented by the picture below.

So there are $5!$ pictures representing $5!$ symmetric arrangements, which means that the remaining $frac15!3!^5 - 5!$ pictures represent asymmetric arrangements: ones that we should divide by $3$, because there are $3$ pictures of each arrangement.
So the final answer is
$$
5! + frac13left(frac15!3!^5 - 5!right) = frac15!3cdot 3!^5 + frac23 cdot 5!
$$
(your original answer is off by $frac23 cdot 5! = 80$).
add a comment |Â
up vote
1
down vote
We use the Polya Enumeration Theorem. The cycle index here is
$$Z(G) = frac13 a_1^15 + frac23 a_3^5.$$
We then obtain for five colors, three each
$$[A^3 B^3 C^3 D^3 E^3] Z(G; A+B+C+D+E)
\ = [A^3 B^3 C^3 D^3 E^3]
frac13 (A+B+C+D+E)^15
\ + [A^3 B^3 C^3 D^3 E^3]
frac23 (A^3+B^3+C^3+D^3+E^3)^5
\ = frac13 frac15!3!^5
+ [A B C D E]
frac23 (A+B+C+D+E)^5
\ = frac13 frac15!3!^5 + frac23 5!
= 56056080.$$
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
4
down vote
accepted
This is almost exactly the correct answer. The error lies in rotationally symmetric arrangements.
The way I prefer to think about it is to say that a "picture" is a representation of an arrangement of $15$ balls where we draw all $15$ of them in a triangle (something like the image in the diagram, but colored differently). We can count the pictures easily: there are $frac15!3!^5$ pictures, because we just choose the colors of the balls. There are no rotations to worry about.
Almost every arrangement of $15$ balls has exactly $3$ pictures to go with it. However, some arrangements are rotationally symmetric, and in that case, there is only $1$ picture.
There are exactly $5!$ rotationally symmetric arrangements: up to permuting the colors of the balls, they have to be the arrangement represented by the picture below.

So there are $5!$ pictures representing $5!$ symmetric arrangements, which means that the remaining $frac15!3!^5 - 5!$ pictures represent asymmetric arrangements: ones that we should divide by $3$, because there are $3$ pictures of each arrangement.
So the final answer is
$$
5! + frac13left(frac15!3!^5 - 5!right) = frac15!3cdot 3!^5 + frac23 cdot 5!
$$
(your original answer is off by $frac23 cdot 5! = 80$).
add a comment |Â
up vote
4
down vote
accepted
This is almost exactly the correct answer. The error lies in rotationally symmetric arrangements.
The way I prefer to think about it is to say that a "picture" is a representation of an arrangement of $15$ balls where we draw all $15$ of them in a triangle (something like the image in the diagram, but colored differently). We can count the pictures easily: there are $frac15!3!^5$ pictures, because we just choose the colors of the balls. There are no rotations to worry about.
Almost every arrangement of $15$ balls has exactly $3$ pictures to go with it. However, some arrangements are rotationally symmetric, and in that case, there is only $1$ picture.
There are exactly $5!$ rotationally symmetric arrangements: up to permuting the colors of the balls, they have to be the arrangement represented by the picture below.

So there are $5!$ pictures representing $5!$ symmetric arrangements, which means that the remaining $frac15!3!^5 - 5!$ pictures represent asymmetric arrangements: ones that we should divide by $3$, because there are $3$ pictures of each arrangement.
So the final answer is
$$
5! + frac13left(frac15!3!^5 - 5!right) = frac15!3cdot 3!^5 + frac23 cdot 5!
$$
(your original answer is off by $frac23 cdot 5! = 80$).
add a comment |Â
up vote
4
down vote
accepted
up vote
4
down vote
accepted
This is almost exactly the correct answer. The error lies in rotationally symmetric arrangements.
The way I prefer to think about it is to say that a "picture" is a representation of an arrangement of $15$ balls where we draw all $15$ of them in a triangle (something like the image in the diagram, but colored differently). We can count the pictures easily: there are $frac15!3!^5$ pictures, because we just choose the colors of the balls. There are no rotations to worry about.
Almost every arrangement of $15$ balls has exactly $3$ pictures to go with it. However, some arrangements are rotationally symmetric, and in that case, there is only $1$ picture.
There are exactly $5!$ rotationally symmetric arrangements: up to permuting the colors of the balls, they have to be the arrangement represented by the picture below.

So there are $5!$ pictures representing $5!$ symmetric arrangements, which means that the remaining $frac15!3!^5 - 5!$ pictures represent asymmetric arrangements: ones that we should divide by $3$, because there are $3$ pictures of each arrangement.
So the final answer is
$$
5! + frac13left(frac15!3!^5 - 5!right) = frac15!3cdot 3!^5 + frac23 cdot 5!
$$
(your original answer is off by $frac23 cdot 5! = 80$).
This is almost exactly the correct answer. The error lies in rotationally symmetric arrangements.
The way I prefer to think about it is to say that a "picture" is a representation of an arrangement of $15$ balls where we draw all $15$ of them in a triangle (something like the image in the diagram, but colored differently). We can count the pictures easily: there are $frac15!3!^5$ pictures, because we just choose the colors of the balls. There are no rotations to worry about.
Almost every arrangement of $15$ balls has exactly $3$ pictures to go with it. However, some arrangements are rotationally symmetric, and in that case, there is only $1$ picture.
There are exactly $5!$ rotationally symmetric arrangements: up to permuting the colors of the balls, they have to be the arrangement represented by the picture below.

So there are $5!$ pictures representing $5!$ symmetric arrangements, which means that the remaining $frac15!3!^5 - 5!$ pictures represent asymmetric arrangements: ones that we should divide by $3$, because there are $3$ pictures of each arrangement.
So the final answer is
$$
5! + frac13left(frac15!3!^5 - 5!right) = frac15!3cdot 3!^5 + frac23 cdot 5!
$$
(your original answer is off by $frac23 cdot 5! = 80$).
answered Aug 24 at 2:42
Misha Lavrov
37k54792
37k54792
add a comment |Â
add a comment |Â
up vote
1
down vote
We use the Polya Enumeration Theorem. The cycle index here is
$$Z(G) = frac13 a_1^15 + frac23 a_3^5.$$
We then obtain for five colors, three each
$$[A^3 B^3 C^3 D^3 E^3] Z(G; A+B+C+D+E)
\ = [A^3 B^3 C^3 D^3 E^3]
frac13 (A+B+C+D+E)^15
\ + [A^3 B^3 C^3 D^3 E^3]
frac23 (A^3+B^3+C^3+D^3+E^3)^5
\ = frac13 frac15!3!^5
+ [A B C D E]
frac23 (A+B+C+D+E)^5
\ = frac13 frac15!3!^5 + frac23 5!
= 56056080.$$
add a comment |Â
up vote
1
down vote
We use the Polya Enumeration Theorem. The cycle index here is
$$Z(G) = frac13 a_1^15 + frac23 a_3^5.$$
We then obtain for five colors, three each
$$[A^3 B^3 C^3 D^3 E^3] Z(G; A+B+C+D+E)
\ = [A^3 B^3 C^3 D^3 E^3]
frac13 (A+B+C+D+E)^15
\ + [A^3 B^3 C^3 D^3 E^3]
frac23 (A^3+B^3+C^3+D^3+E^3)^5
\ = frac13 frac15!3!^5
+ [A B C D E]
frac23 (A+B+C+D+E)^5
\ = frac13 frac15!3!^5 + frac23 5!
= 56056080.$$
add a comment |Â
up vote
1
down vote
up vote
1
down vote
We use the Polya Enumeration Theorem. The cycle index here is
$$Z(G) = frac13 a_1^15 + frac23 a_3^5.$$
We then obtain for five colors, three each
$$[A^3 B^3 C^3 D^3 E^3] Z(G; A+B+C+D+E)
\ = [A^3 B^3 C^3 D^3 E^3]
frac13 (A+B+C+D+E)^15
\ + [A^3 B^3 C^3 D^3 E^3]
frac23 (A^3+B^3+C^3+D^3+E^3)^5
\ = frac13 frac15!3!^5
+ [A B C D E]
frac23 (A+B+C+D+E)^5
\ = frac13 frac15!3!^5 + frac23 5!
= 56056080.$$
We use the Polya Enumeration Theorem. The cycle index here is
$$Z(G) = frac13 a_1^15 + frac23 a_3^5.$$
We then obtain for five colors, three each
$$[A^3 B^3 C^3 D^3 E^3] Z(G; A+B+C+D+E)
\ = [A^3 B^3 C^3 D^3 E^3]
frac13 (A+B+C+D+E)^15
\ + [A^3 B^3 C^3 D^3 E^3]
frac23 (A^3+B^3+C^3+D^3+E^3)^5
\ = frac13 frac15!3!^5
+ [A B C D E]
frac23 (A+B+C+D+E)^5
\ = frac13 frac15!3!^5 + frac23 5!
= 56056080.$$
answered Aug 24 at 12:28
Marko Riedel
37k334107
37k334107
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2892720%2farrangement-of-15-balls-including-3-each-of-5-different-colors-in-a-triangle%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
See Burnside's Lemma .
â N. F. Taussig
Aug 24 at 2:39
@MishaLavrov Burnside's lemma is applicable: You let X be the set of all ways of coloring the balls with five colors such that each color is represented three times, and G be the group of rotations.
â Alex Zorn
Aug 24 at 2:58
@AlexZorn Never mind, you're right.
â Misha Lavrov
Aug 24 at 3:04