Can two the sum of two primitive perfect squares be equal? $a^2+b^2 = c^2 + d^2$?

Question

Given a primitive perfect square, $n^2=a^2+b^2$ where $gcd(a, b) = 1$ and
$m^2=c^2+d^2$ where $gcd(c,d)=1$
Can $n=m$?

a, b, c, d, n, and m are positive integers. And I forgot to mention:
EDIT 1: Two of (n, a, b) are divisible by 3. One of (n, a, b) is divisible by 9. And the same for m, c, and d: Two of (m, c, d) are divisible by 3. One of (m, c, d) is divisible by 9.

I have not found a situation among the first few hundred lowest perfect squares where $n=m$ and I would like to make sure this is true.

I know that any square can be represented by a sum of odd numbers, $$n^2=\sum_{k=1}^n (2k-1)$$

I find it interesting that none are equal.

Answer 1

You mean, like can something like $63^2+16^2$ equal something like $33^2+56^2$ and both be squares?

I'll have to think about that!

Answer 2

I cannot forget that scene in the movie "Love in the quadratic reciprocity era" where

$$ 3145^2 = 2263^2+2184^2 = 1463^2+2784^2 = 336^2+3127^2 $$ is mentioned.

---

Just joking. Such identities can be easily derived from Lagrange's identity $$ (a^2+b^2)(c^2+d^2)=(ad-bc)^2+(ac+bd)^2 $$ and the fact that every prime $p\equiv 1\pmod{4}$ can be represented in a essentially unique way as $u^2+v^2$, since $\mathbb{Z}[i]$ is a Euclidean domain, hence a UFD. It follows that by taking some square-free $n$ given by the product of many primes $\equiv 1\pmod{4}$, $n^2$ can be represented as $u^2+v^2$ (with $\gcd(u,v)=1$) in many ways. Lord Shark's choice is $n=5\cdot 13$ and my choice above is $n=5\cdot 17\cdot 37$. To deal with the $\!\!\pmod{9}$ constraints is simple.