Fibonacci numbers Fn are formed recursively
|Fn||= Fn-1 + Fn-2, n > 1|
which results in the familiar sequence:
|0, 1, 1, 2, 3, 5, 8, 13, ...|
This is one of the most remarkable sequences in mathematics which pops up uncannily in most unexpected circumstances. Fibonacci numbers deserve more than a fleeting and supercilious reference. Some are listed below. But here I mean to ask just two simple questions to answer which one only needs the understanding of rudimentary analytic geometry in two and three dimensions and an unadulterated definition of the Fibonacci sequence not loaded with derivation of the multitude of its numerous properties.
[Trigg, #216]: Find Pythagorean triples whose sides are Fibonacci numbers.
[Trigg, #209]: Find the volume of the tetrahedron with vertices
- C. W. Trigg, Mathematical Quickies, Dover, 1985
Find Pythagorean triples whose sides are Fibonacci numbers.
There are no right triangle whose sides are Fibonacci numbers. In fact mentioning the Pythagorean triples and implying the right triangles clouds the problem. There are no triangles of any kind with sides the Fibonacci numbers. The proof is by contradiction. Assume that Fm, Fn, and Fp are the sides of a triangle. Without loss of generality, assume
|Fm + Fn||≤ Fn-1 + Fn|
with an equality only when m = n - 1 and p = n + 1. But for the three numbers to be the sides of a triangle it is necessary that they satisfy the triangle inequality:
|Fm + Fn||> Fp.|
There is no tetrahedron with the indicated vertices. The solution covers a more general problem: there is no tetrahedron with vertices (Fm, Fm+1, Fm+2), (Fn, Fn+1, Fn+2), (Fp, Fp+1, Fp+2), (Fq, Fq+1, Fq+2), for any four integers m, n, p, q. The reason for this is that any such vertex lies in the plane