Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Topic: How to solve diophantine equation x1^2 + x2^2 + ...+ x5^2 = x6^2
Replies: 9   Last Post: Apr 25, 2012 8:21 PM

 Messages: [ Previous | Next ]
 Dan Cass Posts: 442 Registered: 12/6/04
Re: How to solve diophantine equation x1^2 + x2^2 + ...+ x5^2 = x6^2
Posted: Apr 25, 2012 1:57 PM

> > There is of course a primitive solution
> > (in my ordering of notation)
> > (1,1,1,1,0,2)
> > representing that
> > 1^2 + 1^2 + 1^2 + 1^2 + 0^2 = 2^2.
> >
> > This tuple is in my notation
> > (1,1,1,1,0,2)
> > and is also primitive.
> > It would be obtained using the matrix as described

> in
> > the paper, beginning with (1,0,0,0,0,1).
> >
> > It seems your use of four 1's would need a 2^2
> > somewhere.

>
> Is there any primitive solution in which all are
> non-zero and x1,x2,x3,x4 odd and x5,x6 even ?

If you allow x5=0 there is
x1=1 x2=1 x3=1 x4=1 x5=0 x6=2.
This is primitive.

Even if you decide not to allow zero values,
this example shows there can be no simple
"congruence argument" for no primitive
solutions of the type you mention.

Date Subject Author
4/14/12 Paul Mc
4/17/12 Dan Cass
4/18/12 Paul Mc
4/18/12 Dan Cass
4/20/12 Paul Mc
4/25/12 Dan Cass
4/25/12 Dan Cass
4/25/12 Dan Cass
4/25/12 Dan Cass
4/25/12 Paul Mc