Problems & Puzzles: Puzzles
|
Problems & Puzzles: Puzzles
Drom 8-14 Nov., 2025, contributions came from Ivan Ianakiev, Emmanuel Vantieghem. *** Ivan wrote: *** Emmanuel wrote:
Here is my proof :
Assertion : 2m is the sum of two distinct positive integers whose product is a square <==> 2m has a prime factor p of the form 4w + 1.
Proof of ==> :
Suppose 2m = u + v with u*v square. Write u in the form s*t^2 where s is squarefree and write v in the form x*y^2 with x squarefree. Since u*v is a square we have that s*x*(t*y)^2 is a square. This is only possible when s = x. Thus, 2m = x(t^2 + y^2) and by a well known theorem of Fermat
t^2 + v^2 must have a prime factor of the form 4w + 1.
Proof of <== :
Suppose 2m has a prime factor p of the form 4w + 1. Then by the same theorem of Fermat, we can write p in the form a^2 + b^2 with a != b. Thus, 2m = k*p = k a^2 + k b^2. The product of k a^2 and k b^2 is k^2 a^2 b^2; a square.
*** |
|||
|
|||