IMO 1968 · Problem 1

Prove that there is one and only one triangle whose side lengths are consecutive integers, and one of whose angles is twice as large as another.

Official text of the problem. Official problem paper (PDF)

Solution

Let \(A,B,C\) be the angles of such a triangle, with \(B=2A\), and let \(a,b,c\) be their respective opposite sides. Then \(C=\pi-3A\), so \(0<A<\pi/3\). By the sine rule, \[ \frac ba=\frac{\sin 2A}{\sin A}=2\cos A>1 \] and \[ \frac ca=\frac{\sin 3A}{\sin A}=4\cos^2 A-1. \] Consequently, \[ \boxed{b^2=a(a+c)},\qquad b>a. \]

Write the consecutive side lengths as \(n-1,n,n+1\), where \(n\) is an integer. The triangle inequality gives \[ (n-1)+n>n+1, \] hence \(n\ge3\). Since \(b>a\), there are exactly three possible assignments.

  1. If \(a=n-1,\ b=n,\ c=n+1\), then \[ n^2=(n-1)(2n), \] which gives \(n=2\), contradicting \(n\ge3\).

  2. If \(a=n,\ b=n+1,\ c=n-1\), then \[ (n+1)^2=n(2n-1). \] Thus \(n\mid(n+1)^2\), and therefore \(n\mid1\), again contradicting \(n\ge3\).

  3. If \(a=n-1,\ b=n+1,\ c=n\), then \[ (n+1)^2=(n-1)(2n-1). \] Expanding and simplifying gives \[ n(n-5)=0. \] Hence \(n=5\), so the side lengths must be \(4,5,6\).

It remains to verify existence. Since \(4+5>6\), these lengths form a nondegenerate triangle. Let \(A\) and \(B\) be its angles opposite the sides of lengths \(4\) and \(6\), respectively. By the cosine rule, \[ \cos A=\frac{5^2+6^2-4^2}{2\cdot5\cdot6}=\frac34, \qquad \cos B=\frac{4^2+5^2-6^2}{2\cdot4\cdot5}=\frac18. \] Therefore \[ \cos 2A=2\cos^2 A-1 =2\left(\frac34\right)^2-1 =\frac18=\cos B. \] Because \(0<A<\pi/2\), both \(2A\) and \(B\) lie in \((0,\pi)\), where cosine is strictly decreasing. Thus \(B=2A\).

Finally, three side lengths determine a triangle uniquely up to congruence. Hence the triangle with side lengths \(\boxed{4,5,6}\) is the one and only triangle satisfying the conditions.

The solution was checked against John Scholes' IMO solution archive (Kalva).