Daily

Random

Practice set

Baltic Way 2017 · Problem 9

Combinatorics

A positive integer nn is Danish if a regular hexagon can be partitioned into nn congruent polygons. Prove that there are infinitely many positive integers nn such that both nn and 2n+n2^{n}+n are Danish.

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Pigeonhole and extremal arguments

Solutions

Solution

At first we note that n=3kn=3 k is danish for any positive integer kk, because a hexagon can be cut in 3 equal parallelograms each of which can afterwards be cut in kk equal parallelograms (Fig 1).

Furthermore a hexagon can be cut into two equal trapezoids (Fig. 2) each of which can afterwards be cut into 4 equal trapezoids of the same shape (Fig. 3) and so on. Therefore any number of the form n=2⋅4kn=2 \cdot 4^{k} is also danish.

Official solution diagram for Baltic Way 2017 Problem 9 (Figure 1).

Figure 1

Official solution diagram for Baltic Way 2017 Problem 9 (Figure 2).

Figure 2

Official solution diagram for Baltic Way 2017 Problem 9 (Figure 3).

Figure 3

If we take any danish number n=2⋅4kn=2 \cdot 4^{k} of the second type, then

2n+n=22⋅4k+2⋅4k≡1+2≡0( mod 3)2^{n}+n=2^{2 \cdot 4^{k}}+2 \cdot 4^{k} \equiv 1+2 \equiv 0(\bmod 3)

showing that 2n+n2^{n}+n is also a danish number.

Contest context

Results from Baltic Way 2017

11 teams

Mean score
1.4 / 5
Scores of 4 or 5
2 / 11
Estonia
3 / 5

Score distribution

06
12
20
31
40
52
All team scores
TeamScore
St. Petersburg1 / 5
Germany0 / 5
Poland1 / 5
Denmark0 / 5
Estonia3 / 5
Lithuania5 / 5
Sweden5 / 5
Norway0 / 5
Finland0 / 5
Iceland0 / 5
Latvia0 / 5