I am searching for solutions to the following equation: $$ 3a^2 = b^2 + c^2 + d^2 \tag{1} $$ where $a,b,c,d$ are distinct positive integers, satisfying $$ ac = bd.\tag{2} $$
I have found solutions to $(1)$ via a search (over odd $a$) under the constraint $abcd$ is a square, which is weaker than $(2)$. None of these has satisfied $(2)$ however. As an example the smallest solution I found is $$ (a,b,c,d) = (637, 361, 481, 925) = (7^2\cdot13, 19^2, 13\cdot 37, 5^2\cdot 37) $$ which doesn't satisfy $(2)$.
My apologies for the vagueness of this question, but I just wondered if anyone could offer some insight on this problem? Perhaps there is a simple proof of impossibility, or a restriction on the variables that means the magnitude of any possible solution must be beyond the scope of my laptop.
I welcome anybody's thoughts on this!
A few of my own:
- By Legendre's three square theorem, solutions to $(1)$ usually exist (always when $a$ is odd), and there are often many solutions, so the problem doesn't feel too restrictive.
- Clearly if $(a,b,c,d)$ is a solution, then so is $(ka, kb, kc, kd)$. The solutions I found went beyond this extension.