Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2007-part-03 — 185 problems (EN–VI) Question 30

Math Olympiad Vault · MathNet 2007-part-03 — 185 problems (EN–VI)

Question 30

Consider a cube with edge length $2a$. In every vertex, at the midpoint of every edge and at the centre of every face there is a city. Two cities are connected by a road if their distance is $a$. Is there a route that passes through every city exactly once?