Results 21 to 30 of about 111 (68)
Fibonacci numbers which are concatenations of two repdigits
We show that the only Fibonacci numbers that are concatenations of two repdigits are 13, 21, 34, 55, 89, 144, 233 ...
Alahmadi, Adel +7 more
core +1 more source
Perrin numbers expressible as sums of two base b repdigits
In this paper we study Perrin numbers that can be expressed as sums of two base b repdigits. This can be done using linear forms in logarithms of algebraic numbers and a version of the Baker–Davenport reduction ...
Bhoi, Khisan, Ray, Prasanta Kumar
core +1 more source
On repdigits as product of $k$-Fibonacci and $k$-Lucas numbers [PDF]
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 +2 more
doaj +1 more source
Narayana numbers as sums of two base b repdigits
In this study, we find all Narayana numbers which are expressible as sums of two base b repdigits. The proof of the main result uses lower bounds for linear forms in logarithms of algebraic numbers and a version of the Baker–Davenport reduction ...
Patel, Bijan Kumar +2 more
core +1 more source
Narayana numbers as products of three repdigits in base g
In this paper, we show that there are only finitely many Narayana's numbers which can be written as a product of three repdigits in base g with g >= 2. Moreover, for 2 <= g <= 10, we determine all these numbers.
Tiebekabe, Pagdame +2 more
core +1 more source
Here, we give an algorithm to detect all perfect repdigits in any base g>1. As an application, we find all such examples when g∈ [2, … ,333], extending a calculation from [2].
Broughan, Kevin A. +2 more
core +1 more source
The supplementary materials for two-term products of Fibonacci and Lucas numbers equaling repdigits.
This data sets file (.xlsx) is to supplementary support for the paper which shows that two-term products of Fibonacci number and Lucas number became repdigits. These materials are results computing the upper bounds of Fibonacci and Lucas numbers on Baker'
Harunori Nakayama (10708851)
core +1 more source
Repdigits as Sums of Four Tribonacci Numbers
In this paper, we show that 66666 is the largest repdigit expressible as the sum of four tribonacci numbers. We used Binet’s formula, Baker’s theory, and a reduction method during the proving procedure. We also used the periodic properties of
Yuetong Zhou +3 more
core +1 more source
Factorials as Repdigits in Base B
Let b is an element of {2, 3, ..., 9}. In this paper, we show that the solutions of the equation (x)(b) = m!
Irmak, Nurettin, Togbe, Alain
core +1 more source
Narayana numbers as product of three repdigits in base $g$
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

