IMO 1994 · Problem 4

Determine all ordered pairs \((m, n)\) of positive integers such that \[ \frac{n^3+1}{mn-1} \] is an integer.

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

Answer

The ordered pairs are \[ \boxed{(1,2),(1,3),(2,1),(2,2),(2,5),(3,1),(3,5),(5,2),(5,3).} \]

Solution

The pair \((1,1)\) is excluded because the denominator is zero. For every other pair, write \(d=mn-1>0\).

First, the divisibility condition is symmetric in \(m,n\). Indeed, if \(d\mid n^3+1\), then the identity \[ m^3(n^3+1)-(m^3+1) =(mn-1)(m^2n^2+mn+1) \] shows that \(d\mid m^3+1\). Interchanging \(m,n\) proves the converse. Thus we may assume \(m\le n\), and include the reversed pairs afterward.

Case 1: \(m=1\). We have \(n\ge2\), and the equivalent condition \(mn-1\mid m^3+1\) becomes \[ n-1\mid2. \] Hence \(n=2\) or \(n=3\).

Case 2: \(m=2\). Now \(n\ge2\), and \[ 2n-1\mid9. \] Since \(2n-1\ge3\), it equals \(3\) or \(9\). Thus \(n=2\) or \(n=5\).

Case 3: \(m\ge3\). Let \[ q=\frac{m^3+1}{mn-1}, \] which is a positive integer. Reducing \(q(mn-1)=m^3+1\) modulo \(m\) gives \[ q\equiv-1\pmod m. \] Also, since \(n\ge m\), \[ q\le\frac{m^3+1}{m^2-1} =m+\frac1{m-1}<m+1. \] Therefore \(1\le q\le m\), so the congruence forces \(q=m-1\). Consequently, \[ (m-1)(mn-1)=m^3+1, \] which simplifies to \[ (m-1)n=m^2+1=(m-1)(m+1)+2. \] Thus \(m-1\mid2\). Since \(m\ge3\), we obtain \(m=3\), and then \(n=5\).

We have therefore found exactly the candidates \[ (1,2),\quad(1,3),\quad(2,2),\quad(2,5),\quad(3,5) \] with \(m\le n\). Their original quotients are, respectively, \[ 9,\quad14,\quad3,\quad14,\quad9, \] so all five work. By the proved symmetry, their reversed pairs also work. These give precisely the nine pairs stated above.

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