Can this problem have solutions for $N>3$:Find three $(N=3)$ positive integers a, b and c such that: $a+b+c=k^2$, $a+b=t^2$, $b+c=m^2$ and $a+c=n^2$ Can this question have solutions for N>3:
Find three ($N =3$) positive integers a, b and c such that: $a+b+c=k^2$, $a+b=x^2$, $b+c=m^2$ and $a+c=n^2$; $x, m, n∈\mathbb   N$
Solution:
Let $a+b+c=(x+1)^2=x^2+2x+1$
If $a+b=x^2$ then third number $c=2x+1$.
If $b+c=(x-1)^2=x^2-2x+1=m^2$ then :
$a=4x$, so $b=x^2-4x$
Now due to statement we must have $a+c=6x+1=n^2$
$n^2=6x+1$ can have infinite solutions such as:
$(x, n^2)=(20, 121=11^2), (60, 361=19^2), (140, 841=29^2)\cdot\cdot\cdot$
Which give:
$(a, b, c, k)=(80, 320, 41, 21), (240, 3360, 121, 61), (560, 19040, 281, 141),\cdot\cdot\cdot$
I tried to solve this problem for $N=4$, four numbers but no success. Now I have two questions:
1-Does this problem have solutions for N>3?
2-Any idea for better method?

This answer is only for the case $N=4$. I fail to see how this method could help resolve the cases for larger $N$.
Consider the equations
$$a + b = u^2, c + d = v^2$$
$$a + c = w^2, b + d = x^2$$
$$a + d = y^2, b + c = z^2$$
$$a + b + c + d = k^2$$
Now the first three pairs of equations give
$$u^2 + v^2 = w^2 + x^2 = y^2 + z^2 = k^2$$
so a reasonable approach would be to investigate Pythagorean triples.
Not all Pythagorean triples generate positive integers solutions, but a solution could be generated if the pairs $(u,v), (w,x), (y,z)$ are "reasonably close". Consider
$$165^2+280^2 = 195^2+260^2 = 253^2+204^2 = 325^2$$
Take note of the parity as well (or multiply it by $2$ so you don't need to worry about it)
Solving the equations give
$$a = 11817, b = 15408, c = 26208, d = 52192$$
and more solutions can be generated this way.
