olymmath

RU-SPB 2018 Problem 103

  • Grade 10

nn coins lies in the circle. If two neighbour coins lies both head up or both tail up, then we can flip both. How many variants of coins are available that can not be obtained from each other by applying such operations?

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.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ru-spb/2018/p103 · Tag BCJGZ5B47X · Edit this page on GitHub · Keys: j next, k previous