ÖMO 2017 Problem 2
A necklace contains 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 blue pearls to a necklace that contains one green pearl and blue pearls?
Proposed byTheresia Eisenkölbl
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.