• 호남수학학술지
• /
• 제40권1호
• /
• pp.139-153
• /
• 2018

Let $P{\geq}3$ be an integer and let ($U_n$) denote generalized Fibonacci sequence defined by $U_0=0$, $U_1=1$ and $U_{n+1}=PU_n-U_{n-1}$ for $n{\geq}1$. In this study, when P is odd, we solve the equation $U_n=11x^2+1$. We show that only $U_1$ and $U_2$ may be of the form $11x^2+1$.

• Journal of applied mathematics & informatics
• /
• 제40권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.

• 한국수학사학회지
• /
• 제28권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.

• 충청수학회지
• /
• 제26권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.

• 충청수학회지
• /
• 제34권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.

• 호남수학학술지
• /
• 제42권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.

• 충청수학회지
• /
• 제34권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.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제11권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.

• 대한수학회논문집
• /
• 제38권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.

• 응용통계연구
• /
• 제22권5호
• /
• pp.1103-1113
• /
• 2009

피보나치수열의 첫 숫자수열이 벤포드법칙을 따름은 알려진 사실이다. 이러한 피보나치수열을 확장하여 임의의 두개의 자연수를 정하고 재귀식 $a_{n+2}=a_{n+1}+a_n$을 만족하는 수열을 만들었을 때 이 수열의 첫 숫자수열이 벤포드법칙을 만족하는 지를 확인하고 이러한 수열의 첫 숫자수열의 구조를 탐색적 자료분석의 입장에서 살펴보았다.