I have to show, that every number of the form $2^n$ ($n \in \mathbb{N}$) is a sum of two squares. I don't have any idea how to start here.
Any help is appreciated.
|
I have to show, that every number of the form $2^n$ ($n \in \mathbb{N}$) is a sum of two squares. I don't have any idea how to start here. Any help is appreciated. |
|||||||||||||||||
|
|
The statement that every natural number $n$ is a sum of two squares is false. For example, $3$ is not a sum of any two squares. Hint: Note that $2^n=2^{n-1}+2^{n-1}$ and $2^n=2^n+0$. Which statement should you use for which $n$? |
|||||||||||
|
|
Hint:
|
|||
|
|
|
HINT $\rm\quad 2\ (a^2 + b^2)\ =\ (a + b)^2 + (a - b)^2\ $ yields the inductive step. REMARK $\ $ Writing $\ 2\ = 1^2 + 1^2\ $ shows that the above is nothing but a special case of the well-known Brahmagupta–Fibonacci identity for composing sums of squares. This special doubling case was known much earlier than the general case. It plays a key role in my speculative reconstruction of $\rm\ FLT_4\equiv $ Fibonacci's Lost Theorem, the area of an integral pythagorean triangle $\rm\ne n^2\:.$ |
||||
|
|