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

In how many ways can u arrange m black bead and n white bead in a necklace?

OpenStudy (anonymous):

@experimentX PLZ try this if u r free.

OpenStudy (experimentx):

probably we should work out on the other particular case ... generalizing these would be difficult.

OpenStudy (experimentx):

i was working on that list .... could you correct it. like in that 120 numbers, how many digits are repeated twice and how many are repeated thrice ... and how many are not repeating.

OpenStudy (anonymous):

you want this in terms of m and n? its very similar to flipping heads in a row, with heads = black, tails = white etc

OpenStudy (anonymous):

Yes interms of m and n

OpenStudy (anonymous):

i will think about it :)

OpenStudy (anonymous):

U mean it is like flipping a coin

OpenStudy (anonymous):

yes sorry im tired, what list are you getting these problems from? sounds interesting.

OpenStudy (anonymous):

thanks

OpenStudy (anonymous):

If we have a number x then in how many unique ways can we break it?

OpenStudy (anonymous):

Suppose x=3 Then 3 , 1+2 , 1+1+1

OpenStudy (anonymous):

I think if we can do that then we are not so far from the solution

OpenStudy (anonymous):

okay ive been working on this for a while, im not sure how usefull this is but... if s is the total amount of beads in the necklace, m is black beads, n is white beads and C is the amount of configurations then: for n = s\[C = 2^s\] for n = s -1\[C = 2^s - 1\] for n = s - 2 \[C = 2^s -1 - s\] for n = s - 3 \[C= 2^s - 1 - s - (s - 1) - (s - 2) - (s -3)\]

OpenStudy (anonymous):

as you would expect this is symetrical so it works just as well for m as it does for n

OpenStudy (anonymous):

also you can do it with n and m at the same time, so say you have a 4 beaded necklace, s = 4, and lets say you have a bag of 2 black and 3 white beads, m = 2 n = 3 so that n = s - 1 and m = s - 2. you will have. \[C = 2^s - 1 - s - 1 \] configurations

OpenStudy (anonymous):

obviously this is far from complete, as it only works fully for cases when n > s - 4 and m > s - 4.

OpenStudy (anonymous):

Each time you add a new bead, you have 2 choices. So in total there will be \(2^{(m+k)}\) ways of arranging the beads.

OpenStudy (anonymous):

Does that take into account the (circular) symmetry?

OpenStudy (anonymous):

I guess yes

OpenStudy (anonymous):

@Traxter I dont think that works

OpenStudy (anonymous):

What I mean is that some patterns will be repeated due to the symmetry on the circle(neclace) It's not the same as slaying them out in a line

OpenStudy (anonymous):

Opps

OpenStudy (anonymous):

Probably you would have to divide through by (m+n)....

OpenStudy (anonymous):

|dw:1350048628320:dw||dw:1350048631821: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!