Results 61 to 70 of about 133 (87)
Some of the next articles are maybe not open access.
Tribonacci numbers with two blocks of repdigits
Mathematica Slovaca, 2021AbstractThe Tribonacci sequence is a generalization of the Fibonacci sequence which starts with 0,0,1 and each term afterwards is the sum of the three preceding terms. Here, we show that the only Tribonacci numbers that are concatenations of two repdigits are 13,24,44,81.
Jhon Jairo Bravo Grijalba, Eric Bravo
exaly +3 more sources
Lucas numbers which are concatenations of three repdigits
Results in Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fatih Erduvan, Refik Keskin
exaly +4 more sources
Repdigits as sums of four Pell numbers [PDF]
Let \( (P_m)_{m\ge 0} \) be the sequence of \textit{Pell numbers} given by the linear recurrence; \( P_0=0 \), \( P_1=1 \), and \( P_{m+2} = 2P_{m+1}+ P_m \) for all \( m\ge 0 \). In the paper under review, the authors prove the following theorem, which is the main result in the paper. Theorem 1. All nonnegative integer solutions \( (m_1, m_2, m_3, m_4,
Florian Luca +2 more
openaire +2 more sources
Repdigits base b as products of two Lucas numbers
Bu yayının lisans anlaşması koşulları tam metin açık erişimine izin vermemektedir.Let (L-n) be the sequence of Lucas numbers defined byL(0)= 2, L-1= 1, andL(n)=Ln-1+L(n-2)forn >= 2. Let 0
Fatih Erduvan +2 more
exaly +2 more sources
Associated Pell numbers which are repdigits or concatenation of two repdigits
Boletín de la Sociedad Matemática Mexicana, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sai Gopal Rayaguru +2 more
openaire +1 more source
Fibonacci and Lucas numbers as products of three repdgits in base g
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.
Alain Togbé +2 more
exaly +2 more sources
Integers, 2012
Abstract.Here we show that the only aliquot cycle consisting only of rep-digits in base 10 is the cycle consisting of the perfect number 6.
Florian Luca, Herman te Riele
openaire +2 more sources
Abstract.Here we show that the only aliquot cycle consisting only of rep-digits in base 10 is the cycle consisting of the perfect number 6.
Florian Luca, Herman te Riele
openaire +2 more sources
Finiteness results for Diophantine triples with repdigit values [PDF]
Florian Luca, István Pink
exaly +3 more sources
Odd Repdigits to Small Bases Are Not Perfect
Integers, 2012Abstract.We demonstrate, by considering each base in the range 2 through 9 ...
Kevin A. Broughan, Qizhi Zhou
openaire +3 more sources
An Explicit Bound for Aliquot Cycles of Repdigits
Integers, 2012Abstract.We find an explicit bound, in terms ...
openaire +3 more sources

