Results 41 to 50 of about 111 (68)

Some Diophantine Equations involving associated Pell numbers and repdigits

open access: yes
In this paper, we explore the relationship between repdigits and associated Pell numbers, specifically focusing on two main aspects: expressing repdigits as the difference of two associated Pell numbers, and identifying which associated Pell numbers can ...
Panda, Gopal Krishna   +2 more
core  

Repdigits as difference of two balancing or Lucas-balancing numbers

open access: yes
Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we study the problem of writing repdigits as the difference of two balancing or Lucas-balancing numbers.
Panda, Gopal Krishna   +2 more
core  

Repdigits base b as products of two Lucas numbers

open access: yes, 2021
No ...
Keskin, Refik   +2 more
core  

Збалансовані числа, які є конкатенацією трьох репдиджитів

open access: yes
In this study, it is shown that the only balancing numbers which are concatenations of three repdigits are $204$ and $1189$. The proof depends on lower bounds for linear forms and some tools from Diophantine approximation.У цій статті ми встановили, що ...
Keskin, R., Erduvan, F.
core   +1 more source

Narayana\u27s cows numbers which are concatenations of three repdigits in base $ρ$

open access: yes
Narayana\u27s sequence is a ternary recurrent sequence defined by the recurrence relation $\mathcal{N}_n=\mathcal{N}_{n-1}+\mathcal{N}_{n-3}$ with initial terms $\mathcal{N}_0=0$ and $\mathcal{N}_1=\mathcal{N}_2=\mathcal{N}_3=1$.
Tiebekabe, Pagdame   +3 more
core  

On repdigits as product of consecutive Fibonacci numbers

open access: yes, 2012
Let (F$_{n}$)$_{n\geq0}$ be the Fibonacci sequence. In 2000, F. Luca proved that F10 = 55 is the largest repdigit (i.e. a number with only one distinct digit in its decimal expansion) in the Fibonacci sequence. In this note, we show that if Fn · · · F$
Marques, Diego, Togbé, Alain
core  

Perrin numbers that are palindromic concatenations of two repdigits

open access: yes
Let $ \{P_n\}_{n\geq 0} $ be the sequence of Perrin numbers defined by $P_0=3$, $P_1=0$,$P_2=2$ and $P_{n+3}=P_{n+1}+P_{n}$ for all $n \geq 0$. In this paper, we determine all Perrin numbers that are palindromic concatenations of two repdigits.Comment ...
Batte, Herbert, Kaggwa, Prosper
core  

A diophantine equation in k-Fibonacci numbers and repdigits

open access: yes, 2018
Gomez, C.   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy