MHB Show that the diophantine equation has only these solutions

  • Thread starter Thread starter evinda
  • Start date Start date
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

I want to show that the diophantine equation $x^2+y^2=2$ has only these solutions:
$$(x,y)=(1,1),(1,-1), (-1,1), (-1,-1)$$

That's what I have tried:

$$x^2+y^2=2 \Rightarrow x^2=2-y^2$$

$$x^2>0 \Rightarrow 2-y^2>0 \Rightarrow y^2<2 \Rightarrow -\sqrt{2}<y< \sqrt{2} \Rightarrow y=\pm 1,0$$

  • $y=0: x= \pm \sqrt{2} \notin \mathbb{Z}$
  • $y=\pm 1: x= \pm 1$

So, the solutions are $(\pm 1, \pm 1), (\pm 2,0)$.

Is it right? Could I also find the solutions, using modulo?

Also, how can I show that these solutions are the only ones? (Thinking)
 
Mathematics news on Phys.org
Are you sure you are asked to find integer solutions to $x^2 + y^2 = 2$? Is there any chance *rational* solutions were asked?

In the case of integers, it's trivially easy and you're overcomplicating it. $x^2 + y^2 = 2$ and $x^2, y^2$ are both positive (squares can't take negative values). Hence $x^2 \leq 2$ and $y^2 \leq 2$. The only possible integer values of $x$ and $y$ satisfying these are $(x, y) = (\pm 1, \pm 1), (\pm 1, 0), (0, \pm 1), (0, 0)$

And from all of them, only the first four $(\pm 1, \pm 1)$, i.e., $(1, 1), (-1, 1), (1, -1), (-1, -1)$ satisfies the equation. No modulo argument is needed.

EDIT : Oh I observed that you enumerated the wrong solutions $(x, y) = (\pm 2, 0)$. There doesn't work as $x^2 + y^2 = 4 + 0 \neq 2$.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top