English
Related papers

Related papers: On a divisibility relation for Lucas sequences

200 papers

In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…

Number Theory · Mathematics 2016-01-19 Nazmiye Yilmaz , Yasin Yazlik , Necati Taskara

Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some…

Number Theory · Mathematics 2020-07-29 Robert Frontczak , Taras Goy

Let $n>m>k$ be positive integers and let $a,b,c$ be nonzero rational numbers. We consider the reducibility of some special quadrinomials $x^n+ax^m+bx^k+c$ with $n=4$ and 5, which related to the study of rational points on certain elliptic…

Number Theory · Mathematics 2016-05-24 Yong Zhang , Huilin Zhu

In this paper, we extend the $p$-adic valuations originally obtained by Carmichael for the sequences obtained by applying M\"obius inversion to Lucas sequences to $p$-adic congruences, from which we immediately derive corresponding…

Number Theory · Mathematics 2026-01-09 Tyler Ross , Zhongyan Shen , Tianxin Cai

This paper finds all Lucas numbers which are the sum of two Jacobsthal numbers. It also finds all Jacobsthal numbers which are the sum of two Lucas numbers. In general, we find all non-negative integer solutions $(n, m, k)$ of the two…

Number Theory · Mathematics 2024-10-17 Osama Salah , A. Elsonbaty , Mohammed Abdul Azim Seoud , Mohamed Anwar

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$…

Number Theory · Mathematics 2024-01-15 Herbert Batte , Mahadi Ddamulira , Juma Kasozi , Florian Luca

We define the $\textit{Divisor Divisibility Sequence}$ associated to a Laurent polynomial $f\in\mathbb{Z}[X_1^{\pm1},\ldots,X_N^{\pm1}]$ to be the sequence $W_n(f)=\prod f(\zeta_1,\ldots,\zeta_N)$, where $\zeta_1,\ldots,\zeta_N$ range over…

Number Theory · Mathematics 2018-07-03 Joseph H. Silverman

Let $u_n$ be a nondegenerate Lucas sequence. We generalize the results of Bugeaud, Mignotte, and Siksek, 2006 to give a systematic approach towards the problem of determining all perfect powers in any particular Lucas sequence. We then…

Number Theory · Mathematics 2013-07-25 Jesse Silliman , Isabel Vogt

In the article some algebraic properties of nonlinear two-dimensional lattices of the form $u_{n,xy} = f(u_{n+1}, u_n, u_{n-1})$ are studied. The problem of exhaustive description of the integrable cases of this kind lattices remains open.…

Exactly Solvable and Integrable Systems · Physics 2020-05-21 I. T. Habibullin , M. N. Kuznetsova , A. U. Sakieva

For integers $k \geq 2$, the $k$-generalized Lucas sequence $\{L_n^{(k)}\}_{n \geq 2-k}$ is defined by the recurrence relation \[ L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \quad \text{for } n \geq 2, \] with initial terms given by…

General Mathematics · Mathematics 2025-05-27 Herbert Batte , Prosper Kaggwa

In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4…

Number Theory · Mathematics 2009-12-14 Zhi-Wei Sun

This thesis is devoted to studying estimates of the least common multiple of some integer sequences. Our study focuses on effective bounding of the $\mathrm{lcm}$ of some class of quadratic sequences, as well as arithmetic progressions and…

Number Theory · Mathematics 2020-12-11 Sid Ali Bousla

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

Number Theory · Mathematics 2023-05-23 Said Zriaa , Mohammed Mouçouf

Let $(F_n)_{n\geq 0}$ and $(L_n)_{n\geq 0}$ be the Fibonacci and Lucas sequences, respectively. In this paper we determine all Fibonacci numbers which are mixed concatenations of a Fibonacci and a Lucas numbers. By mixed concatenations of $…

Number Theory · Mathematics 2022-06-29 Alaa Altassan , Murat Alan

A Lucas sequence is a sequence of the general form $v_n = (\phi^n - \bar{\phi}^n)/(\phi-\bar{\phi})$, where $\phi$ and $\bar{\phi}$ are real algebraic integers such that $\phi+\bar{\phi}$ and $\phi\bar{\phi}$ are both rational. Famous…

Number Theory · Mathematics 2017-08-30 Clemens Heuberger , Stephan Wagner

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

Number Theory · Mathematics 2013-11-20 Salvatore Tringali

Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo…

Number Theory · Mathematics 2023-09-04 Eric Rowland

The aim of this work is to present the description up to isomorphism of Leibniz superalgebras with characteristic sequence (n | m-1, 1) and nilindex n+m.

Rings and Algebras · Mathematics 2008-11-24 L. M. Camacho , J. R. Gómez , R. M. Navarro , B. A. Omirov

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Let $[x]$ be the greatest integer not exceeding $x$. In the paper we introduce the sequence $\{U_n\}$ given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]}\binom n{2k}U_{n-2k}\quad(n\ge 1)$, and establish many recursive formulas and congruences…

Number Theory · Mathematics 2010-12-21 Zhi-Hong Sun
‹ Prev 1 4 5 6 7 8 10 Next ›