Finding Pythagorean Triples: Sums of Two Squares

  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Squares Sums
Dragonfall
Messages
1,023
Reaction score
5
Which squares are expressible as the sum of two squares? Is there a simple expression I can write down that will give me all of them? Some of them? Parametrization of the pythagorean triples doesn't seem to help.
 
Physics news on Phys.org
What do you mean by "parameterization of pythagorean triples"? If it's what I think you mean, I don't see why this wouldn't give you enough information for what you want to do.
 
0 is a square, so really all of them. Excluding this trivial case, if c^2 can be written as c^2=a^2+b^2 where a and b are non zero, then we can divide by common factors to get d^2=e^2+f^2, where the terms are relatively prime.

Do you know any characterization of integers that can be written as sums of relatively prime squares (if not, what about primes)? Then you'd know c^2 would have to have a divisor of this form (conversely having a divisor of this form will ensure a representation).
 
I worded the question wrong. I wanted to ask "given a square, how do I know if it can be written as the sum of two squares (except 0)". I got it now.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top