Results 41 to 50 of about 161 (91)

Repdigits in k-Lucas sequences

Proceedings - Mathematical Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bravo, Jhon J., Luca, Florian
openaire   +1 more source

On repdigits as product of $k$-Fibonacci and $k$-Lucas numbers [PDF]

Mathematica Bohemica
For an integer $k\geq2$, let $(F_n^{(k)})_{n\geq-(k-2)}$, $(L_n^{(k)})_{n \geq-(k-2)}$ be $k$-Fibonacci and $k$-Lucas sequences, respectively. For these sequences the first $k$ terms are $0,\ldots,0,1$ and $0,\ldots,0,2,1$, respectively, and each term ...
Safia Seffah, Salah Eddine Rihane, Alain Togbé   +2 more
doaj   +1 more source

Repdigits Base $b$ as Difference of Two Fibonacci Numbers

Journal of Mathematical Study, 2022
Summary: In this paper, we find all repdigits expressible as difference of two Fibonacci numbers in base \(b\) for \(2\leq b\leq10\). The largest repdigits in base \(b\), which can be written as difference of two Fibonacci numbers are \[ \begin{aligned} &F_9-F_4=34-3=31=(11111)_2, &&F_{14}-F_7=377-13=364=(111111)_3,\\ &F_{14}-F_7=377-13=364=(222)_4 ...
Siar, Zafer, Erduvan, Fatih, Keskin, Refik, Keskin, Refik   +3 more
openaire   +4 more sources

Repdigits in Narayana's Cows Sequence and their Consequences

, 2020
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., Das, Pranabesh, Guzmán, Sergio   +2 more
openaire   +3 more sources

Repdigits as products of two Fibonacci or Lucas numbers

Proceedings - Mathematical Sciences, 2020
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, Keskin, Refik, Keskin, Refik   +2 more
openaire   +2 more sources

Two Problems on Narayana Numbers And Repeated Digit Numbers [PDF]

, 2023
In this paper, we find all repdigits which can be expressed as the product of a Narayana, and a product of two repdigits is ...
Abou-Elela, G., Anwar, M., Elsonbaty, A.
core   +1 more source

Fibonacci and Lucas numbers as products of three repdgits in base g [PDF]

, 2023
Recall that repdigit in base g is a positive integer that has only one digit in its base g expansion, i.e. a number of the form a(g^m-1)/(g−1), for some positive integers m ≥ 1, g ≥ 2 and 1 ≤ a ≤ g − 1.
Adedji, Kouessi Norbert, Togbe, Alain, Filipin, Alan   +2 more
core  

Repdigits as sums of three balancing numbers [PDF]

, 2019
International audienceLet \{Bn\}_{n\ge 0} be the sequence of Balancing numbers defined by $B_0 = 0, ~B_1 = 1$, and $B_{n+2} = 6B_{n+1} − B_n$ for all $n \ge 0$.
Ddamulira, Mahadi
core  

Repdigit sokszögszámok, repdigit középpontos sokszögszámok

Debreceni Szemle
Az előadás összefoglalója: A matematikában repdigit számoknak nevezzük azokat az egész számokat, amelyeknek minden számjegye megegyezik. A tízes számrendszerben erre példa a 222, 55555, stb. Ez általános alakban a d((10^k-1)/9) képlettel adható meg, ahol d jelöli az ismétlődő számjegyet, vagyis d az {1, 2, 3,...,9} halmaz eleme, k pedig a számjegyek ...
openaire   +1 more source

Diophantine Equations Related to Linear Recurrence Sequences [PDF]

, 2021
The aim of this dissertation is to investigate the solutions of some Diophantine equations connected to linear recurrence sequences. We firstly study the integer solutions of Diophantine equations related to reciprocals and repdigits with linear ...
Hashim, Hayder Raheem
core