MHB Math History question - Fibonacci Proof

  • Thread starter Thread starter wreader
  • Start date Start date
  • Tags Tags
    History Proof
AI Thread Summary
The discussion revolves around proving that the sum of two consecutive integers results in a square, specifically that if n + (n + 1) = h^2, then h is odd. Participants are exploring the relationship between the larger integer's square and the sum of nonzero squares. The initial steps involve recognizing that the sum can be expressed as 2n + 1, which is a perfect square. The conversation highlights the need for a structured approach to the proof, emphasizing the mathematical properties of odd integers and squares. The thread seeks clarity on how to proceed with the proof effectively.
wreader
Messages
1
Reaction score
0
Can someone please help me with the following:

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.

Thanks in advance
 
Last edited:
Mathematics news on Phys.org
Well, $n + (n + 1) = 2n + 1$ is a square by what is given and $(n + 1)^2$ is ... ?
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.

Similar threads

Back
Top