n^2 = SumOfSquares for n=power of 2

Meeussen Wouter (bkarnd) wouter.meeussen at vandemoortele.com
Tue Nov 20 11:26:17 CET 2001


thanx, exactly the snag I hoped for!
simple in hindsight only

wouter.




-----Original Message-----
From: Bill Dubuque [mailto:wgd at zurich.ai.mit.edu]
*** clip ***
>
> Why is 4^k a sum of 2 or 3 squares only trivially: 4^k = (2^k)^2 + 0^2...
>
Because it requires at least 4 odd squares to sum to an even square, i.e.

*** clip ***


===============================
This email is confidential and intended solely for the use of the individual to whom it is addressed. 
If you are not the intended recipient, be advised that you have received this email in error and that any use, dissemination, forwarding, printing, or copying of this email is strictly prohibited.
You are explicitly requested to notify the sender of this email that the intended recipient was not reached.





More information about the SeqFan mailing list