MathDB
Partitioning regular hexagons into congruent polygons

Source: Baltic Way 2017, Problem 9

November 26, 2017
combinatoricscombinatorics proposedcombinatorial geometryhexagon

Problem Statement

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.
Back to ProblemsView on AoPS