Daily

Random

Practice set

Baltic Way 2025 · Problem 9

Combinatorics

A Baltic polyiamond is an nn-gon with side lengths n,n−1,…,2,1n,n-1,\ldots,2,1 in exactly this order, and all internal angles 120∘120^\circ or 240∘240^\circ. Prove that for every Baltic polyiamond, nn is divisible by 6.

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Pigeonhole and extremal arguments

Solutions

Solution

We start with a lemma.

Lemma 1. If all interior angles of an nn-gon are 120∘120^\circ or 240∘240^\circ, then nn is even.

Proof. If aa angles are 120∘120^\circ and bb angles are 240∘240^\circ, then

180∘(n−2)=120∘a+240∘b,180^\circ(n-2)=120^\circ a+240^\circ b,

so

3(n−2)=2a+4b.3(n-2)=2a+4b.

The right-hand side is even, hence nn is even.

Introduce six unit vectors

a=(1,0),b=(12,32),c=(−12,32),d=(−1,0),e=(−12,−32),f=(12,−32).\begin{aligned} \mathbf a&=(1,0),& \mathbf b&=\left(\frac12,\frac{\sqrt3}{2}\right),& \mathbf c&=\left(-\frac12,\frac{\sqrt3}{2}\right),\\ \mathbf d&=(-1,0),& \mathbf e&=\left(-\frac12,-\frac{\sqrt3}{2}\right),& \mathbf f&=\left(\frac12,-\frac{\sqrt3}{2}\right). \end{aligned}

Each vector is obtained from the preceding one by a 60∘60^\circ counterclockwise rotation. Since the consecutive side lengths n,n−1,…,2,1n,n-1,\ldots,2,1 are fixed, a Baltic polyiamond can be encoded by the directions of its side vectors.

For example, one possible 1212-gon is encoded by

ABCDEDEFAFAB,A B C D E D E F A F A B,

with side vectors

12a,11b,10c,9d,8e,7d,6e,5f,4a,3f,2a,b,12\mathbf a,11\mathbf b,10\mathbf c,9\mathbf d,8\mathbf e,7\mathbf d, 6\mathbf e,5\mathbf f,4\mathbf a,3\mathbf f,2\mathbf a,\mathbf b,

whose sum is (0,0)(0,0).

Call the vertex where the side of length nn meets the side of length 11 the origin. Without loss of generality, rotate the polyiamond so that its longest side has direction AA.

Lemma 2. An encoding of a Baltic polyiamond starting with AA consists of pairs

AB, AF, CB, CD, ED, EFAB,\ AF,\ CB,\ CD,\ ED,\ EF

in some order.

Proof. A side in direction AA, CC, or EE can be followed only by a direction immediately preceding or following it in the cyclic list A,B,C,D,E,FA,B,C,D,E,F. For example, AA can be followed by FF or BB; following it by EE or CC would create an acute interior angle, while following it by AA or DD does not give the permitted turn. The same argument applies to CC and EE. Hence side directions alternate between {A,C,E}\{A,C,E\} and {B,D,F}\{B,D,F\}, giving precisely the six listed pairs.

Lemma 3. Colour the triangular lattice with colours 0,1,20,1,2 modulo 33 as follows: if a lattice point is written as ra+sbr\mathbf a+s\mathbf b with integers r,sr,s, give it colour r−s(mod3)r-s\pmod3. If the origin has colour 00, then after every two sides of a Baltic polyiamond the colour increases by 11 modulo 33.

Proof. By Lemma 2 it is enough, using the 120∘120^\circ rotational symmetry of the colouring, to check the pairs ABAB and AFAF.

For ABAB, the displacement along consecutive sides of lengths 2k2k and 2k−12k-1 is

2ka+(2k−1)b=2k(a+b)−b.2k\mathbf a+(2k-1)\mathbf b=2k(\mathbf a+\mathbf b)-\mathbf b.

The vector 2k(a+b)2k(\mathbf a+\mathbf b) changes the colour by 2k(1−1)=02k(1-1)=0, while −b-\mathbf b changes it by 11 modulo 33.

Similarly,

2ka+(2k−1)f=2k(a+f)−f,2k\mathbf a+(2k-1)\mathbf f=2k(\mathbf a+\mathbf f)-\mathbf f,

and the first term preserves the colour while −f-\mathbf f increases it by 11 modulo 33.

Thus every pair of sides increases the colour by 11 modulo 33. After all nn sides the polygon returns to its origin, so the number n/2n/2 of side pairs is divisible by 33. Therefore 6∣n6\mid n.

Contest context

Results from Baltic Way 2025

11 teams

Mean score
1.2 / 5
Scores of 4 or 5
1 / 11
Estonia
1 / 5

Score distribution

04
15
20
31
40
51
All team scores
TeamScore
Germany0 / 5
Estonia1 / 5
Poland1 / 5
Lithuania0 / 5
Norway0 / 5
Latvia3 / 5
Finland1 / 5
Denmark1 / 5
Sweden5 / 5
Ukraine1 / 5
Iceland0 / 5