scholarly journals Congruences for $q$-Lucas Numbers

10.37236/2557 ◽  
2013 ◽  
Vol 20 (2) ◽  
Author(s):  
Hao Pan

For $\alpha,\beta,\gamma,\delta\in{\mathbb Z}$ and ${\rm\nu}=(\alpha,\beta,\gamma,\delta)$, the $q$-Fibonacci numbers are given by$$F_0^{{\rm\nu}}(q)=0,\ F_1^{{\rm\nu}}(q)=1\text{ and }F_{n+1}^{{\rm\nu}}(q)=q^{\alpha n-\beta}F_{n}^{{\rm\nu}}(q)+q^{\gamma n-\delta}F_{n-1}^{{\rm\nu}}(q)\text{ for }n\geq 1.$$And define the $q$-Lucas number $L_{n}^{{\rm\nu}}(q)=F_{n+1}^{{\rm\nu}}(q)+q^{\gamma-\delta}F_{n-1}^{{\rm\nu}_*}(q)$, where ${\rm\nu}_*=(\alpha,\beta-\alpha,\gamma,\delta-\gamma)$. Suppose that $\alpha=0$ and $\gamma$ is prime to $n$, or $\alpha=\gamma$ is prime to $n$. We prove that$$L_{n}^{{\rm\nu}}(q)\equiv(-1)^{\alpha(n+1)}\pmod{\Phi_n(q)}$$for $n\geq 3$, where $\Phi_n(q)$ is the $n$-th cyclotomic polynomial. A similar congruence for $q$-Pell-Lucas numbers is also established.

2021 ◽  
Vol 56 (2) ◽  
pp. 124-132
Author(s):  
P. Ray ◽  
K. Bhoi

In the present study we investigate all repdigits which are expressed as a difference of two Fibonacci or Lucas numbers. We show that if $F_{n}-F_{m}$ is a repdigit, where $F_{n}$ denotes the $n$-th Fibonacci number, then $(n,m)\in \{(7,3),(9,1),(9,2),(11,1),(11,2),$ $(11,9),(12,11),(15,10)\}.$ Further, if $L_{n}$ denotes the $n$-th Lucas number, then $L_{n}-L_{m}$ is a repdigit for $(n,m)\in\{(6,4),(7,4),(7,6),(8,2)\},$ where $n>m.$Namely, the only repdigits that can be expressed as difference of two Fibonacci numbers are $11,33,55,88$ and $555$; their representations are $11=F_{7}-F_{3},\33=F_{9}-F_{1}=F_{9}-F_{2},\55=F_{11}-F_{9}=F_{12}-F_{11},\88=F_{11}-F_{1}=F_{11}-F_{2},\555=F_{15}-F_{10}$ (Theorem 2). Similar result for difference of two Lucas numbers: The only repdigits that can be expressed as difference of two Lucas numbers are $11,22$ and $44;$ their representations are $11=L_{6}-L_{4}=L_{7}-L_{6},\ 22=L_{7}-L_{4},\4=L_{8}-L_{2}$ (Theorem 3).


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Abhishek Mishra ◽  
Vishnu Narayan Mishra ◽  
M. Mursaleen

AbstractIn this paper, we establish a new estimate for the degree of approximation of functions $f(x,y)$ f ( x , y ) belonging to the generalized Lipschitz class $Lip ((\xi _{1}, \xi _{2} );r )$ L i p ( ( ξ 1 , ξ 2 ) ; r ) , $r \geq 1$ r ≥ 1 , by double Hausdorff matrix summability means of double Fourier series. We also deduce the degree of approximation of functions from $Lip ((\alpha ,\beta );r )$ L i p ( ( α , β ) ; r ) and $Lip(\alpha ,\beta )$ L i p ( α , β ) in the form of corollary. We establish some auxiliary results on trigonometric approximation for almost Euler means and $(C, \gamma , \delta )$ ( C , γ , δ ) means.


2020 ◽  
Vol 70 (3) ◽  
pp. 641-656
Author(s):  
Amira Khelifa ◽  
Yacine Halim ◽  
Abderrahmane Bouchair ◽  
Massaoud Berkal

AbstractIn this paper we give some theoretical explanations related to the representation for the general solution of the system of the higher-order rational difference equations$$\begin{array}{} \displaystyle x_{n+1} = \dfrac{1+2y_{n-k}}{3+y_{n-k}},\qquad y_{n+1} = \dfrac{1+2z_{n-k}}{3+z_{n-k}},\qquad z_{n+1} = \dfrac{1+2x_{n-k}}{3+x_{n-k}}, \end{array}$$where n, k∈ ℕ0, the initial values x−k, x−k+1, …, x0, y−k, y−k+1, …, y0, z−k, z−k+1, …, z1 and z0 are arbitrary real numbers do not equal −3. This system can be solved in a closed-form and we will see that the solutions are expressed using the famous Fibonacci and Lucas numbers.


2016 ◽  
Vol 67 (1) ◽  
pp. 41-46
Author(s):  
Pavel Trojovský

Abstract Let k ≥ 1 and denote (Fk,n)n≥0, the k-Fibonacci sequence whose terms satisfy the recurrence relation Fk,n = kFk,n−1 +Fk,n−2, with initial conditions Fk,0 = 0 and Fk,1 = 1. In the same way, the k-Lucas sequence (Lk,n)n≥0 is defined by satisfying the same recurrence relation with initial values Lk,0 = 2 and Lk,1 = k. These sequences were introduced by Falcon and Plaza, who showed many of their properties, too. In particular, they proved that Fk,n+1 + Fk,n−1 = Lk,n, for all k ≥ 1 and n ≥ 0. In this paper, we shall prove that if k ≥ 1 and $F_{k,n + 1}^s + F_{k,n - 1}^s \in \left( {L_{k,m} } \right)_{m \ge 1} $ for infinitely many positive integers n, then s =1.


1989 ◽  
Vol 111 (1) ◽  
pp. 5-33 ◽  
Author(s):  
Pedro Aparicio ◽  
Jose Maria Alonso ◽  
Maria Luisa Toribio ◽  
Jose Carlos Gutierrez ◽  
Luis Pezzi ◽  
...  

Author(s):  
Yuksel Soykan

In this paper, closed forms of the sum formulas Σn k=0 kW3 k and Σn k=1 kW3-k for the cubes of generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery. Our work generalize second order recurrence relations.


2020 ◽  
pp. 66-82
Author(s):  
Y¨uksel Soykan

In this paper, closed forms of the summation formulas for generalized Fibonacci and Gaussian generalized Fibonacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers and Gaussian Fibonacci, Gaussian Lucas, Gaussian Pell, Gaussian Pell-Lucas, Gaussian Jacobsthal, Gaussian Jacobsthal-Lucas numbers.


Sign in / Sign up

Export Citation Format

Share Document