Can p be an odd prime that divides both r^2-s^2 and r^2+s^2?

  • Thread starter Thread starter awesome220
  • Start date Start date
  • Tags Tags
    Theory
awesome220
Messages
4
Reaction score
0
Can anyone help me with this?

If gcd(r,s)=1 then prove that gcd(r^2-s^2, r^2+s^2)=1 or 2.

i'm so confused.
 
Physics news on Phys.org
Let p be an odd prime that divides both r^2-s^2 and r^2+s^2. Show that this leads to a contradiction.
 
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