MathDB
Pythagorean Triangles and the Fibonacci Sequence

Source: Canadian Repêchage 2010: Problem 5

May 6, 2014
number theorynumber theory proposed

Problem Statement

The Fibonacci sequence is de ned by f1=f2=1f_1=f_2=1 and fn=fn1+fn2f_n=f_{n-1}+f_{n-2} for n3n\ge 3. A Pythagorean triangle is a right-angled triangle with integer side lengths. Prove that f2k+1f_{2k+1} is the hypotenuse of a Pythagorean triangle for every positive integer kk with k2k\ge 2