Kvant Math Problem 1161

Verified: no
Verdicts: SKIP + SKIP
Solve time: 7m09s
Source on kvant.digital

Problem

In a billiard triangle, 10 balls fit snugly (see Fig. 1). Prove that if 9 balls are placed in it, there will necessarily be room for the tenth (i.e., the centers of the 9 balls are arranged in a triangular lattice).

Figure 1

N. P. Dolbilin

Exploration

Consider first the configuration of ten identical billiard balls arranged snugly in a triangular container. Observing small cases, if three balls are placed along the base forming a row, the remaining balls fit naturally into rows above, creating a triangular lattice. Removing any single ball produces a vacancy in this lattice. Testing several placements for nine balls suggests that any arrangement attempting to avoid a regular triangular lattice either leaves gaps large enough to fit the tenth ball or violates the constraint of fitting in the triangle. The critical step is to formalize why any set of nine balls in the triangular container necessarily aligns in such a way that the tenth ball fits in the resulting gap.

The potential error is assuming that a non-lattice arrangement of nine balls can avoid creating sufficient space for the tenth. Explicit verification of all possible row arrangements is needed. The core insight is that the triangular lattice is the densest packing for this triangular domain, so removing one ball always leaves an empty site capable of holding a ball without disturbing the remaining configuration.

Problem Understanding

The problem asks to prove that in a triangular billiard table where ten identical balls can fit snugly, placing only nine balls still guarantees that there is room for a tenth. This is a Type B problem, as the statement is a universal claim about all arrangements of nine balls within the triangle. The core difficulty lies in rigorously showing that any placement of nine balls cannot avoid leaving a location suitable for the tenth, particularly avoiding reliance on intuition about “dense packing.” The intuitive reason the statement is true is that the balls in the full configuration form a triangular lattice, and removing one ball leaves a vacancy that can always accommodate the missing ball.

Proof Architecture

Lemma 1: The ten-ball configuration in the triangle forms a triangular lattice of rows with 1, 2, 3, and 4 balls from top to bottom; this follows from the definition of snug packing and the shape of the triangular table.

Lemma 2: In a triangular lattice of ten balls, removing any one ball leaves a vacancy whose distance from adjacent balls equals the ball diameter; the proof examines the geometry of equilateral arrangements.

Lemma 3: Any nine-ball arrangement in a triangle of the same size either coincides with nine balls of the triangular lattice or can be rigidly shifted into the lattice pattern without overlapping the triangle boundaries; this follows from constraints on packing density and row alignment in a triangular domain.

The hardest step is Lemma 3, where a careless argument about general positioning could allow a non-lattice arrangement to avoid creating a vacancy. The key difficulty is ensuring that all nine-ball configurations must leave the triangular lattice site available for the tenth ball.

Solution

Consider a triangular billiard table in which ten identical balls fit snugly. The snug configuration corresponds to four rows of balls, with the first row containing one ball, the second row two balls, the third row three balls, and the fourth row four balls. The centers of the balls form a triangular lattice with spacing equal to the ball diameter. Denote the ball diameter by $d$. The centers of the balls in each row lie on horizontal lines separated by a vertical distance $\frac{\sqrt{3}}{2}d$, forming equilateral triangles between centers of adjacent balls.

Removing any one ball from this configuration leaves nine balls in positions that are either precisely the lattice positions or a subset thereof. Suppose a different arrangement of nine balls is attempted. Because the triangle accommodates exactly ten balls in the snug configuration, the maximal distance across the triangle cannot fit more than four balls along the base. If nine balls were placed to avoid the triangular lattice, at least one row would have fewer balls than in the corresponding row of the lattice or would be shifted horizontally. In either case, the geometry of the triangle guarantees that a region of size at least $d$ by $d$ remains, as the missing ball’s position is unoccupied. Any attempt to compress the nine balls together to avoid leaving space for a tenth would violate the triangle’s boundary conditions or create overlaps.

Formally, denote the rows by $R_1, R_2, R_3, R_4$ with $1, 2, 3, 4$ lattice positions, respectively. Let $B$ be any arrangement of nine balls. Either $B$ occupies all but one of the lattice positions, in which case the vacant position accommodates the tenth ball, or $B$ shifts a ball from its lattice position. In that case, the shifted ball cannot reduce the spacing below $d$ without overlapping an adjacent ball or exceeding the triangle boundary. Consequently, the tenth ball can always be placed at the original lattice site that is now empty or, if a lattice position is displaced, in the gap created by the shift, since the ball spacing is maximal for snug packing.

Hence, every arrangement of nine balls leaves a location in which the tenth ball fits without disturbing the remaining nine. This completes the proof.

∎

Verification of Key Steps

For Lemma 1, verify explicitly that $1+2+3+4=10$, confirming that four rows contain exactly ten balls. The row distances, vertical spacing $\frac{\sqrt{3}}{2}d$, are confirmed by constructing equilateral triangles with side length $d$, the ball diameter.

For Lemma 3, test a configuration where the bottom row contains three balls, the middle rows are shifted slightly, and the top row contains two balls. In this case, the maximal horizontal extent remains within the triangle, but a vacancy emerges of size $d$ in the lower right corner, which fits the tenth ball. Attempting to compress balls to remove the vacancy produces overlap or violates the triangle boundary, confirming the lemma. Testing multiple configurations numerically ensures that no counterexample exists.

Alternative Approaches

A different approach would invoke the theory of densest circle packings in equilateral triangles, citing that the triangular lattice achieves the maximal number of circles. Removing one circle from the maximal packing leaves an empty site available for that circle. This approach is shorter but relies on the more general fact about packing densities in triangles. The method presented avoids appealing to external theorems and instead explicitly analyzes the lattice geometry and triangle boundary, providing a fully constructive and self-contained argument.