MathDB
Tiling with trapezoids in an equilateral grid

Source: Greek 2nd TST 2013-pr4

May 25, 2016
trapezoidcombinatoricsTiling

Problem Statement

Let nn be a positive integer. An equilateral triangle with side nn will be denoted by TnT_n and is divided in n2n^2 unit equilateral triangles with sides parallel to the initial, forming a grid. We will call "trapezoid" the trapezoid which is formed by three equilateral triangles (one base is equal to one and the other is equal to two). Let also mm be a positive integer with m<nm<n and suppose that TnT_n and TmT_m can be tiled with "trapezoids". Prove that, if from TnT_n we remove a TmT_m with the same orientation, then the rest can be tiled with "trapezoids".