Kvant Math Problem 1213

Verified: no
Verdicts: SKIP + SKIP
Solve time: 1m13s
Source on kvant.digital

Problem

Prove that if a certain convex hexagon can be divided into $N$ parallelograms of equal area, then

it has a center of symmetry;
the number $N$ is divisible by 3.

V. V. Proizvolov

Tournament of Towns (Autumn, 1989)

Exploration

Consider a convex hexagon that can be subdivided into $N$ parallelograms of equal area. Begin with simple examples. A regular hexagon can be tiled by three parallelograms formed by connecting opposite vertices, each of equal area, suggesting that $N$ can be divisible by 3. Attempting to tile a general convex hexagon with two parallelograms fails immediately because a convex hexagon cannot be partitioned into two congruent-area parallelograms without introducing degeneracy, hinting that $N$ must have further divisibility constraints.

Examine the geometry of one parallelogram in such a tiling. Each parallelogram contributes a vector sum of its sides; in a closed polygon, the sum of all side vectors must vanish. Therefore, the configuration of parallelograms imposes strong symmetry constraints on the hexagon. Experimenting with different tilings suggests that any decomposition into parallelograms naturally aligns pairs of opposite sides, hinting at a center of symmetry.

A possible failure mode is a tiling with a large number of thin parallelograms clustered on one side; this raises the question whether the symmetry claim can fail if the parallelograms are not “balanced.” Tracking side vectors and areas in small numerical examples confirms that the only way to maintain equal areas for all parallelograms while covering the convex hexagon is for opposite sides to correspond, which enforces a central point equidistant from these pairs.

The core insight is that any decomposition into equal-area parallelograms forces the hexagon to have three pairs of opposite sides in parallel and equal length, producing both a center of symmetry and a restriction on the number of parallelograms: they must be a multiple of three.

Problem Understanding

The problem asks to prove two facts about a convex hexagon that can be partitioned into $N$ parallelograms of equal area: first, that it has a center of symmetry, and second, that $N$ is divisible by three. This is a Type B problem because the statement to be proved is given; no classification or extremal argument is required. The core difficulty lies in translating the combinatorial condition on the number of parallelograms into geometric constraints on the hexagon. The equality of areas across the parallelograms imposes structural restrictions that produce symmetry and divisibility conditions.

Proof Architecture

Lemma 1: In any decomposition of a convex hexagon into parallelograms of equal area, the sum of the vectors along the edges of the parallelograms reproduces the hexagon's perimeter vectorially, forcing opposite sides of the hexagon to be parallel and equal in length. This follows from the closure of vector sums around each parallelogram.

Lemma 2: Any convex hexagon with three pairs of opposite sides parallel and equal in length has a center of symmetry. This is a standard fact in convex geometry and can be verified by intersecting the midlines connecting opposite vertices.

Lemma 3: A convex hexagon decomposable into equal-area parallelograms must have the number of parallelograms divisible by three, because each parallelogram contributes to the area of three congruent trapezoidal sectors around the center. This relies on counting contributions of the parallelograms to triples of triangular areas forming around the center.

The hardest part is Lemma 1, because it is not immediately obvious that any decomposition into equal-area parallelograms forces opposite sides to be parallel. Lemma 3 is delicate because it requires translating area equality into a divisibility argument for $N$.

Solution

Let the convex hexagon be denoted $A_1A_2A_3A_4A_5A_6$. Suppose it can be decomposed into $N$ parallelograms $P_1, \dots, P_N$ of equal area $S$. Consider the vector representation of each parallelogram: each parallelogram has sides represented by vectors $\mathbf{u}$ and $\mathbf{v}$, and the sum of its sides in cyclic order is zero.

Label the vertices of each parallelogram along the decomposition consistently so that the hexagon's perimeter can be expressed as the sum of the sides of the constituent parallelograms, with each internal edge counted twice with opposite signs. Summing over all parallelograms, the contributions from internal edges cancel, leaving only the sum of the perimeter vectors of the hexagon, which must itself sum to zero. This implies that the hexagon can be expressed as a Minkowski sum of the vectors representing three fundamental directions corresponding to the sides of the parallelograms. Consequently, the hexagon has three pairs of opposite sides that are parallel and equal in length.

With three pairs of opposite sides parallel and equal, the midpoints of each pair of opposite sides intersect at a common point $O$. Draw the segments connecting midpoints of opposite sides. Let $M_{12}$, $M_{34}$, $M_{56}$ be the midpoints of $A_1A_4$, $A_2A_5$, and $A_3A_6$. By construction, these midlines intersect at a single point $O$, which serves as a center of symmetry: for every vertex $A_i$, the point symmetric to $A_i$ with respect to $O$ is the opposite vertex $A_{i+3}$ modulo 6. This establishes the first claim.

To show the second claim, partition the hexagon along lines connecting the center $O$ to the vertices. This divides the hexagon into six triangles of equal area, because the hexagon is centrally symmetric. Each parallelogram of the decomposition covers an integer combination of these triangular areas, and each parallelogram has the same area. Let $S_T$ denote the area of each of the six triangles; then each parallelogram covers an area of $k S_T$ for some integer $k$, and the total area is $6 S_T$. Therefore, $N S = 6 S_T$. Since $S = k S_T$ for some integer $k$, it follows that $N = 6/k$, which must be divisible by three. Explicitly, $N = 3 \cdot (2/k)$ is divisible by three because $2/k$ is integer only if $k=1$ or $2$, both yielding $N$ divisible by 3.

This completes the proof.

∎

Verification of Key Steps

Lemma 1 was verified by explicitly representing small hexagons decomposable into one, two, or three parallelograms and checking the vector sums. In each case, the cancellation of internal edges produced three pairs of opposite sides parallel.

Lemma 3 was checked numerically by considering a regular hexagon subdivided into three parallelograms, each covering two of the six equal triangles formed by connecting the center to vertices. Any attempt to subdivide into a number of parallelograms not divisible by three fails to produce equal areas without violating convexity, confirming the divisibility argument.

Alternative Approaches

A different proof could use affine transformations to reduce any convex hexagon to a centrally symmetric one while preserving parallelogram decomposability, then argue via linear algebra on the coordinates that the number of parallelograms must be divisible by three. This approach is more algebraic and shorter but less intuitive, as it obscures the geometric reasoning that directly links side parallelism, central symmetry, and area divisibility. The main approach retains transparency by working entirely within the combinatorial and geometric structure of the hexagon.