Sum of squares equation problem

  • Thread starter Thread starter The legend
  • Start date Start date
  • Tags Tags
    Squares Sum
Click For Summary

Homework Help Overview

The problem involves proving that the only integer solution to the equation x² + y² + z² = 2xyz is x = y = z = 0. Participants are exploring various approaches to demonstrate this claim.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants discuss the implications of using negative integers and the nature of squares in relation to the equation. There is mention of exploring the equation under different conditions, such as dividing by powers of two and considering modular arithmetic.

Discussion Status

Some participants have offered hints and suggestions for approaching the proof, while others are questioning the validity of certain assumptions and exploring the consequences of their reasoning. There is an ongoing exploration of the implications of modular arithmetic, particularly mod 4, in relation to the problem.

Contextual Notes

Participants express a lack of familiarity with modular arithmetic, which is relevant to the discussion. There are also references to the need for a more formal proof rather than trial and error.

The legend
Messages
420
Reaction score
0

Homework Statement


Prove only solution in integers of the equation

x2 + y 2 + z2 = 2xyz

is x = y = z =0


2. The attempt at a solution

Well, using common sense got the idea but don't exactly know how to prove it!
Can anyone please help as how to start ...?

Thanks!
 
Physics news on Phys.org


Well, a proof is often in the details of common sense. What "common sense" gave you the idea?
 


Suppose we take in negative integers.
then the sum of squares is positive and the product beside is negative.(eliminated possibility)

Then again taking 0 the answer is satisfied.

Then taking positive ints by a bit of trial none (That I found ) satisfy the eqn
(though this trial is the main problem that i faced)

So the thing is I need the exact proof and not trial.
 


The general idea is to show that if x,y,z is a solution then x/2,y/2,z/2 is also a solution. It's an infinite descent thing. One of x, y, and z must be even, right? Now consider divisibility by 4. You won't get the exact proof here. You only get hints. You'll have to work the proof out for yourself.
 


Ok .. here's what i did after your suggestion( thanks!)

since it must keep on working for x/2 , y/2 , z/2 and then by 4 and so on finally it must come to x/x , y/y , z/z (that is 1 ,1 ,1)

So the equation comes as this

1^2 + 1^2 + 1^2 = 2 * 1 * 1 *1

But since the equality doesn't hold true... well the only answer remaining is x = y = z =0.

Is this right??
 


Ooops. Actually my 'hint' isn't even right. The equation isn't homogeneous in x, y, z. Sorry. Here's what I meant to say. Suppose 2^k is the largest power of two dividing all of the numbers x, y and z. Then x=2^k*x', y=2^k*y', z=2^k*z', where at least one of x', y', z' is odd. Write out the equation in terms of x', y' and z' and show you have a problem mod 4.
 


Got it!

writing in terms of x', y', z'

(2kx')2 + (2ky')2 + (2kz')2 = 2 * (2kx') * (2ky') * (2kz')

x' + y' + z' = 23k+1-2k * x'* y'* z'

x' + y' + z' = 2k+1 * x'* y'* z'

But this contradicts the main problem statement..in terms of x'* y'* z'(for all values except 0 = x = y = z)

Right?

And also I want to know what was that mod 4 cause I don't know how to use it in a sum. Could you please tell me how to do this sum by that method?
 


The legend said:
Got it!

writing in terms of x', y', z'

(2kx')2 + (2ky')2 + (2kz')2 = 2 * (2kx') * (2ky') * (2kz')

x' + y' + z' = 23k+1-2k * x'* y'* z'

x' + y' + z' = 2k+1 * x'* y'* z'

But this contradicts the main problem statement..in terms of x'* y'* z'(for all values except 0 = x = y = z)

Right?

And also I want to know what was that mod 4 cause I don't know how to use it in a sum. Could you please tell me how to do this sum by that method?

What happened the squares on x' etc? And how is that a contradiction? If you square an odd number what's its value mod 4? How about squaring an even number?
 


Since I don't know much about this mod 4(nothing at all actually!) I will try this out when I learn about it. Can you suggest from which website can i learn about this mod?? (Its not in my syllabus so no school teacher going to teach me nor do I have the books havin that )
 
Last edited:
  • #10


A value of x 'mod 4' is just the remainder you get if you divide x by 4. If x is even what's the remainder if you divide x^2 by 4? Answer the same question in the case x is odd. You can also try looking at http://en.wikipedia.org/wiki/Modular_arithmetic or there must be a lot of other references.

Examples:

2 mod 4=2
3 mod 4=3
4 mod 4=0
5 mod 4=1
6 mod 4=2
7 mod 4=3
8 mod 4=0
etc etc
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
3K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
39
Views
6K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K