MathDB
The spider can always catch the fly

Source: Baltic Way 1993

June 15, 2012
combinatorics unsolvedcombinatorics

Problem Statement

An equilateral triangle is divided into n2n^2 congruent equilateral triangles. A spider stands at one of the vertices, a fly at another. Alternately each of them moves to a neighbouring vertex. Prove that the spider can always catch the fly.