# Number TheoryMath History question - Fibonacci Proof

##### New member

Prove that if the sum of two consecutive intergers is a square than the square of the larger integer will equal the sum of the nonzero squares.

Hint: if n+(n-1) = h^2 then h is odd.

Not really sure where to start.

Well, $n + (n + 1) = 2n + 1$ is a square by what is given and $(n + 1)^2$ is ... ?