I want to show that the equation
$x^2$ + $y^2$ + $z^2$ = $2xyz$ has no non-trivial solutions using infinite descent.
This question has been solved with infinite descent by showing that $x,y,z$ are all even and we can infinitely find smaller solutions: Integer solutions of the equation $x^2+y^2+z^2 = 2xyz$
Can it be shown instead by assuming you have the least positive solution and then finding a smaller solution.
I let ($a,b,c$) be the least positive solution with gcd(a,b,c) = 1, and I want to find a smaller solution.
I have that exactly one of $a,b,c$ must be even because if two were even, then the left hand side would be odd while the right hand side is even. And if all three are even, then gcd($a,b,c$) $\ge$ 2.
So we can assume $a$ is even. I've tried considering the equation mod $a,b,c,2$ but couldn't seem to find a way to construct a smaller solution.
You basically want to turn a proof of infinite descent into a "simple" proof by contradiction.
Infinite descent basically works like this:
You want something like this:
(Citations from WP) As it is indicated in the text, this is just a reformulation of said proof. If I were to borrow André's argumentation, I would write:
Suppose that $(x,y,z)$ is a smallest solution (i.e. $\gcd(x,y,z)=1$). An even number of these must be odd (this can be seen by taking the equation mod 2). If two are odd, say $x$ and $y$, then $x^2+y^2$ has shape $4k+2$, and therefore so does $x^2+y^2+z^2$, since $z^2$ is divisible by $4$ (because $z$ is even). But $2xyz$ has shape $4k$. So $x,y,z$ are all even, say $2u,2v,2w$. But this contradicts our example of a smallest solution, and we are done.
This is the step you have probably missed in André's solution:
With this you could have finished your proof. Alas, I don't see this as duplicate, but rather as proof-explanation.