• 대한수학회지
• /
• 제48권1호
• /
• pp.33-48
• /
• 2011

The notion of the generalized Fibonacci matrix $\mathcal{F}_n^{(a,b,s)}$ of type s, whose nonzero elements are generalized Fibonacci numbers, is introduced in the paper [23]. Regular case s = 0 is investigated in [23]. In the present article we consider singular case s = -1. Pseudoinverse of the generalized Fibonacci matrix $\mathcal{F}_n^{(a,b,-1)}$ is derived. Correlations between the matrix $\mathcal{F}_n^{(a,b,-1)}$ and the Pascal matrices are considered. Some combinatorial identities involving generalized Fibonacci numbers are derived. A class of test matrices for computing the Moore-Penrose inverse is presented in the last section.

• 대한수학회보
• /
• 제52권5호
• /
• pp.1467-1480
• /
• 2015

Generalized Fibonacci and Lucas sequences ($U_n$) and ($V_n$) are defined by the recurrence relations $U_{n+1}=PU_n+QU_{n-1}$ and $V_{n+1}=PV_n+QV_{n-1}$, $n{\geq}1$, with initial conditions $U_0=0$, $U_1=1$ and $V_0=2$, $V_1=P$. This paper deals with Fibonacci and Lucas numbers of the form $U_n$(P, Q) and $V_n$(P, Q) with the special consideration that $P{\geq}3$ is odd and Q = -1. Under these consideration, we solve the equations $V_n=5kx^2$, $V_n=7kx^2$, $V_n=5kx^2{\pm}1$, and $V_n=7kx^2{\pm}1$ when $k{\mid}P$ with k > 1. Moreover, we solve the equations $V_n=5x^2{\pm}1$ and $V_n=7x^2{\pm}1$.

• 대한수학회지
• /
• 제42권1호
• /
• pp.135-151
• /
• 2005

In this paper, we obtain some properties of the sequences $U^{q}_n\;and\;V^{q}_n$ introduced in [6]. We find polynomial representations and formulas of them. For q = 5, $U^{5}_n$ is the Fibonacci sequence $F_n\;and\;V^{5}_n$ is the Lucas sequence $L_n$.

• 대한수학회논문집
• /
• 제32권3호
• /
• pp.511-522
• /
• 2017

We explicitly solve the diophantine equations of the form $$A_{n_1}A_{n_2}{\cdots}A_{n_k}{\pm}1=B^2_m$$, where $(A_n)_{n{\geq}0}$ and $(B_m)_{m{\geq}0}$ are either the Fibonacci sequence or Lucas sequence. This extends the result of D. Marques [9] and L. Szalay [13] concerning a variant of Brocard-Ramanujan equation.

• 대한수학회논문집
• /
• 제31권3호
• /
• pp.447-450
• /
• 2016

Let $F_n$ and $L_n$ be the nth Fibonacci number and Lucas number, respectively. The order of appearance of m in the Fibonacci sequence, denoted by z(m), is the smallest positive integer k such that m divides $F_k$. Marques obtained the formula of $z(L^k_n)$ in some cases. In this article, we obtain the formula of $z(L^k_n)$ for all $n,k{\geq}1$.

• 충청수학회지
• /
• 제32권1호
• /
• pp.97-111
• /
• 2019

The purpose of work is to study the sums of k distanced numbers in Pell sequence {$P_i$} as well as in the generalized ${\lambda}-Pell$ sequence {$P_{{\lambda},i}$}.

• 대한수학회보
• /
• 제51권4호
• /
• pp.1041-1054
• /
• 2014

Let $P{\geq}3$ be an integer and let ($U_n$) and ($V_n$) denote generalized Fibonacci and Lucas sequences defined by $U_0=0$, $U_1=1$; $V_0= 2$, $V_1=P$, and $U_{n+1}=PU_n-U_{n-1}$, $V_{n+1}=PV_n-V_{n-1}$ for $n{\geq}1$. In this study, when P is odd, we solve the equations $V_n=kx^2$ and $V_n=2kx^2$ with k | P and k > 1. Then, when k | P and k > 1, we solve some other equations such as $U_n=kx^2$, $U_n=2kx^2$, $U_n=3kx^2$, $V_n=kx^2{\mp}1$, $V_n=2kx^2{\mp}1$, and $U_n=kx^2{\mp}1$. Moreover, when P is odd, we solve the equations $V_n=wx^2+1$ and $V_n=wx^2-1$ for w = 2, 3, 6. After that, we solve some Diophantine equations.

• 대한수학회논문집
• /
• 제29권3호
• /
• pp.387-399
• /
• 2014

The ratios of any two Fibonacci numbers are expressed by means of semisimple continued fraction.

• 호남수학학술지
• /
• 제41권1호
• /
• pp.197-206
• /
• 2019

We consider the extended generalized Hecke groups ${\bar{H}}_{3,q}$ generated by $X(z)=-(z-1)^{-1}$, $Y(z)=-(z+{\lambda}_q)^{-1}$ with ${\lambda}_q=2\;cos({\frac{\pi}{q}})$ where $q{\geq}3$ an integer. In this work, we study the generalized Pell sequences in ${\bar{H}}_{3,q}$. Also, we show that the entries of the matrix representation of each element in the extended generalized Hecke Group ${\bar{H}}_{3,3}$ can be written by using Pell, Pell-Lucas and modified-Pell numbers.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1439-1443
• /
• 2010

For a positive integer k $\geq$ 2, the k-bonacci sequence {$g^{(k)}_n$} is defined as: $g^{(k)}_1=\cdots=g^{(k)}_{k-2}=0$, $g^{(k)}_{k-1}=g^{(k)}_k=1$ and for n > k $\geq$ 2, $g^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n-2}+{\cdots}+g^{(k)}_{n-k}$. And the k-Lucas sequence {$l^{(k)}_n$} is defined as $l^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n+k-1}$ for $n{\geq}1$. In this paper, we give a representation of nth k-Lucas $l^{(k)}_n$ by using determinant.