MathForces: Math Olympiads
MathForces - Math Olympiadsβeta
Login Register

Rotating Hexagon

Author: mathforces
Problem has been solved: 2 times

Русский язык | English Language



The regular hexagon $ ABCDEF $ with a side length of 25 was divided into rhombuses with angles of 60 and 120 degrees with a length of side 1. In one move, you can select any three pairwise adjacent rhombuses that form a regular hexagon with a length of side 1, and rotate them 60 degrees relative to the center of this hexagon. Find the minimum positive integer $ N $ such that from any of our partition of the hexagon $ ABCDEF $ you can get any other such partition in $N$ moves.





Sorry, you need to login into your account