How can we prove the theorem that any product of primes in the form $4n+1$ is the sum of 2 relatively prime square numbers?
EDIT: My question is not the same as the responses that were linked. I'm asking specifically about the product of primes in the form $4n+1$ being the sum of $2$ relatively prime squares, not just primes in the form $4n+1$ being the sum of squares.
Since every prime of the form 4n+1 is the sum of two squares, and
$\begin{array}\\ (a^2+b^2)(c^2+d^2) &=a^2c^2+a^2d^2+b^2c^2+b^2d^2\\ &=a^2c^2\pm 2abcd+b^2d^2+a^2d^2\mp 2abcd+b^2c^2\\ &=(ac\pm bd)^2+(ad\mp bc)^2\\ \end{array} $
the product of any number of primes of the form 4n+1 is the sum of two squares.
If the two squares are not relatively prime, some prime divides both of them, and so the square of that prime divides each square and so divides the product of the primes.
But the product of the primes (unless two of them are the same) is only divisible by primes to the first power, a contradiction.