IMO 1967 Problem 1

Proposed by: -
Verified: no
Verdicts: FAIL + FAIL
Solve time: 14m33s

Problem

Let $ABCD$ be a parallelogram with side lengths $AB = a$, $AD = 1$, and with $\angle BAD = \alpha$. If $\triangle ABD$ is acute, prove that the four circles of radius $1$ with centers $A$, $B$, $C$, $D$ cover the parallelogram if and only if $$ a\leq \cos \alpha + \sqrt{3} \sin \alpha . $$

Exploration

The quantity to be maximized is the distance to the nearest vertex among $A,B,C,D$ over the parallelogram. Any point in the parallelogram lies in exactly one of the two triangles $ABD$ and $BCD$ determined by the diagonal $BD$. In the triangle $ABD$, the vertices $A,B,D$ are all relevant candidates for the minimum distance, while the vertex $C$ is irrelevant for determining the minimum whenever points are closer to $A,B,$ or $D$ than to $C$. A symmetric statement holds in triangle $BCD$.

A potential failure mode is assuming that a global extremum must lie at a symmetric center of the parallelogram. Testing small perturbations near the midpoint of $BD$ shows that the nearest vertex switches depending on region, so the extremal point should instead lie where three distance constraints become equal within one of the triangles. This points to circumcenter-type candidates inside $ABD$ and $BCD$, not the parallelogram center.

The acute condition on $\triangle ABD$ ensures that its circumcenter lies inside the triangle, which makes it a valid candidate for maximizing the minimum distance to $A,B,D$. The same applies symmetrically to $BCD$.

No other region of the parallelogram can produce a larger value because every point belongs to one of these two triangles, and in each triangle the minimum distance is controlled by its three vertices only.

This suggests reducing the problem to the circumradius of $\triangle ABD$.

Problem Understanding

A parallelogram $ABCD$ has $AB=a$, $AD=1$, and $\angle BAD=\alpha$. Four unit circles centered at the vertices cover the parallelogram if and only if every point of the parallelogram lies within distance $1$ of at least one vertex.

This is equivalent to requiring

$$\max_{X\in ABCD}\min(XA,XB,XC,XD)\le 1.$$

The task is to compute this maximum exactly under the assumption that $\triangle ABD$ is acute and express the condition in terms of $a$ and $\alpha$.

Key Observations

Every point in the parallelogram lies in exactly one of the triangles $ABD$ or $BCD$ formed by diagonal $BD$.

In triangle $ABD$, the quantity $\min(XA,XB,XD)$ governs the covering condition, since $C$ is irrelevant there. In triangle $BCD$, the analogous quantity is $\min(XB,XC,XD)$.

Thus the global maximum equals the maximum of the two triangle problems.

In any acute triangle, the point maximizing the minimum distance to its vertices is the circumcenter, and the value attained there is the circumradius.

Hence the problem reduces to computing the circumradius of $\triangle ABD$.

Solution

Consider triangle $ABD$ with sides $AB=a$, $AD=1$, and included angle $\angle BAD=\alpha$. Its area is

$$[ABD]=\frac{a\cdot 1\cdot \sin\alpha}{2}=\frac{a\sin\alpha}{2}.$$

The length of $BD$ is obtained by the law of cosines:

$$BD^2=a^2+1-2a\cos\alpha.$$

The circumradius $R$ of a triangle satisfies

$$R=\frac{abc}{4[ABD]}.$$

Applying this to triangle $ABD$ gives

$$R=\frac{a\cdot 1\cdot BD}{4\cdot (a\sin\alpha/2)}=\frac{BD}{2\sin\alpha}.$$

Thus the covering condition is equivalent to

$$\frac{BD}{2\sin\alpha}\le 1,$$

which is

$$BD\le 2\sin\alpha.$$

Squaring both sides yields

$$a^2+1-2a\cos\alpha\le 4\sin^2\alpha.$$

Substituting $4\sin^2\alpha=4(1-\cos^2\alpha)$ gives

$$a^2+1-2a\cos\alpha\le 4-4\cos^2\alpha,$$

$$a^2-2a\cos\alpha-3+4\cos^2\alpha\le 0.$$

Viewing this as a quadratic inequality in $a$, its discriminant is

$$\Delta = 4\cos^2\alpha-4(4\cos^2\alpha-3)=12-12\cos^2\alpha=12\sin^2\alpha.$$

Hence the roots are

$$a=\frac{2\cos\alpha\pm 2\sqrt{3}\sin\alpha}{2}=\cos\alpha\pm \sqrt{3}\sin\alpha.$$

Since $a>0$, the admissible bound is

$$a\le \cos\alpha+\sqrt{3}\sin\alpha.$$

This condition is also sufficient because when it holds, the circumradius of $\triangle ABD$ is at most $1$, and therefore every point in $ABD$ is within distance $1$ of $A$, $B$, or $D$, while symmetry gives the same conclusion for $BCD$.

Thus the four unit circles centered at $A,B,C,D$ cover the parallelogram if and only if

$$a\le \cos\alpha+\sqrt{3}\sin\alpha.$$

Verification of Key Steps

The reduction to the two triangles $ABD$ and $BCD$ is valid because the diagonal $BD$ partitions the convex parallelogram into two regions, and every point lies in exactly one of them. In each region, the nearest vertex among the four is always one of the three vertices of that triangle, so the fourth vertex cannot influence the minimum distance in that region.

The identification of the extremal point with the circumcenter of an acute triangle is justified because in an acute triangle the circumcenter lies inside the triangle and is the unique point where distances to all three vertices are equal, which maximizes the minimum distance among all points in the triangle.

The circumradius formula is applied correctly using standard identities for area and side lengths, and the algebraic manipulation leading to the quadratic inequality is consistent.

The final root computation is correct since the discriminant simplifies exactly to $12\sin^2\alpha$, yielding the stated expression without ambiguity.

Alternative Approaches

One can instead analyze Voronoi regions of the four vertices and show that the only interior Voronoi vertices that can maximize the distance to the nearest vertex occur at circumcenters of $\triangle ABD$ and $\triangle BCD$. Another approach uses the fact that the problem is invariant under swapping the two congruent halves of the parallelogram, reducing it directly to a single acute triangle optimization problem.