BALTIC-WAY 2018 Problem 7
- Answer
On a torus as shown all 512 edges are colored red or blue. A coloring is good if every vertex is an endpoint of an even number of red edges. A move consists of switching the color of each of the 4 edges of an arbitrary cell. What is the largest number of good colorings such that none of them can be converted to another by a sequence of moves?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
4
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.