PROBLEM NO.39 (B0MC-2,DAY-5)
Posted: Wed Apr 04, 2012 10:44 pm
Prove that every integer $n$ can be represented in infinitely many ways as
$n=e.1^{2}+e.2^{2}+....+e.k^{2}$
for a convenient $k$ and a suitable choice for $e$ where $e=\pm1$
$n=e.1^{2}+e.2^{2}+....+e.k^{2}$
for a convenient $k$ and a suitable choice for $e$ where $e=\pm1$