MHB Is Two-Colour Bead Necklace Arrangement Possible?

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Bead
Click For Summary
A necklace with 64 beads in 8 different colors can be arranged to show every possible succession of two colors exactly once, which is known as a De Bruijn sequence. This specific sequence is referred to as B(8,2) and can be visualized with colors labeled from 0 to 7. The arrangement forms a cyclic sequence, allowing traversal in either direction. The existence of such sequences can be proven through established mathematical constructions and references, such as West's Introduction to Graph Theory. Therefore, it is indeed possible to create the desired necklace arrangement.
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

We have a necklace with $64$ beads from $8$ different colours. Is it possible that they are put in such a way that if we go along the necklace in one direction (in any of the two) then we see all the possible successions of two colours exactly once?
 
Physics news on Phys.org
evinda said:
Hello! (Wave)

We have a necklace with $64$ beads from $8$ different colours. Is it possible that they are put in such a way that if we go along the necklace in one direction (in any of the two) then we see all the possible successions of two colours exactly once?
This is called a De Bruijn sequence. (I'm assuming that the necklace is joined up at the ends so as to form a cyclic sequence of beads.)

The sequence that you want is the De Bruijn sequence $B(8,2)$. If you want to see an example, here it is (with the colours labelled $0$ to $7$).

[sp]http://www.hakank.org/comb/debruijn.cgi?k=8&n=2&submit=Ok[/sp]
 
Opalg said:
This is called a De Bruijn sequence. (I'm assuming that the necklace is joined up at the ends so as to form a cyclic sequence of beads.)

The sequence that you want is the De Bruijn sequence $B(8,2)$. If you want to see an example, here it is (with the colours labelled $0$ to $7$).

[sp]http://www.hakank.org/comb/debruijn.cgi?k=8&n=2&submit=Ok[/sp]

And how could we prove that such a sequence exists? (Thinking)
 
evinda said:
And how could we prove that such a sequence exists? (Thinking)
The construction of $B(2, 4)$ is illustrated in the wiki article. That should explain how to construct such sequences. You can see the proof of the general statement in West's Introduction to Graph Theory. Look for "De-Bruijn Cycles" in the index.
 
There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 40 ·
2
Replies
40
Views
4K