This question already has an answer here:
I have a number, say 1885, I can prove that n can be represented as a sum of squares:
Thm: n is the sum of 2 squares IF AND ONLY IF each prime factor of n that is congruent to 3(mod4) occurs to an even power in the Prime Power Decomposition of n. 1885=5x13x29, all of which are congruent to 1(mod4)
In the question I am given that 1885 can be represented as a sum of squares in 4 distinct ways. How do I go about solving for them?