RU-ALLRUSSIAN 1964 Problem 9
- Answer
Given a lattice of regular hexagons. A bug crawls from vertex A to vertex B along edges of the hexagons, taking the shortest possible path (or one of them). Prove that it travels a distance at least AB/2 in one direction. If it travels exactly AB/2 in one direction, how many edges does it traverse?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
3
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.