MathDB

A necklace contains

2016

pearls, each of which has one of the colours black, green or blue. In each step we replace simultaneously each pearl with a new pearl, where the colour of the new pearl is determined as follows: If the two original neighbours were of the same colour, the new pearl has their colour. If the neighbours had two different colours, the new pearl has the third colour. (a) Is there such a necklace that can be transformed with such steps to a necklace of blue pearls if half of the pearls were black and half of the pearls were green at the start? (b) Is there such a necklace that can be transformed with such steps to a necklace of blue pearls if thousand of the pearls were black at the start and the rest green? (c) Is it possible to transform a necklace that contains exactly two adjacent black pearls and

2014

blue pearls to a necklace that contains one green pearl and

2015

blue pearls? Proposed byTheresia Eisenkölbl

Problem Statement