MathDB
A 59

Source:

May 25, 2007
Divisibility Theory

Problem Statement

Suppose that nn has (at least) two essentially distinct representations as a sum of two squares. Specifically, let n=s2+t2=u2+v2n=s^{2}+t^{2}=u^{2}+v^{2}, where st0s \ge t \ge 0, uv0u \ge v \ge 0, and s>us>u. Show that gcd(sutv,n)\gcd(su-tv, n) is a proper divisor of nn.