There is a cool identity relating Fibonacci numbers and Pythagorean triples, which states that given four consecutive Fibonacci numbers \({F}_{n},{F}_{n+1},{F}_{n+2},{F}_{n+3}\), the triple \(({F}_{n}{F}_{n+3}, 2{F}_{n+1}{F}_{n+2}, {{F}_{n+1}}^{2}+{{F}_{n+2}}^{2})\) is a Pythagorean triple.
To prove this, let Fn+1=a and Fn+2=b. Then Fn=b−a and Fn+3=b+a. Substituting the abstract values to the equation
(FnFn+3)2+(2Fn+1Fn+2)2=(Fn+12+Fn+22)2
will give
((b−a)(b+a))2+(2ab)2=(a2+b2)2.
With a little simplification, we arrive at Euclid's formula for Pythagorean triples:
(b2−a2)2+(2ab)2=(a2+b2)2.
Check out my other notes at Proof, Disproof, and Derivation
#NumberTheory
#FibonacciNumbers
#PythagoreanTriples
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Nice post
Is there any generalized formula to generate pythagoream triples
Log in to reply
Euclid's Formula. The link above should bring you to a proof.
Log in to reply
How we can solve problems in which product of three pythagorean triples is given and we have to find the triple
Log in to reply
Log in to reply
(x,y,z) such that xyz=16320
Find out the pythagorean tripleLog in to reply
a,b such that 2ab(a2+b2)(a2−b2)=16320.
Number of solutionsLog in to reply
Log in to reply
Good
Log in to reply
Nice post Is there any generalized formula to generate pythagoream triples.(?) There are several. There is another as yet unpublished formula which will bring an additional as yet unconsidered aspect of Pythagoras.