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$
PROBLEM NO.39 (B0MC-2,DAY-5)
Last edited by sourav das on Sat Apr 07, 2012 3:31 pm, edited 1 time in total.
Reason: Use \pm for $\pm$
Reason: Use \pm for $\pm$
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
Re: PROBLEM NO.39 (B0MC-2,DAY-5)
Hint:
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$