 
 
 
 
 
   
Math 124 Problem Set 6
1. -389 is negative, and thus not the sum of two squares.
Since  , it is not the sum of two squares.  Since
, it is not the sum of two squares.  Since
 , it is not the sum of two squares.
, it is not the sum of two squares.  is a
perfect square.  Since
 is a
perfect square.  Since  , it is not the sum of two
squares.  Finally,
, it is not the sum of two
squares.  Finally, 
 and
 and 
 , so it
is not the sum of two squares.
, so it
is not the sum of two squares.
2i. On input  , the program breaks up
, the program breaks up  into two
parts and looks for a sum of two squares representation.
 into two
parts and looks for a sum of two squares representation.
{squares(n) = local(y); for(x=1,floor(sqrt(n)),
y=sqrt(n- );
);
if(y-floor(y)==0, return([x,floor(y)]))
);
    return(0) }
f(n) =
   for(x=1,n,
      a=squares(x);
      b=squares(n-x);
if(a!=0 && b!=0, return([a,b])));}
2ii. 
 .
.
3. 625 There are two Pythagorean triples with
25 as the hypotenuse:  and
 and 
 .  This gives
two representations of 625 as the sum of two squares.  Of course,
.  This gives
two representations of 625 as the sum of two squares.  Of course,
 is a third.
 is a third.
4. The forward direction is trivial. For the opposite
direction, suppose that  is the sum of two rational squares:
 is the sum of two rational squares:
 , but it is not the sum of two
integer squares.  Then
, but it is not the sum of two
integer squares.  Then  , where
, where 
 is a
prime factor and
 is a
prime factor and  is odd. Now,
 is odd. Now, 
 , so
, so
 is the sum of two integer squares.  However, all the
prime factors of
 is the sum of two integer squares.  However, all the
prime factors of  have even exponent, so
 have even exponent, so 
 ,
where
,
where  is still odd.  This is a contradiction; therefore
 is still odd.  This is a contradiction; therefore  must be the sum of two integer squares.
must be the sum of two integer squares.
5. Suppose 
 , where
, where  is an odd prime and
 is an odd prime and
 are integers.  Then
 are integers.  Then 
 , so
, so
 (since
 (since  is a field). From
Lecture 13,
 is a field). From
Lecture 13, 
 iff
 iff 
 .  Also,
.  Also,
 iff
 iff 
 .  Since
.  Since 
 , we have
, we have 
 iff
 iff 
 .
. 
Conversely, suppose 
 is
prime.  Let
 is
prime.  Let  be such that
 be such that 
 .  Taking
.  Taking
 and applying Lemma 1.3 from Lecture
21, there exist integers
 and applying Lemma 1.3 from Lecture
21, there exist integers  with
 with 
 such that
 such that
 
 ; then
; then
 , so
, so 
 .  Since
.  Since
 , we also have that
, we also have that 
 .  Therefore
.  Therefore 
 or
 or  .  If
.  If
 we are done.  If
 we are done.  If 
 then
 then  must be even
(else
 must be even
(else  is odd).  Put
 is odd).  Put  ; then
; then
 
 be the
 be the  th triangular number.  It is easy
to see by induction that
th triangular number.  It is easy
to see by induction that 
 .  Then
.  Then
 
![$\displaystyle 8T_m^2+1=2m^2(m+1)^2+1=[(m-1)(m+1)]^2+[m(m+2)]^2,$](img56.png) 
![$\displaystyle 8T_m^2+2=2m^2(m+1)^2+2=[m(m+1)-1]^2+[m(m+1)+1]^2.$](img57.png) 
 ,
,  and
 and  can be written as the sum of
two squares.
 can be written as the sum of
two squares.
 such that
such that 
 .  Since all odd prime factors are
congruent to
.  Since all odd prime factors are
congruent to 
 ,
,  must have some prime factor
 must have some prime factor
 with odd exponent.  This implies that
 with odd exponent.  This implies that  is
not representable as the sum of two squares.
 is
not representable as the sum of two squares.
 
 .  By inspection, we try
.  By inspection, we try  .
Then
.
Then 
 and
 and  , which again by inspection is
satisfied by
, which again by inspection is
satisfied by  .  Since
.  Since  , the form is equivalent
to
, the form is equivalent
to  .
.  
 .  By inspection, we try
.  By inspection, we try  .
Then
.
Then 
 and
 and  , which again by inspection is
satisfied by
, which again by inspection is
satisfied by  .  Since
.  Since  , the form is equivalent
to
, the form is equivalent
to  .
.  satisfies
 satisfies
 .  To find
.  To find  such that
 such that 
 ,  We
use the transformation above and solve for
,  We
use the transformation above and solve for 
 
 .
.
9. The discriminants are equal: 
 .  However, the forms are not
equivalent.  To see this, we first show that
.  However, the forms are not
equivalent.  To see this, we first show that 
 is equivalent to
is equivalent to  .  As above, this means solving
.  As above, this means solving
 
 .  By inspection we see that
.  By inspection we see that
 is a solution, so the forms are equivalent.
Now we show the first form is not equivalent to
 is a solution, so the forms are equivalent.
Now we show the first form is not equivalent to  .  If
we try to solve for as above, we encounter the equation
.  If
we try to solve for as above, we encounter the equation
 , which has no solutions over the integers (we can
just check
, which has no solutions over the integers (we can
just check 
 ).
).
 
 
 
 
