• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.1-16
• /
• 2016

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the modified k-Fibonacci-like sequence and prove Binet's formula for this sequence and then use it to introduce and prove the Catalan, Cassini, and d'Ocagne identities for the modified k-Fibonacci-like sequence. Also, the ordinary generating function of this sequence is stated.

• East Asian mathematical journal
• /
• v.35 no.3
• /
• pp.285-288
• /
• 2019

Let $F_n$, $n{\in}{\mathbb{N}}$ be the n - th Fibonacci number, and let (p, q) be one of ordered pairs ($F_{n+2}$, $F_n$) or ($F_{n+1}$, $F_n$). Then we show that the multiplicative inverse of q mod p as well as that of p mod q are again Fibonacci numbers. For proof of our claim we make use of well-known Cassini, Catlan and dOcagne identities. As an application, we determine the number $N_{p,q}$ of nonzero term of a polynomial ${\Delta}_{p,q}(t)=\frac{(t^{pq}-1)(t-1)}{(t^p-1)(t^q-1)}$ through the Carlitz's formula.

• Kyungpook Mathematical Journal
• /
• v.49 no.3
• /
• pp.483-492
• /
• 2009

In this paper we give formulae for sums of products of two Horadam type generalized Fibonacci numbers with the same recurrence equation and with possibly different initial conditions. Analogous improved alternating sums are also studied as well as various derived sums when terms are multiplied either by binomial coefficients or by members of the sequence of natural numbers. These formulae are related to the recent work of Belbachir and Bencherif, $\v{C}$erin and $\v{C}$erin and Gianella.

• 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.

• 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.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.59-62
• /
• 2000

In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.

• 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.

• 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.