Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (anonymous):

Find the number of necklaces that can be made Usin 3 beads of one kind and 9 beads of the other kind.

OpenStudy (anonymous):

Is it possible to generalize the above obtained result?

OpenStudy (anonymous):

(9! 3!)/2

OpenStudy (anonymous):

That is not correct.

OpenStudy (anonymous):

@experimentX

OpenStudy (experimentx):

circular permutation ,,, have to check for circular symmetry.

OpenStudy (anonymous):

Why do you say so?

OpenStudy (anonymous):

As in the 18.

OpenStudy (experimentx):

lol ... can't be 18 ... should be pretty close though

OpenStudy (anonymous):

It is. But what is the best way to solve for this? And, how'd you approximate it, man?

OpenStudy (experimentx):

lol .. really? ... all i know is it should be pretty close to this figure. \[ \binom{12}{3} \over 12\]

OpenStudy (anonymous):

Okay. Yeah. Makes sense. Then,?

OpenStudy (experimentx):

I've seen this problem before ... i know a bit rigorous method. counting 111000000000 ---- 1 <-- for this type 101100000000 ---- 10-3 = 7 <-- check out for symmetry (incorrect)

OpenStudy (experimentx):

100001100000 <--- only 4 due to circular symmetry.

OpenStudy (experimentx):

101010000000 <-- for this type ... only 1

OpenStudy (experimentx):

looks like we should be hunting down asymmetric cases.

OpenStudy (experimentx):

for all symmetric cases we will have 1 ... let's check out symmetric cases.

OpenStudy (anonymous):

What is this youre doing again. In the sense what is 101010 mean?

OpenStudy (experimentx):

1 <-- type 1 0 <-- type 2

OpenStudy (anonymous):

Okay.

OpenStudy (experimentx):

the figure can be more than 18 (might be ...)

OpenStudy (experimentx):

symmetric cases 111000000000 101010000000 100100100000 100010001000 seems only three symmetric cases.

OpenStudy (anonymous):

Isnt brute force not a very good way. I dunno. It might work for this but we could never generalize it which is the next part of the question.

OpenStudy (experimentx):

honestly ... i don't know. let's try using brute force for now ... something might happen asymmetric cases 101100000000 101010000000 101000100000 101000010000 <--- from the other side ... this is enough

OpenStudy (experimentx):

101100000000 < 4 101010000000 < 3 101000100000 < 2 101000010000 < 1 where are the other cases missing?

OpenStudy (experimentx):

101100000000 < 5 101010000000 < 4 101001000000 < 3 101000100000 < 2 101000010000 < 1

OpenStudy (experimentx):

with 3 symmetric cases we have total of 18 permutations. looks like we can generalize.

OpenStudy (experimentx):

@siddhantsharan you still there?

OpenStudy (experimentx):

let's try this will 3 type 1 beads and 10 type 2 beads.

OpenStudy (anonymous):

Okay. I'm back. Sorry.

OpenStudy (experimentx):

Oh ... i'm back too.

OpenStudy (anonymous):

Hmm. How about this. Let the 3 beads be like: |dw:1347732072259:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!