Friday, 19 June 2015

discrete mathematics - Proof: For all integers x and y, if x2+y2=0 then x=0 and y=0




I need help proving the following statement:



For all integers x and y, if x2+y2=0 then x=0 and y=0



The statement is true, I just need to know the thought process, or a lead in the right direction. I think I might have to use a contradiction, but I don't know where to begin.



Any help would be much appreciated.


Answer



If x0 or y0 then |x|1 or |y|1, which implies x2+y21.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...