• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.731-734
• /
• 2000

We present a novel graph labeling problem called Fibonacci edge labeling. The constraint in this labeling is placed on the allowable edge label which is the difference between the labels of endvertices of an edge. Each edge label should be (3m+2)-th Fibonacci numbers. We show that every Fibonacci tree can be labeled Fibonacci edge labeling. The labelings on the Fibonacci trees are applied to their embeddings into Fibonacci Circulants.

• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.243-257
• /
• 2022

In this paper, we present and prove an new theorem on symmetric functions. By using this theorem, we derive some new generating functions of the products of (p, q)-Fibonacci numbers, (p, q)-Lucas numbers, (p, q)-Pell numbers, (p, q)-Pell Lucas numbers, (p, q)-Jacobsthal numbers and (p, q)-Jacobsthal Lucas numbers with Chebyshev polynomials of the first kind.

• Journal for History of Mathematics
• /
• v.28 no.3
• /
• pp.151-164
• /
• 2015

The purpose of this paper is to develop a teaching and learning material integrated two subjects Pythagorean theorem and Fibonacci numbers. Traditionally the former subject belongs to geometry area and the latter is in algebra area. In this work we integrate these two issues and make a discovery method to generate infinitely many Pythagorean numbers by means of Fibonacci numbers. We have used this article as a teaching and learning material for a science high school and found that it is very appropriate for those students in advanced geometry and number theory courses.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.3
• /
• pp.577-590
• /
• 2013

The work is devoted to study Fibonacci and tribonacci numbers. We study the modular formulas and the periods of the sequences.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.4
• /
• pp.327-334
• /
• 2021

In this paper, we find all the prime numbers p that satisfy the following statement. If a positive integer k is a divisor of p - 1, then there is a sequence consisting of all k-th power residues modulo p, satisfying the recurrence equation of the Fibonacci sequence modulo p.

• Honam Mathematical Journal
• /
• v.42 no.2
• /
• pp.235-249
• /
• 2020

Let Q and R be the well-known matrices associated with Fibonacci and Lucas numbers, and k, m, and n be any integers. It is mainly established all solutions of the matrix equations c₁Qⁿ + c₂Q^m = Q^k, c₁Qⁿ + c₂Q^m = RQ^k, and c₁Qⁿ + c₂RQ^m = Q^k with unknowns c₁, c₂ ∈ ℂ*. Moreover, using the obtained results, it is presented many identities, some of them are available in the literature, and the others are new, related to the Fibonacci and Lucas numbers.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.3
• /
• pp.209-219
• /
• 2021

A set {a₁, a₂, ⋯ , a_m} of positive integers is called a Diophantine m-tuple if a_ia_j + 1 is a perfect square for all 1 ≤ i < j ≤ m. Let F_n be the nth Fibonacci number which is defined by F₀ = 0, F₁ = 1 and F_n+2 = F_n+1 + F_n. In this paper, we find the extendibility of Diophantine pairs {F_2k, b} with some conditions.

• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.63-72
• /
• 2004

It is known that each natural number can be written uniquely as a sum of Fibonacci numbers with suitably increasing indices. In 1960, Daykin showed that the sequence of Fibonacci numbers is the only sequence with this property. Consider here the problem of representing each natural number uniquely as a sum of positive integers taken from certain sequence allowing a fixed number, $\cal{l}\geq2$, of repetitions. It is shown that the $(\cal{l}+1)$-adic expansion is the only such representation possible.

• Communications of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.695-704
• /
• 2023

Area problems for triangles and polygons whose vertices have Fibonacci numbers on a plane were presented by A. Shriki, O. Liba, and S. Edwards et al. In 2017, V. P. Johnson and C. K. Cook addressed problems of the areas of triangles and polygons whose vertices have various sequences. This paper examines the conditions of triangles and polygons whose vertices have Lucas sequences and presents a formula for their areas.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1103-1113
• /
• 2009

We know that the first digits sequence of fibonacci numbers obey Benford's law. For the sequence in which the first two numbers are the arbitrary integers and the recurrence relation $a_{n+2}=a_{n+1}+a_n$ is satisfied, we can find that the first digits sequence of this sequence obey Benford's law. Also, we can find the stucture of the first digits sequence of this sequence with the exploratory data analysis tools.