Necklace combinatorics problem











up vote
0
down vote

favorite












If $n$ is the number of necklaces which can be formed using $17$ identical pearls and two identical diamonds and similarly $m$ is the number of necklaces which can be formed using $17$ identical pearls and $2$ different diamonds, then the value of $m$ and $n$ is?






combinatorics permutations







share|cite|improve this question
























  • What have you done so far? Where are you stuck? Can you figure out the problem if $17$ was a smaller number like $3$ or $4$, for example? Try to extend that logic.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:09












  • Well I am not sure how to start
    – Saumil Sood
    Nov 21 at 4:10










  • In both questions, it is about where to place the diamonds. For example, let us call the diamonds $D$ (for the first question, where they are the same). Draw the skeleton of a necklace, and find out in how many ways can you place the two diamonds. The pearls will have to go in the other places, right?
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:13






  • 1




    Very good. In how many ways can you select two places? Remember, we are talking about places in a necklace, which loops back into itself, so only the distance between the two diamonds matters.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:19















up vote
0
down vote

favorite












If $n$ is the number of necklaces which can be formed using $17$ identical pearls and two identical diamonds and similarly $m$ is the number of necklaces which can be formed using $17$ identical pearls and $2$ different diamonds, then the value of $m$ and $n$ is?






combinatorics permutations







share|cite|improve this question
























  • What have you done so far? Where are you stuck? Can you figure out the problem if $17$ was a smaller number like $3$ or $4$, for example? Try to extend that logic.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:09












  • Well I am not sure how to start
    – Saumil Sood
    Nov 21 at 4:10










  • In both questions, it is about where to place the diamonds. For example, let us call the diamonds $D$ (for the first question, where they are the same). Draw the skeleton of a necklace, and find out in how many ways can you place the two diamonds. The pearls will have to go in the other places, right?
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:13






  • 1




    Very good. In how many ways can you select two places? Remember, we are talking about places in a necklace, which loops back into itself, so only the distance between the two diamonds matters.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:19













up vote
0
down vote

favorite









up vote
0
down vote

favorite











If $n$ is the number of necklaces which can be formed using $17$ identical pearls and two identical diamonds and similarly $m$ is the number of necklaces which can be formed using $17$ identical pearls and $2$ different diamonds, then the value of $m$ and $n$ is?






combinatorics permutations







share|cite|improve this question















If $n$ is the number of necklaces which can be formed using $17$ identical pearls and two identical diamonds and similarly $m$ is the number of necklaces which can be formed using $17$ identical pearls and $2$ different diamonds, then the value of $m$ and $n$ is?






combinatorics permutations




combinatorics permutations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 21 at 5:06









David G. Stork

9,48721232




9,48721232










asked Nov 21 at 4:07









Saumil Sood

93




93












  • What have you done so far? Where are you stuck? Can you figure out the problem if $17$ was a smaller number like $3$ or $4$, for example? Try to extend that logic.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:09












  • Well I am not sure how to start
    – Saumil Sood
    Nov 21 at 4:10










  • In both questions, it is about where to place the diamonds. For example, let us call the diamonds $D$ (for the first question, where they are the same). Draw the skeleton of a necklace, and find out in how many ways can you place the two diamonds. The pearls will have to go in the other places, right?
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:13






  • 1




    Very good. In how many ways can you select two places? Remember, we are talking about places in a necklace, which loops back into itself, so only the distance between the two diamonds matters.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:19


















  • What have you done so far? Where are you stuck? Can you figure out the problem if $17$ was a smaller number like $3$ or $4$, for example? Try to extend that logic.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:09












  • Well I am not sure how to start
    – Saumil Sood
    Nov 21 at 4:10










  • In both questions, it is about where to place the diamonds. For example, let us call the diamonds $D$ (for the first question, where they are the same). Draw the skeleton of a necklace, and find out in how many ways can you place the two diamonds. The pearls will have to go in the other places, right?
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:13






  • 1




    Very good. In how many ways can you select two places? Remember, we are talking about places in a necklace, which loops back into itself, so only the distance between the two diamonds matters.
    – астон вілла олоф мэллбэрг
    Nov 21 at 4:19
















What have you done so far? Where are you stuck? Can you figure out the problem if $17$ was a smaller number like $3$ or $4$, for example? Try to extend that logic.
– астон вілла олоф мэллбэрг
Nov 21 at 4:09






What have you done so far? Where are you stuck? Can you figure out the problem if $17$ was a smaller number like $3$ or $4$, for example? Try to extend that logic.
– астон вілла олоф мэллбэрг
Nov 21 at 4:09














Well I am not sure how to start
– Saumil Sood
Nov 21 at 4:10




Well I am not sure how to start
– Saumil Sood
Nov 21 at 4:10












In both questions, it is about where to place the diamonds. For example, let us call the diamonds $D$ (for the first question, where they are the same). Draw the skeleton of a necklace, and find out in how many ways can you place the two diamonds. The pearls will have to go in the other places, right?
– астон вілла олоф мэллбэрг
Nov 21 at 4:13




In both questions, it is about where to place the diamonds. For example, let us call the diamonds $D$ (for the first question, where they are the same). Draw the skeleton of a necklace, and find out in how many ways can you place the two diamonds. The pearls will have to go in the other places, right?
– астон вілла олоф мэллбэрг
Nov 21 at 4:13




1




1




Very good. In how many ways can you select two places? Remember, we are talking about places in a necklace, which loops back into itself, so only the distance between the two diamonds matters.
– астон вілла олоф мэллбэрг
Nov 21 at 4:19




Very good. In how many ways can you select two places? Remember, we are talking about places in a necklace, which loops back into itself, so only the distance between the two diamonds matters.
– астон вілла олоф мэллбэрг
Nov 21 at 4:19










1 Answer
1






active

oldest

votes

















up vote
0
down vote













Use Burnside's Lemma.




If $G$ is a finite group of permutations on a set $S$, then the number of orbits of $G$ on $S$ is
begin{align}
frac{1}{|G|}sum_{g in G}|operatorname{fix}(g)|.
end{align}




Observe there are $binom{19}{2}=171$ possible designs (of course, some of them are equivalent by rotation and reflection). Let $G = D_{38}$ act on the $171$ necklace designs. Observe we see that
begin{matrix}
text{element} & text{Number of Designs Fixed by Element}\
e & 171\
r^k, k=1,ldots, 18 & 0\
f & 9\
fr^k, k=1,ldots, 18 & 9
end{matrix}
Hence by Burnside's lemma, we see that
begin{align}
frac{1}{38}(171+9+9*18) = 9.
end{align}



Indeed, one possible configuration is that the two diamonds are $1$ apart on one side and $16$ apart on the other side or $3$ apart on one side and $14$ apart on the other side...until $17$ apart on one side and $0$ apart on the other side. Hence $9$ configurations.






share|cite|improve this answer





















  • Isn't this overkill...
    – YiFan
    Nov 21 at 4:56










  • @YiFan Yes. But my last paragraph gives a simple proof.
    – Jacky Chong
    Nov 21 at 4:57










  • I don't know this Theorem, can you tell any other method. Thanks
    – Saumil Sood
    Nov 21 at 14:16











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007252%2fnecklace-combinatorics-problem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
0
down vote













Use Burnside's Lemma.




If $G$ is a finite group of permutations on a set $S$, then the number of orbits of $G$ on $S$ is
begin{align}
frac{1}{|G|}sum_{g in G}|operatorname{fix}(g)|.
end{align}




Observe there are $binom{19}{2}=171$ possible designs (of course, some of them are equivalent by rotation and reflection). Let $G = D_{38}$ act on the $171$ necklace designs. Observe we see that
begin{matrix}
text{element} & text{Number of Designs Fixed by Element}\
e & 171\
r^k, k=1,ldots, 18 & 0\
f & 9\
fr^k, k=1,ldots, 18 & 9
end{matrix}
Hence by Burnside's lemma, we see that
begin{align}
frac{1}{38}(171+9+9*18) = 9.
end{align}



Indeed, one possible configuration is that the two diamonds are $1$ apart on one side and $16$ apart on the other side or $3$ apart on one side and $14$ apart on the other side...until $17$ apart on one side and $0$ apart on the other side. Hence $9$ configurations.






share|cite|improve this answer





















  • Isn't this overkill...
    – YiFan
    Nov 21 at 4:56










  • @YiFan Yes. But my last paragraph gives a simple proof.
    – Jacky Chong
    Nov 21 at 4:57










  • I don't know this Theorem, can you tell any other method. Thanks
    – Saumil Sood
    Nov 21 at 14:16















up vote
0
down vote













Use Burnside's Lemma.




If $G$ is a finite group of permutations on a set $S$, then the number of orbits of $G$ on $S$ is
begin{align}
frac{1}{|G|}sum_{g in G}|operatorname{fix}(g)|.
end{align}




Observe there are $binom{19}{2}=171$ possible designs (of course, some of them are equivalent by rotation and reflection). Let $G = D_{38}$ act on the $171$ necklace designs. Observe we see that
begin{matrix}
text{element} & text{Number of Designs Fixed by Element}\
e & 171\
r^k, k=1,ldots, 18 & 0\
f & 9\
fr^k, k=1,ldots, 18 & 9
end{matrix}
Hence by Burnside's lemma, we see that
begin{align}
frac{1}{38}(171+9+9*18) = 9.
end{align}



Indeed, one possible configuration is that the two diamonds are $1$ apart on one side and $16$ apart on the other side or $3$ apart on one side and $14$ apart on the other side...until $17$ apart on one side and $0$ apart on the other side. Hence $9$ configurations.






share|cite|improve this answer





















  • Isn't this overkill...
    – YiFan
    Nov 21 at 4:56










  • @YiFan Yes. But my last paragraph gives a simple proof.
    – Jacky Chong
    Nov 21 at 4:57










  • I don't know this Theorem, can you tell any other method. Thanks
    – Saumil Sood
    Nov 21 at 14:16













up vote
0
down vote










up vote
0
down vote









Use Burnside's Lemma.




If $G$ is a finite group of permutations on a set $S$, then the number of orbits of $G$ on $S$ is
begin{align}
frac{1}{|G|}sum_{g in G}|operatorname{fix}(g)|.
end{align}




Observe there are $binom{19}{2}=171$ possible designs (of course, some of them are equivalent by rotation and reflection). Let $G = D_{38}$ act on the $171$ necklace designs. Observe we see that
begin{matrix}
text{element} & text{Number of Designs Fixed by Element}\
e & 171\
r^k, k=1,ldots, 18 & 0\
f & 9\
fr^k, k=1,ldots, 18 & 9
end{matrix}
Hence by Burnside's lemma, we see that
begin{align}
frac{1}{38}(171+9+9*18) = 9.
end{align}



Indeed, one possible configuration is that the two diamonds are $1$ apart on one side and $16$ apart on the other side or $3$ apart on one side and $14$ apart on the other side...until $17$ apart on one side and $0$ apart on the other side. Hence $9$ configurations.






share|cite|improve this answer












Use Burnside's Lemma.




If $G$ is a finite group of permutations on a set $S$, then the number of orbits of $G$ on $S$ is
begin{align}
frac{1}{|G|}sum_{g in G}|operatorname{fix}(g)|.
end{align}




Observe there are $binom{19}{2}=171$ possible designs (of course, some of them are equivalent by rotation and reflection). Let $G = D_{38}$ act on the $171$ necklace designs. Observe we see that
begin{matrix}
text{element} & text{Number of Designs Fixed by Element}\
e & 171\
r^k, k=1,ldots, 18 & 0\
f & 9\
fr^k, k=1,ldots, 18 & 9
end{matrix}
Hence by Burnside's lemma, we see that
begin{align}
frac{1}{38}(171+9+9*18) = 9.
end{align}



Indeed, one possible configuration is that the two diamonds are $1$ apart on one side and $16$ apart on the other side or $3$ apart on one side and $14$ apart on the other side...until $17$ apart on one side and $0$ apart on the other side. Hence $9$ configurations.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 21 at 4:52









Jacky Chong

17.5k21128




17.5k21128












  • Isn't this overkill...
    – YiFan
    Nov 21 at 4:56










  • @YiFan Yes. But my last paragraph gives a simple proof.
    – Jacky Chong
    Nov 21 at 4:57










  • I don't know this Theorem, can you tell any other method. Thanks
    – Saumil Sood
    Nov 21 at 14:16


















  • Isn't this overkill...
    – YiFan
    Nov 21 at 4:56










  • @YiFan Yes. But my last paragraph gives a simple proof.
    – Jacky Chong
    Nov 21 at 4:57










  • I don't know this Theorem, can you tell any other method. Thanks
    – Saumil Sood
    Nov 21 at 14:16
















Isn't this overkill...
– YiFan
Nov 21 at 4:56




Isn't this overkill...
– YiFan
Nov 21 at 4:56












@YiFan Yes. But my last paragraph gives a simple proof.
– Jacky Chong
Nov 21 at 4:57




@YiFan Yes. But my last paragraph gives a simple proof.
– Jacky Chong
Nov 21 at 4:57












I don't know this Theorem, can you tell any other method. Thanks
– Saumil Sood
Nov 21 at 14:16




I don't know this Theorem, can you tell any other method. Thanks
– Saumil Sood
Nov 21 at 14:16


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007252%2fnecklace-combinatorics-problem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Plaza Victoria

Image
Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
Read more

Puebla de Zaragoza

Image
Para otros usos de este término, véase Puebla (desambiguación). Heroica Puebla de Zaragoza Localidad De arriba a abajo de izquierda a derecha: Estrella de Puebla, Volcán Popocatépetl, Catedral de Puebla, Monumento a Ignacio Zaragoza, Estadio Cuauhtémoc, Angelópolis y Vista panorámica de la ciudad. Escudo Otros nombres: El relicario de América/ La ciudad de los Ángeles/ La Angelópolis Lema: Muy noble y muy leal ciudad de Puebla de los Ángeles Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en México Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en Puebla Mapa interactivo Coordenadas 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Coordenadas: 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Idioma oficial Español Entidad Localidad  • País   México  • Estado Puebla  • Municipio Puebla Presidente municipal Claudia Rivera Vivanc
Read more

Musa

Image
Para el género de plantas, véase Musa (planta). Apolo y la Nueve Musas En la mitología griega, las musas (en griego antiguo μοῦσαι « mousai» ) son, según los escritores más antiguos, las divinidades inspiradoras de las Artes: cada una de ellas está relacionada con ramas artísticas y del conocimiento. Son hijas de Zeus y de Mnemósine, compañeras del séquito de Apolo, dios olímpico de la música y patrón de las bellas artes, quien tuvo romances con cada una de ellas, dejando descendientes. Bajaban a la tierra a susurrar ideas e inspirar a aquellos mortales que las invocaran. En la época más arcaica eran las ninfas inspiradoras de las fuentes, en las cuales eran adoradas. Finalmente, alrededor de los siglos VIII-VII a. C. [ 1 ] ​ prevaleció en todo el territorio de la Hélade la adoración de las nueve Musas, que son Calíope, Clío, Erato, Euterpe, Melpómene, Polimnia, Talía, Terpsícore y Urania. El culto a las musas era originalmente de Tracia y Beocia, y fueron de vital impo
Read more