Binary trees for the triples of Fibonacci and Lucas numbers

View at publisher Summarise with VIRAT
Authors: Thanapol Chaikaew, Chayanin Boonrat, Treesukon Suwanphrai, Konvika Kongkul, Siwaporn Saewan, Vishnu Napaphun
Cited by: 0
References: 5

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

A Pythagorean triple is a triple of positive integers (π‘Ž, 𝑏, 𝑐) such that π‘Ž2 + 𝑏2 = 𝑐2. If a, b and c are relatively prime, then (π‘Ž, 𝑏, 𝑐) is called a primitive Pythagorean triple. B. Berggren showed that the three 3 Γ— 3 generative matrices and the triple (3, 4, 5) generate all primitive Pythagorean triple, which results in a ternary tree of triplets. In this study, we present two 3 Γ— 3 matrices which generate the binary trees for Fibonacci number triples, Lucas number triples and the triples concerning the relation between Fibonacci and Lucas numbers. The construction of these binary trees are connected by involving two generating matrices and the trees for the triples of Fibonacci, Lucas and Fibonacci-Lucas numbers. Then we obtain the set of all triples (π‘Ž, 𝑏, 𝑐)π‘˜ that are nodes on level k of these numbers. Moreover, we propose and prove some theorems for finding the initial triple (node) of these binary trees by using two 3Γ—3 backward matrices for the triples in the upper and lower branches of the binary trees.

Fields of Study & Subjects

Advanced Mathematical Theories and Applications Advanced Combinatorial Mathematics Algebraic Geometry and Number Theory

Publication details

Journal / source
AIP conference proceedings
Volume
3462
Pages
140012–140012
Publication date
1 January 2026
Language
EN