Results 41 to 50 of about 198 (98)
A Diophantine equation in $k$-Fibonacci numbers and repdigits [PDF]
Summary: The \(k\)-generalized Fibonacci sequence \(\{F_{n}^{(k)}\}_{n}\) starts with the \(k\) values \(0,\dots ,0,1\) and each term afterwards is the sum of the \(k\) preceding terms. We study which members of this sequence are sums of two repdigts, extending a result of \textit{S. Díaz Alvarado} and \textit{F. Luca} [Aportaciones Mat., Investig. 20,
Bravo, J. +2 more
openaire +3 more sources
Padovan numbers that are concatenations of two distinct repdigits [PDF]
Abstract Let ( P n ) n ≥0 be the sequence of Padovan numbers defined by P
openaire +5 more sources
Narayana numbers as product of three repdigits in base $g$ [PDF]
In this paper, we show that there are only finitely many Narayana's numbers which can be written as product of three repdigits in base $g$ with $g \geq 2$.
Tiebekabe, Pagdame +2 more
core +1 more source
Repdigits in Narayana's Cows Sequence and their Consequences
Narayana's cows sequence satisfies the third-order linear recurrence relation $N_n=N_{n-1}+N_{n-3}$ for $n \geq 3$ with initial conditions $N_0=0$ and $N_1=N_2=1$. In this paper, we study $b$-repdigits which are sums of two Narayana numbers. We explicitly determine these numbers for the bases $2\le b\leq100$ as an illustration.
Bravo, Jhon J. +2 more
openaire +3 more sources
Almost Repdigits in $ k-$generalized Lucas Sequences
Let $ k \geq 2 $ and $ ( L_{n}^{(k)} )_{n \geq 2-k} $ be the $k-$generalized Lucas sequence with initial condition $ L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)}=0 ,$ $ L_{0}^{(k,}=2,$ $ L_{1}^{(k)}=1$ and each term afterwards is the sum of the $ k $ preceding ...
Altassan, Alaa, Alan, Murat
core
Repdigits as Product of Fibonacci and Pell numbers
In this paper, we find all repdigits which can be expressed as the product of a Fibonacci number and a Pell number. We use of a combined approach of lower bounds for linear forms in logarithms of algebraic numbers and a version of the Baker-Davenport ...
Abdullah CAGMAN
core +1 more source
$k$-Pell-Lucas numbers as Product of Two Repdigits
For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms.
Tripathy, Bibhu Prasad +1 more
core
Fibonacci Or Lucas Numbers Which Are Products Of Two Repdigits İn Base B
Bu yayının lisans anlaşması koşulları tam metin açık erişimine izin vermemektedir.In this study, we find all Fibonacci and Lucas numbers which can be expressible as a product of two repdigits in the base b.
Keskin, Refik +2 more
core +1 more source
Repdigits as products of two Fibonacci or Lucas numbers
Let \( (F_n)_{n\ge 0} \) and \( (L_n)_{n\ge 0} \) be the sequences of Fibonacci and Lucas numbers given by \( F_0=0, ~ F_1=1, ~ L_0=2, ~L_1=1 \), \( F_{n+2}=F_{n+1}+F_n \), and \( L_{n+2}=L_{n+1}+L_n \) for all \( n\ge 0 \), respectively. A repdigit is a positive integer \( N \) that has only one distinct digit when written in its decimal expansion ...
Erduvan, Fatih +2 more
openaire +2 more sources
Repdigits Base B As Difference Of Two Fibonacci Numbers
Bu yayın 06.11.1981 tarihli ve 17506 sayılı Resmî Gazete’de yayımlanan 2547 sayılı Yükseköğretim Kanunu’nun 4/c, 12/c, 42/c ve 42/d maddelerine dayalı 12/12/2019 tarih, 543 sayılı ve 05 numaralı Üniversite Senato Kararı ile hazırlanan Sakarya ...
Keskin, Refik +2 more
core +1 more source

