Note: this article makes use of MathML, the standard XML markup for math formulas. Sadly, this is not properly supported on some allegedly ‘modern’ and ‘feature-rich’ browsers. If the formulas don't make sense in your browser, consider reporting the issue to the respective developers and/or switching to a standard-compliant browser.

## Introduction

You can find an introduction to the legendary “Question Six” in this Numberphile video. This article is my attempt at providing a “simple” answer to the problem, sketched from the hints provided in this more detailed insights video.

To be clear this isn't my personal “best effort” at trying to solve the problem (I did give it a quick try, starting from an intuition that induction would be the key, but I didn't get very far in). I also have no idea if this is how it was solved by any of the candidates that did provide the correct answer to the problem.

No, this is just a formalization into an actual proof of the hints provided by Simon Pampena in the second video. The proof should still be easy to follow even with only a basic knowledge of algebra.

## The problem

Let $a$ and $b$ be positive integers such that $ab+1$ divides ${a}^{2}+{b}^{2}$. Show that

$a2+b2ab+1$

is the square of an integer.

## The solution

Let

$f(x,y)=x2+y2xy+1.$

We want to show that if $a,b$ are positive integers and $f\left(a,b\right)$ is an integer, then $f\left(a,b\right)$ is a square.

Observe first that if $a,b$ are non-negative integers, and one of them is 0, then the statement is trivially true, since $f\left(a,0\right)={a}^{2}$ and $f\left(0,b\right)={b}^{2}$.

Assume now that ${a}_{0},b$ integers with $0<{a}_{0} are such that $f\left({a}_{0},b\right)$ is an integer. We want to show that there exist a non-negative integer ${a}_{1}<{a}_{0}$ such that $f\left({a}_{1},{a}_{0}\right)=f\left({a}_{0},b\right)$. Note that with this proven, we can apply the result iteratively, constructing a sequence $\left\{{a}_{i}\right\}$ with $0\le {a}_{i+1}<{a}_{i}$ and such that $f\left({a}_{i+i},{a}_{i}\right)=f\left({a}_{0},b\right)$. Given the strictly decreasing nature of the sequence and the non-negativity of the values, the sequence will terminate in $k<{a}_{0}$ steps, with ${a}_{k}=0$, leading to $f\left({a}_{0},b\right)=f\left(0,{a}_{k-1}\right)={a}_{k-1}^{2}$, proving that $f\left({a}_{0},b\right)$ is the square of an integer.

Let us then prove the existence of ${a}_{1}$. Let $N=f\left({a}_{0},b\right)$. By hypothesis, $N$ is an integer and we have

$a02+b2a0b+1=N$

that with simple algebra can be rearranged into

This implies that the quadratic equation

$x2-Na0x+a02-N=0$

has the solution $x=b$. Dividing the polynomial

$x2-Na0x+a02-N$

by $x-b$ gives us1 the second root, ${a}_{1}=N{a}_{0}-b$, which again is an integer.

We need to show that ${a}_{1}<{a}_{0}$, i.e.

$Na0-b

or equivalently

$Na0b-b2

Note that by bringing the leftmost two terms in the right-hand side of equation $\left(\star \right)$ to the left-hand side and flipping the equation, we have

$Na0b-b2=a02-N$

but since ${a}_{0}, this implies:

$Na0b-b2=a02-N

and thus

$Na0b-b2

quod erat demonstrandum.

1. E.g. using Ruffini:

$1 -Na0 a02-N b b b2-Nba0 1 b-Na0 b2-Nba0+a02-N=0$ where the reminder is known to be 0 because of equation $\left(\star \right)$. ↩